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.r098-tall-177955695700634.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 DLCround-PT-11a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695700634
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.5K Mar 6 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 6 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 6 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 6 17:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 17:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Mar 6 17:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Mar 6 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 126K Mar 6 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 762K 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 DLCround-PT-11a-CTLFireability-2024-00
FORMULA_NAME DLCround-PT-11a-CTLFireability-2024-01
FORMULA_NAME DLCround-PT-11a-CTLFireability-2024-02
FORMULA_NAME DLCround-PT-11a-CTLFireability-2024-03
FORMULA_NAME DLCround-PT-11a-CTLFireability-2024-04
FORMULA_NAME DLCround-PT-11a-CTLFireability-2024-05
FORMULA_NAME DLCround-PT-11a-CTLFireability-2024-06
FORMULA_NAME DLCround-PT-11a-CTLFireability-2024-07
FORMULA_NAME DLCround-PT-11a-CTLFireability-2024-08
FORMULA_NAME DLCround-PT-11a-CTLFireability-2024-09
FORMULA_NAME DLCround-PT-11a-CTLFireability-2024-10
FORMULA_NAME DLCround-PT-11a-CTLFireability-2024-11
FORMULA_NAME DLCround-PT-11a-CTLFireability-2024-12
FORMULA_NAME DLCround-PT-11a-CTLFireability-2024-13
FORMULA_NAME DLCround-PT-11a-CTLFireability-2024-14
FORMULA_NAME DLCround-PT-11a-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779643767920

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-11a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 17:29:29] [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-24 17:29:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 17:29:29] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2026-05-24 17:29:29] [INFO ] Transformed 377 places.
[2026-05-24 17:29:29] [INFO ] Transformed 2993 transitions.
[2026-05-24 17:29:29] [INFO ] Found NUPN structural information;
[2026-05-24 17:29:29] [INFO ] Parsed PT model containing 377 places and 2993 transitions and 11677 arcs in 252 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Ensure Unique test removed 280 transitions
Reduce redundant transitions removed 280 transitions.
Support contains 134 out of 377 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 377/377 places, 2713/2713 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 366 transition count 2534
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 366 transition count 2534
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 366 transition count 2533
Drop transitions (Redundant composition of simpler transitions.) removed 861 transitions
Redundant transition composition rules discarded 861 transitions
Iterating global reduction 1 with 861 rules applied. Total rules applied 884 place count 366 transition count 1672
Applied a total of 884 rules in 123 ms. Remains 366 /377 variables (removed 11) and now considering 1672/2713 (removed 1041) transitions.
[2026-05-24 17:29:29] [INFO ] Flow matrix only has 222 transitions (discarded 1450 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8931691245916539650.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18309815144104218540.kers'
[2026-05-24 17:29:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8931691245916539650.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18309815144104218540.kers]
Normalized transition count is 221 out of 222 initially.
Culling duplicate invariants (modulo rational): removing 228 columns.
Culled 228 columns in 0 ms.
// Phase 1: matrix 221 rows 138 cols 457 entries
Finished phase 1 with 122 SingleSign rule and 0 generalized
[2026-05-24 17:29:29] [INFO ] Computed 244 invariants in 1 ms
Computed 244 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18309815144104218540.kers
Total runtime 1 ms.
[2026-05-24 17:29:30] [INFO ] Implicit Places using invariants in 1009 ms returned [138, 141, 142, 145, 146, 147, 148, 149, 150, 151, 152, 154, 157, 158, 159, 160, 161, 162, 163, 164, 167, 169, 172, 176, 177, 178, 180, 181, 182, 183, 184, 187, 188, 189, 190, 192, 193, 194, 195, 196, 197, 198, 201, 202, 203, 204, 205, 207, 209, 210, 212, 213, 215, 216, 220, 221, 222, 223, 224, 226, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 241, 244, 245, 246, 248, 249, 250, 251, 253, 254, 257, 259, 261, 263, 266, 269, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 284, 289, 291, 292, 293, 294, 295, 296, 297, 299, 301, 302, 304, 305, 307, 308, 309, 310, 311, 312, 313, 315, 316, 317, 318, 319, 320, 322, 323, 327, 329, 331, 332, 333, 335, 336, 339, 340, 341, 342, 344, 345, 346, 347, 348, 353, 354, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365]
Discarding 154 places :
Ensure Unique test removed 889 transitions
Reduce isomorphic transitions removed 889 transitions.
Implicit Place search using SMT only with invariants took 1051 ms to find 154 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/377 places, 783/2713 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 485 transitions
Redundant transition composition rules discarded 485 transitions
Iterating global reduction 0 with 485 rules applied. Total rules applied 485 place count 212 transition count 298
Applied a total of 485 rules in 9 ms. Remains 212 /212 variables (removed 0) and now considering 298/783 (removed 485) transitions.
[2026-05-24 17:29:30] [INFO ] Flow matrix only has 222 transitions (discarded 76 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7727307814757799894.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4978014632275763237.kers'
[2026-05-24 17:29:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7727307814757799894.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4978014632275763237.kers]
Normalized transition count is 221 out of 222 initially.
Culling duplicate invariants (modulo rational): removing 74 columns.
Culled 74 columns in 0 ms.
// Phase 1: matrix 221 rows 138 cols 457 entries
Finished phase 1 with 122 SingleSign rule and 0 generalized
[2026-05-24 17:29:30] [INFO ] Computed 90 invariants in 1 ms
Computed 90 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4978014632275763237.kers
Total runtime 1 ms.
[2026-05-24 17:29:30] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-24 17:29:30] [INFO ] Flow matrix only has 222 transitions (discarded 76 similar events)
[2026-05-24 17:29:30] [INFO ] Invariant cache hit.
[2026-05-24 17:29:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 17:29:30] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 212/377 places, 298/2713 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1379 ms. Remains : 212/377 places, 298/2713 transitions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 298/298 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2026-05-24 17:29:30] [INFO ] Flow matrix only has 222 transitions (discarded 76 similar events)
[2026-05-24 17:29:30] [INFO ] Invariant cache hit.
[2026-05-24 17:29:30] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-24 17:29:30] [INFO ] Flow matrix only has 222 transitions (discarded 76 similar events)
[2026-05-24 17:29:30] [INFO ] Invariant cache hit.
[2026-05-24 17:29:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 17:29:30] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 297 sub problems to find dead transitions.
[2026-05-24 17:29:30] [INFO ] Flow matrix only has 222 transitions (discarded 76 similar events)
[2026-05-24 17:29:30] [INFO ] Invariant cache hit.
[2026-05-24 17:29:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (OVERLAPS) 74/212 variables, 74/90 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (OVERLAPS) 221/433 variables, 212/302 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 1/434 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (OVERLAPS) 0/434 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 303 constraints, problems are : Problem set: 0 solved, 297 unsolved in 20388 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 212/212 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (OVERLAPS) 74/212 variables, 74/90 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (OVERLAPS) 221/433 variables, 212/302 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 297/599 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (OVERLAPS) 1/434 variables, 1/600 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (OVERLAPS) 0/434 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 600 constraints, problems are : Problem set: 0 solved, 297 unsolved in 21568 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 212/212 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42029ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 42053ms
Finished structural reductions in LTL mode , in 1 iterations and 42240 ms. Remains : 212/212 places, 298/298 transitions.
Support contains 134 out of 212 places after structural reductions.
[2026-05-24 17:30:13] [INFO ] Flatten gal took : 39 ms
[2026-05-24 17:30:13] [INFO ] Flatten gal took : 16 ms
[2026-05-24 17:30:13] [INFO ] Input system was already deterministic with 298 transitions.
Support contains 132 out of 212 places (down from 134) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1055 ms. (37 steps per ms) remains 1/73 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
[2026-05-24 17:30:13] [INFO ] Flow matrix only has 222 transitions (discarded 76 similar events)
[2026-05-24 17:30:13] [INFO ] Invariant cache hit.
[2026-05-24 17:30:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Real declared 11/434 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 2/90 constraints, State Equation: 0/212 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2026-05-24 17:30:13] [INFO ] Flatten gal took : 12 ms
[2026-05-24 17:30:13] [INFO ] Flatten gal took : 11 ms
[2026-05-24 17:30:13] [INFO ] Input system was already deterministic with 298 transitions.
Computed a total of 75 stabilizing places and 1 stable transitions
Graph (complete) has 387 edges and 212 vertex of which 138 are kept as prefixes of interest. Removing 74 places using SCC suffix rule.5 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 298/298 transitions.
Graph (trivial) has 279 edges and 212 vertex of which 123 / 212 are part of one of the 17 SCC in 2 ms
Free SCC test removed 106 places
Ensure Unique test removed 247 transitions
Reduce isomorphic transitions removed 247 transitions.
Graph (complete) has 140 edges and 106 vertex of which 37 are kept as prefixes of interest. Removing 69 places using SCC suffix rule.1 ms
Discarding 69 places :
Also discarding 0 output transitions
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 0 with 2 rules applied. Total rules applied 4 place count 37 transition count 49
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 35 transition count 46
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 place count 33 transition count 45
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 23 place count 22 transition count 33
Iterating global reduction 3 with 11 rules applied. Total rules applied 34 place count 22 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 37 place count 22 transition count 30
Applied a total of 37 rules in 15 ms. Remains 22 /212 variables (removed 190) and now considering 30/298 (removed 268) transitions.
[2026-05-24 17:30:13] [INFO ] Flow matrix only has 18 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4931144791149456436.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9981208113343366752.kers'
[2026-05-24 17:30:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4931144791149456436.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9981208113343366752.kers]
Normalized transition count is 17 out of 18 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 17 rows 16 cols 38 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-24 17:30:13] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9981208113343366752.kers
Total runtime 0 ms.
[2026-05-24 17:30:13] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-24 17:30:13] [INFO ] Flow matrix only has 18 transitions (discarded 12 similar events)
[2026-05-24 17:30:13] [INFO ] Invariant cache hit.
[2026-05-24 17:30:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 17:30:13] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2026-05-24 17:30:13] [INFO ] Redundant transitions in 0 ms returned []
Running 29 sub problems to find dead transitions.
[2026-05-24 17:30:13] [INFO ] Flow matrix only has 18 transitions (discarded 12 similar events)
[2026-05-24 17:30:13] [INFO ] Invariant cache hit.
[2026-05-24 17:30:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 5/22 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 17/39 variables, 22/33 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 1/40 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/40 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 34 constraints, problems are : Problem set: 0 solved, 29 unsolved in 410 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 22/22 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 5/22 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 17/39 variables, 22/33 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 29/62 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 1/40 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 0/40 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 63 constraints, problems are : Problem set: 0 solved, 29 unsolved in 434 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 22/22 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 846ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 846ms
Starting structural reductions in SI_CTL mode, iteration 1 : 22/212 places, 30/298 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 918 ms. Remains : 22/212 places, 30/298 transitions.
[2026-05-24 17:30:14] [INFO ] Flatten gal took : 3 ms
[2026-05-24 17:30:14] [INFO ] Flatten gal took : 2 ms
[2026-05-24 17:30:14] [INFO ] Input system was already deterministic with 30 transitions.
[2026-05-24 17:30:14] [INFO ] Flatten gal took : 1 ms
[2026-05-24 17:30:14] [INFO ] Flatten gal took : 1 ms
[2026-05-24 17:30:14] [INFO ] Time to serialize gal into /tmp/CTLFireability9111700346850653535.gal : 0 ms
[2026-05-24 17:30:14] [INFO ] Time to serialize properties into /tmp/CTLFireability8195529564806824141.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9111700346850653535.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8195529564806824141.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,193,0.011037,3788,2,54,5,172,6,0,90,110,0


Converting to forward existential form...Done !
original formula: EF((AG(((((p9==1)&&(p167==1))||((p138==1)&&(p362==1)))||(((p43==1)&&(p266==1))||((p86==1)&&(p196==1))))) * ((p36==0)||(p154==0))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * ((p36==0)||(p154==0))) * !(E(TRUE U !(((((p9==1)&&(p167==1))||((p138==1)&&(p362==1)))||(((p...212
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.015112,4116,1,0,6,588,15,0,440,175,5
FORMULA DLCround-PT-11a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 298/298 transitions.
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 141 transition count 298
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 90 place count 122 transition count 260
Iterating global reduction 1 with 19 rules applied. Total rules applied 109 place count 122 transition count 260
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 112 place count 122 transition count 257
Applied a total of 112 rules in 7 ms. Remains 122 /212 variables (removed 90) and now considering 257/298 (removed 41) transitions.
[2026-05-24 17:30:14] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17236542053548303408.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1442367419924984989.kers'
[2026-05-24 17:30:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17236542053548303408.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1442367419924984989.kers]
Normalized transition count is 199 out of 200 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 199 rows 119 cols 413 entries
Finished phase 1 with 103 SingleSign rule and 0 generalized
[2026-05-24 17:30:14] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1442367419924984989.kers
Total runtime 1 ms.
[2026-05-24 17:30:14] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-24 17:30:14] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
[2026-05-24 17:30:14] [INFO ] Invariant cache hit.
[2026-05-24 17:30:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 17:30:14] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2026-05-24 17:30:14] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
[2026-05-24 17:30:14] [INFO ] Invariant cache hit.
[2026-05-24 17:30:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 3/122 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 199/321 variables, 122/141 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 1/322 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 0/322 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 142 constraints, problems are : Problem set: 0 solved, 256 unsolved in 12707 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 122/122 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 3/122 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 199/321 variables, 122/141 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 256/397 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (OVERLAPS) 1/322 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 10 (OVERLAPS) 0/322 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 398 constraints, problems are : Problem set: 0 solved, 256 unsolved in 11332 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 122/122 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24058ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 24065ms
Starting structural reductions in LTL mode, iteration 1 : 122/212 places, 257/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24176 ms. Remains : 122/212 places, 257/298 transitions.
[2026-05-24 17:30:39] [INFO ] Flatten gal took : 11 ms
[2026-05-24 17:30:39] [INFO ] Flatten gal took : 7 ms
[2026-05-24 17:30:39] [INFO ] Input system was already deterministic with 257 transitions.
[2026-05-24 17:30:39] [INFO ] Flatten gal took : 7 ms
[2026-05-24 17:30:39] [INFO ] Flatten gal took : 7 ms
[2026-05-24 17:30:39] [INFO ] Time to serialize gal into /tmp/CTLFireability5195067469479762457.gal : 3 ms
[2026-05-24 17:30:39] [INFO ] Time to serialize properties into /tmp/CTLFireability226297392598021743.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/CTLFireability5195067469479762457.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability226297392598021743.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.43582e+13,0.030474,5024,2,346,5,1399,6,0,680,1010,0


Converting to forward existential form...Done !
original formula: AF(EX((AG(((p67==1)&&(p325==1))) * AX((((p49==0)||(p276==0))&&((p72==0)||(p294==0)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX((!(E(TRUE U !(((p67==1)&&(p325==1))))) * !(EX(!((((p49==0)||(p276==0))&&((p72==0)||(p294==0)))))...169
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.115895,7792,1,0,10,18802,21,2,3179,3603,13
FORMULA DLCround-PT-11a-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 298/298 transitions.
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 143 transition count 298
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 89 place count 123 transition count 258
Iterating global reduction 1 with 20 rules applied. Total rules applied 109 place count 123 transition count 258
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 112 place count 123 transition count 255
Applied a total of 112 rules in 9 ms. Remains 123 /212 variables (removed 89) and now considering 255/298 (removed 43) transitions.
[2026-05-24 17:30:39] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13344393498249521514.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10658981300400098906.kers'
[2026-05-24 17:30:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13344393498249521514.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10658981300400098906.kers]
Normalized transition count is 198 out of 199 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 198 rows 118 cols 411 entries
Finished phase 1 with 102 SingleSign rule and 0 generalized
[2026-05-24 17:30:39] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10658981300400098906.kers
Total runtime 1 ms.
[2026-05-24 17:30:39] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-24 17:30:39] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
[2026-05-24 17:30:39] [INFO ] Invariant cache hit.
[2026-05-24 17:30:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 17:30:39] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 254 sub problems to find dead transitions.
[2026-05-24 17:30:39] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
[2026-05-24 17:30:39] [INFO ] Invariant cache hit.
[2026-05-24 17:30:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 5/123 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (OVERLAPS) 198/321 variables, 123/144 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 1/322 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 9 (OVERLAPS) 0/322 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 145 constraints, problems are : Problem set: 0 solved, 254 unsolved in 12473 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 123/123 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 5/123 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (OVERLAPS) 198/321 variables, 123/144 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 254/398 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (OVERLAPS) 1/322 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 10 (OVERLAPS) 0/322 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 399 constraints, problems are : Problem set: 0 solved, 254 unsolved in 12270 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 123/123 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24762ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 24764ms
Starting structural reductions in LTL mode, iteration 1 : 123/212 places, 255/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24879 ms. Remains : 123/212 places, 255/298 transitions.
[2026-05-24 17:31:04] [INFO ] Flatten gal took : 10 ms
[2026-05-24 17:31:04] [INFO ] Flatten gal took : 6 ms
[2026-05-24 17:31:04] [INFO ] Input system was already deterministic with 255 transitions.
[2026-05-24 17:31:04] [INFO ] Flatten gal took : 8 ms
[2026-05-24 17:31:04] [INFO ] Flatten gal took : 6 ms
[2026-05-24 17:31:04] [INFO ] Time to serialize gal into /tmp/CTLFireability1311670033519280953.gal : 3 ms
[2026-05-24 17:31:04] [INFO ] Time to serialize properties into /tmp/CTLFireability7175909350992227252.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/CTLFireability1311670033519280953.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7175909350992227252.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,4.83184e+13,0.029473,4968,2,347,5,1396,6,0,677,1005,0


Converting to forward existential form...Done !
original formula: AG(((AF(((p147==1)&&(p354==1))) + EX((EF(((p28==1)&&(p164==1))) * ((p137==0)||(p276==0))))) + (((p129==1)&&(p230==1))||((p131==1)&&(p360=...162
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * !((((p129==1)&&(p230==1))||((p131==1)&&(p360==1))))) * !(EX((E(TRUE U ((p28==1)&&(p164...226
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.099759,7380,1,0,9,16985,25,1,2970,2205,11
FORMULA DLCround-PT-11a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 298/298 transitions.
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 141 transition count 298
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 92 place count 120 transition count 256
Iterating global reduction 1 with 21 rules applied. Total rules applied 113 place count 120 transition count 256
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 116 place count 120 transition count 253
Applied a total of 116 rules in 3 ms. Remains 120 /212 variables (removed 92) and now considering 253/298 (removed 45) transitions.
[2026-05-24 17:31:04] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6647085097864239859.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14253681920879840682.kers'
[2026-05-24 17:31:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6647085097864239859.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14253681920879840682.kers]
Normalized transition count is 197 out of 198 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 197 rows 117 cols 409 entries
Finished phase 1 with 101 SingleSign rule and 0 generalized
[2026-05-24 17:31:04] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14253681920879840682.kers
Total runtime 0 ms.
[2026-05-24 17:31:04] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-24 17:31:04] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
[2026-05-24 17:31:04] [INFO ] Invariant cache hit.
[2026-05-24 17:31:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 17:31:04] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2026-05-24 17:31:04] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
[2026-05-24 17:31:04] [INFO ] Invariant cache hit.
[2026-05-24 17:31:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 3/120 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 197/317 variables, 120/139 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 1/318 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (OVERLAPS) 0/318 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 140 constraints, problems are : Problem set: 0 solved, 252 unsolved in 12558 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 120/120 constraints, ReadFeed: 1/1 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/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 3/120 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 197/317 variables, 120/139 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 252/391 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 1/318 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (OVERLAPS) 0/318 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 392 constraints, problems are : Problem set: 0 solved, 252 unsolved in 11083 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 120/120 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23656ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 23657ms
Starting structural reductions in LTL mode, iteration 1 : 120/212 places, 253/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23764 ms. Remains : 120/212 places, 253/298 transitions.
[2026-05-24 17:31:28] [INFO ] Flatten gal took : 12 ms
[2026-05-24 17:31:28] [INFO ] Flatten gal took : 6 ms
[2026-05-24 17:31:28] [INFO ] Input system was already deterministic with 253 transitions.
[2026-05-24 17:31:28] [INFO ] Flatten gal took : 6 ms
[2026-05-24 17:31:28] [INFO ] Flatten gal took : 5 ms
[2026-05-24 17:31:28] [INFO ] Time to serialize gal into /tmp/CTLFireability5495415150973221523.gal : 1 ms
[2026-05-24 17:31:28] [INFO ] Time to serialize properties into /tmp/CTLFireability8638884953856639104.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/CTLFireability5495415150973221523.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8638884953856639104.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,4.29497e+13,0.028517,4952,2,340,5,1370,6,0,670,991,0


Converting to forward existential form...Done !
original formula: EG((AG(EF(((p123==1)&&(p345==1)))) * E(((p7==1)&&(p181==1)) U EX(((p14==1)&&(p176==1))))))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(E(TRUE U ((p123==1)&&(p345==1)))))) * E(((p7==1)&&(p181==1)) U EX(((p14==1)&&(p176==1))...169
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 246/6/7
(forward)formula 0,1,0.262072,14516,1,0,142,46499,28,93,3132,60626,107
FORMULA DLCround-PT-11a-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 298/298 transitions.
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 143 transition count 298
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 88 place count 124 transition count 260
Iterating global reduction 1 with 19 rules applied. Total rules applied 107 place count 124 transition count 260
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 110 place count 124 transition count 257
Applied a total of 110 rules in 4 ms. Remains 124 /212 variables (removed 88) and now considering 257/298 (removed 41) transitions.
[2026-05-24 17:31:28] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1299725415126317828.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-73563163333513268.kers'
[2026-05-24 17:31:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1299725415126317828.kers, --Pflows, --basisKERS=/tmp/petrispot-output-73563163333513268.kers]
Normalized transition count is 199 out of 200 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 199 rows 119 cols 413 entries
Finished phase 1 with 103 SingleSign rule and 0 generalized
[2026-05-24 17:31:28] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-73563163333513268.kers
Total runtime 1 ms.
[2026-05-24 17:31:28] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-24 17:31:28] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
[2026-05-24 17:31:28] [INFO ] Invariant cache hit.
[2026-05-24 17:31:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 17:31:28] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2026-05-24 17:31:28] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
[2026-05-24 17:31:28] [INFO ] Invariant cache hit.
[2026-05-24 17:31:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 5/124 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 199/323 variables, 124/145 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 1/324 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 0/324 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 146 constraints, problems are : Problem set: 0 solved, 256 unsolved in 12828 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 124/124 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 5/124 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 199/323 variables, 124/145 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 256/401 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (OVERLAPS) 1/324 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 10 (OVERLAPS) 0/324 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 402 constraints, problems are : Problem set: 0 solved, 256 unsolved in 11635 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 124/124 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24482ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 24483ms
Starting structural reductions in LTL mode, iteration 1 : 124/212 places, 257/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24595 ms. Remains : 124/212 places, 257/298 transitions.
[2026-05-24 17:31:52] [INFO ] Flatten gal took : 11 ms
[2026-05-24 17:31:52] [INFO ] Flatten gal took : 6 ms
[2026-05-24 17:31:52] [INFO ] Input system was already deterministic with 257 transitions.
[2026-05-24 17:31:52] [INFO ] Flatten gal took : 6 ms
[2026-05-24 17:31:52] [INFO ] Flatten gal took : 5 ms
[2026-05-24 17:31:52] [INFO ] Time to serialize gal into /tmp/CTLFireability16487163773019913997.gal : 2 ms
[2026-05-24 17:31:52] [INFO ] Time to serialize properties into /tmp/CTLFireability13903223070938652769.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/CTLFireability16487163773019913997.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13903223070938652769.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.43582e+13,0.028944,5024,2,350,5,1412,6,0,682,1019,0


Converting to forward existential form...Done !
original formula: E(AF(AG(!(((p112==1)&&(p341==1))))) U AG(EX(((((p86==1)&&(p190==1))&&((p28==1)&&(p236==1)))&&(((p74==1)&&(p299==1))||((p7==1)&&(p182==1))...160
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!(!(E(TRUE U !(!(((p112==1)&&(p341==1)))))))))) * !(E(TRUE U !(EX(((((p86==1)&&(p190==1))&&((p2...236
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.096717,7636,1,0,8,20559,14,1,2867,4765,6
FORMULA DLCround-PT-11a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 298/298 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 148 transition count 298
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 82 place count 130 transition count 262
Iterating global reduction 1 with 18 rules applied. Total rules applied 100 place count 130 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 101 place count 130 transition count 261
Applied a total of 101 rules in 5 ms. Remains 130 /212 variables (removed 82) and now considering 261/298 (removed 37) transitions.
[2026-05-24 17:31:53] [INFO ] Flow matrix only has 203 transitions (discarded 58 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-641146022154690467.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12358936975658424082.kers'
[2026-05-24 17:31:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-641146022154690467.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12358936975658424082.kers]
Normalized transition count is 202 out of 203 initially.
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 202 rows 120 cols 419 entries
Finished phase 1 with 104 SingleSign rule and 0 generalized
[2026-05-24 17:31:53] [INFO ] Computed 26 invariants in 1 ms
Computed 26 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12358936975658424082.kers
Total runtime 2 ms.
[2026-05-24 17:31:53] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-24 17:31:53] [INFO ] Flow matrix only has 203 transitions (discarded 58 similar events)
[2026-05-24 17:31:53] [INFO ] Invariant cache hit.
[2026-05-24 17:31:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 17:31:53] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2026-05-24 17:31:53] [INFO ] Flow matrix only has 203 transitions (discarded 58 similar events)
[2026-05-24 17:31:53] [INFO ] Invariant cache hit.
[2026-05-24 17:31:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 10/130 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 202/332 variables, 130/156 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 1/333 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (OVERLAPS) 0/333 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 157 constraints, problems are : Problem set: 0 solved, 260 unsolved in 13335 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 130/130 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 10/130 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 202/332 variables, 130/156 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 260/416 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 1/333 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/333 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 333/333 variables, and 417 constraints, problems are : Problem set: 0 solved, 260 unsolved in 12494 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 130/130 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25844ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 25844ms
Starting structural reductions in LTL mode, iteration 1 : 130/212 places, 261/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25967 ms. Remains : 130/212 places, 261/298 transitions.
[2026-05-24 17:32:19] [INFO ] Flatten gal took : 12 ms
[2026-05-24 17:32:19] [INFO ] Flatten gal took : 7 ms
[2026-05-24 17:32:19] [INFO ] Input system was already deterministic with 261 transitions.
[2026-05-24 17:32:19] [INFO ] Flatten gal took : 5 ms
[2026-05-24 17:32:19] [INFO ] Flatten gal took : 5 ms
[2026-05-24 17:32:19] [INFO ] Time to serialize gal into /tmp/CTLFireability14821481901468954868.gal : 1 ms
[2026-05-24 17:32:19] [INFO ] Time to serialize properties into /tmp/CTLFireability7163161540373816972.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/CTLFireability14821481901468954868.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7163161540373816972.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,6.95785e+13,0.028943,5044,2,363,5,1457,6,0,694,1039,0


Converting to forward existential form...Done !
original formula: AG((A(!((!((((p7==1)&&(p222==1))||((p56==1)&&(p271==1)))) * !(A(((p16==1)&&(p177==1)) U (p107==1))))) U (((EF(((p86==1)&&(p309==1))) * !(...324
=> equivalent forward existential formula: ([FwdG((((FwdU((FwdU(Init,TRUE) * !(((E(TRUE U ((p101==0)||(p332==0))) * (p56==1)) * (p276==1)))),!((((E(TRUE U ...891
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.115787,8420,1,0,14,21441,40,7,3098,5410,18
FORMULA DLCround-PT-11a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 298/298 transitions.
Graph (trivial) has 283 edges and 212 vertex of which 124 / 212 are part of one of the 16 SCC in 0 ms
Free SCC test removed 108 places
Ensure Unique test removed 250 transitions
Reduce isomorphic transitions removed 250 transitions.
Graph (complete) has 137 edges and 104 vertex of which 31 are kept as prefixes of interest. Removing 73 places using SCC suffix rule.0 ms
Discarding 73 places :
Also discarding 0 output transitions
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 0 with 2 rules applied. Total rules applied 4 place count 31 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 29 transition count 46
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 20 place count 15 transition count 31
Iterating global reduction 2 with 14 rules applied. Total rules applied 34 place count 15 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 37 place count 15 transition count 28
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 15 transition count 28
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 14 transition count 27
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 14 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 14 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 14 transition count 25
Applied a total of 42 rules in 6 ms. Remains 14 /212 variables (removed 198) and now considering 25/298 (removed 273) transitions.
[2026-05-24 17:32:19] [INFO ] Flow matrix only has 16 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-690294835602330059.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13488526827427366791.kers'
[2026-05-24 17:32:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-690294835602330059.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13488526827427366791.kers]
Normalized transition count is 15 out of 16 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 15 rows 12 cols 31 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-24 17:32:19] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13488526827427366791.kers
Total runtime 0 ms.
[2026-05-24 17:32:19] [INFO ] Implicit Places using invariants in 15 ms returned []
[2026-05-24 17:32:19] [INFO ] Flow matrix only has 16 transitions (discarded 9 similar events)
[2026-05-24 17:32:19] [INFO ] Invariant cache hit.
[2026-05-24 17:32:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 17:32:19] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2026-05-24 17:32:19] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2026-05-24 17:32:19] [INFO ] Flow matrix only has 16 transitions (discarded 9 similar events)
[2026-05-24 17:32:19] [INFO ] Invariant cache hit.
[2026-05-24 17:32:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 1/14 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 15/29 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 1/30 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 19 constraints, problems are : Problem set: 0 solved, 24 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 1/14 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 15/29 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 1/30 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/30 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 43 constraints, problems are : Problem set: 0 solved, 24 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 548ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 548ms
Starting structural reductions in SI_CTL mode, iteration 1 : 14/212 places, 25/298 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 592 ms. Remains : 14/212 places, 25/298 transitions.
[2026-05-24 17:32:19] [INFO ] Flatten gal took : 1 ms
[2026-05-24 17:32:19] [INFO ] Flatten gal took : 1 ms
[2026-05-24 17:32:19] [INFO ] Input system was already deterministic with 25 transitions.
[2026-05-24 17:32:19] [INFO ] Flatten gal took : 1 ms
[2026-05-24 17:32:19] [INFO ] Flatten gal took : 1 ms
[2026-05-24 17:32:19] [INFO ] Time to serialize gal into /tmp/CTLFireability1578687218168609892.gal : 0 ms
[2026-05-24 17:32:19] [INFO ] Time to serialize properties into /tmp/CTLFireability65441889709065039.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/CTLFireability1578687218168609892.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability65441889709065039.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 -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,31,0.00271,3848,2,28,5,116,6,0,68,76,0


Converting to forward existential form...Done !
original formula: AG(((p53==0) + EF(((p77==1)&&(p186==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((p53==0))) * !(E(TRUE U ((p77==1)&&(p186==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.004348,4116,1,0,6,324,14,0,290,142,5
FORMULA DLCround-PT-11a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 298/298 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 142 transition count 298
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 90 place count 122 transition count 258
Iterating global reduction 1 with 20 rules applied. Total rules applied 110 place count 122 transition count 258
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 113 place count 122 transition count 255
Applied a total of 113 rules in 3 ms. Remains 122 /212 variables (removed 90) and now considering 255/298 (removed 43) transitions.
[2026-05-24 17:32:19] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2027124439039204479.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1533497322144576030.kers'
[2026-05-24 17:32:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2027124439039204479.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1533497322144576030.kers]
Normalized transition count is 198 out of 199 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 198 rows 118 cols 411 entries
Finished phase 1 with 102 SingleSign rule and 0 generalized
[2026-05-24 17:32:19] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1533497322144576030.kers
Total runtime 0 ms.
[2026-05-24 17:32:19] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-24 17:32:19] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
[2026-05-24 17:32:19] [INFO ] Invariant cache hit.
[2026-05-24 17:32:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 17:32:19] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 254 sub problems to find dead transitions.
[2026-05-24 17:32:19] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
[2026-05-24 17:32:19] [INFO ] Invariant cache hit.
[2026-05-24 17:32:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 4/122 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (OVERLAPS) 198/320 variables, 122/142 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 1/321 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 9 (OVERLAPS) 0/321 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 143 constraints, problems are : Problem set: 0 solved, 254 unsolved in 12968 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 122/122 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 4/122 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (OVERLAPS) 198/320 variables, 122/142 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 254/396 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (OVERLAPS) 1/321 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 10 (OVERLAPS) 0/321 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 397 constraints, problems are : Problem set: 0 solved, 254 unsolved in 11758 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 122/122 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24740ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 24741ms
Starting structural reductions in LTL mode, iteration 1 : 122/212 places, 255/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24838 ms. Remains : 122/212 places, 255/298 transitions.
[2026-05-24 17:32:44] [INFO ] Flatten gal took : 10 ms
[2026-05-24 17:32:44] [INFO ] Flatten gal took : 5 ms
[2026-05-24 17:32:44] [INFO ] Input system was already deterministic with 255 transitions.
[2026-05-24 17:32:44] [INFO ] Flatten gal took : 5 ms
[2026-05-24 17:32:44] [INFO ] Flatten gal took : 4 ms
[2026-05-24 17:32:44] [INFO ] Time to serialize gal into /tmp/CTLFireability4547934425966940185.gal : 1 ms
[2026-05-24 17:32:44] [INFO ] Time to serialize properties into /tmp/CTLFireability6170566933141201030.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/CTLFireability4547934425966940185.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6170566933141201030.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,5.15396e+13,0.029824,4964,2,345,5,1391,6,0,676,1001,0


Converting to forward existential form...Done !
original formula: EF(((EX((!(E(((p25==1)&&(p211==1)) U ((p21==1)&&(p177==1)))) + AF(((p138==0)||(p361==0))))) * (p133==1)) * (p236==1)))
=> equivalent forward existential formula: ([(EY(((FwdU(Init,TRUE) * (p236==1)) * (p133==1))) * !(E(((p25==1)&&(p211==1)) U ((p21==1)&&(p177==1)))))] != FA...257
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 251/4/4
(forward)formula 0,1,0.10465,7608,1,0,13,18887,19,4,2962,3752,9
FORMULA DLCround-PT-11a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 298/298 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 151 transition count 298
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 78 place count 134 transition count 264
Iterating global reduction 1 with 17 rules applied. Total rules applied 95 place count 134 transition count 264
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 98 place count 134 transition count 261
Applied a total of 98 rules in 2 ms. Remains 134 /212 variables (removed 78) and now considering 261/298 (removed 37) transitions.
[2026-05-24 17:32:44] [INFO ] Flow matrix only has 202 transitions (discarded 59 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2935394913130249165.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15021897087865483963.kers'
[2026-05-24 17:32:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2935394913130249165.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15021897087865483963.kers]
Normalized transition count is 201 out of 202 initially.
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 201 rows 121 cols 417 entries
Finished phase 1 with 105 SingleSign rule and 0 generalized
[2026-05-24 17:32:44] [INFO ] Computed 29 invariants in 0 ms
Computed 29 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15021897087865483963.kers
Total runtime 1 ms.
[2026-05-24 17:32:44] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-24 17:32:44] [INFO ] Flow matrix only has 202 transitions (discarded 59 similar events)
[2026-05-24 17:32:44] [INFO ] Invariant cache hit.
[2026-05-24 17:32:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 17:32:44] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2026-05-24 17:32:44] [INFO ] Flow matrix only has 202 transitions (discarded 59 similar events)
[2026-05-24 17:32:44] [INFO ] Invariant cache hit.
[2026-05-24 17:32:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 13/134 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 201/335 variables, 134/163 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 1/336 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (OVERLAPS) 0/336 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 164 constraints, problems are : Problem set: 0 solved, 260 unsolved in 13898 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, State Equation: 134/134 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 13/134 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 201/335 variables, 134/163 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 260/423 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 1/336 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/336 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 424 constraints, problems are : Problem set: 0 solved, 260 unsolved in 12338 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, State Equation: 134/134 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26257ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 26257ms
Starting structural reductions in LTL mode, iteration 1 : 134/212 places, 261/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26364 ms. Remains : 134/212 places, 261/298 transitions.
[2026-05-24 17:33:11] [INFO ] Flatten gal took : 10 ms
[2026-05-24 17:33:11] [INFO ] Flatten gal took : 6 ms
[2026-05-24 17:33:11] [INFO ] Input system was already deterministic with 261 transitions.
[2026-05-24 17:33:11] [INFO ] Flatten gal took : 4 ms
[2026-05-24 17:33:11] [INFO ] Flatten gal took : 3 ms
[2026-05-24 17:33:11] [INFO ] Time to serialize gal into /tmp/CTLFireability15258415962633106730.gal : 1 ms
[2026-05-24 17:33:11] [INFO ] Time to serialize properties into /tmp/CTLFireability962206376697210726.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/CTLFireability15258415962633106730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability962206376697210726.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.33835e+13,0.030654,5052,2,372,5,1488,6,0,700,1055,0


Converting to forward existential form...Done !
original formula: AX((((E(((p76==1)&&(p298==1)) U AG(EF(((p77==1)&&(p348==1))))) + EG((A(((p119==1)&&(p349==1)) U ((p11==1)&&(p151==1))) * EG(((p7==1)&&(p1...401
=> equivalent forward existential formula: (((([(FwdU((FwdU((((EY(Init) * !((((p66==1)&&(p279==1))||(((p141==1)&&(p238==1))&&((p107==0)||(p210==0)))))) * !...2266
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 257/4/4
Hit Full ! (commute/partial/dont) 257/0/4
Using saturation style SCC detection
(forward)formula 0,1,0.186627,9892,1,0,25,27736,62,9,3707,9917,28
FORMULA DLCround-PT-11a-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 298/298 transitions.
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 145 transition count 298
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 86 place count 126 transition count 260
Iterating global reduction 1 with 19 rules applied. Total rules applied 105 place count 126 transition count 260
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 108 place count 126 transition count 257
Applied a total of 108 rules in 3 ms. Remains 126 /212 variables (removed 86) and now considering 257/298 (removed 41) transitions.
[2026-05-24 17:33:11] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1270529934055701534.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1329496468844719557.kers'
[2026-05-24 17:33:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1270529934055701534.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1329496468844719557.kers]
Normalized transition count is 199 out of 200 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 199 rows 119 cols 413 entries
Finished phase 1 with 103 SingleSign rule and 0 generalized
[2026-05-24 17:33:11] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1329496468844719557.kers
Total runtime 1 ms.
[2026-05-24 17:33:11] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-24 17:33:11] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
[2026-05-24 17:33:11] [INFO ] Invariant cache hit.
[2026-05-24 17:33:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 17:33:11] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2026-05-24 17:33:11] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
[2026-05-24 17:33:11] [INFO ] Invariant cache hit.
[2026-05-24 17:33:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 7/126 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 199/325 variables, 126/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 1/326 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 0/326 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 150 constraints, problems are : Problem set: 0 solved, 256 unsolved in 12911 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 126/126 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 7/126 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 199/325 variables, 126/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 256/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (OVERLAPS) 1/326 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 10 (OVERLAPS) 0/326 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 406 constraints, problems are : Problem set: 0 solved, 256 unsolved in 11734 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 126/126 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24657ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 24657ms
Starting structural reductions in LTL mode, iteration 1 : 126/212 places, 257/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24754 ms. Remains : 126/212 places, 257/298 transitions.
[2026-05-24 17:33:36] [INFO ] Flatten gal took : 8 ms
[2026-05-24 17:33:36] [INFO ] Flatten gal took : 5 ms
[2026-05-24 17:33:36] [INFO ] Input system was already deterministic with 257 transitions.
[2026-05-24 17:33:36] [INFO ] Flatten gal took : 3 ms
[2026-05-24 17:33:36] [INFO ] Flatten gal took : 10 ms
[2026-05-24 17:33:36] [INFO ] Time to serialize gal into /tmp/CTLFireability4724833507683965117.gal : 1 ms
[2026-05-24 17:33:36] [INFO ] Time to serialize properties into /tmp/CTLFireability18187894758746905206.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/CTLFireability4724833507683965117.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18187894758746905206.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.43582e+13,0.028073,5028,2,354,5,1424,6,0,684,1025,0


Converting to forward existential form...Done !
original formula: EF(((EX(!(E((((p116==1)&&(p337==1))||((p67==1)&&(p336==1))) U (((p58==1)&&(p273==1))&&((p92==1)&&(p311==1)))))) * AF(AX(((p68==0)||(p282=...224
=> equivalent forward existential formula: [FwdG(FwdU(((FwdU(Init,TRUE) * (EX(!(E((((p116==1)&&(p337==1))||((p67==1)&&(p336==1))) U (((p58==1)&&(p273==1))&...293
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 244/0/13
Hit Full ! (commute/partial/dont) 247/0/10
(forward)formula 0,1,0.132422,8772,1,0,20,24967,36,6,3503,8033,20
FORMULA DLCround-PT-11a-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 298/298 transitions.
Graph (trivial) has 284 edges and 212 vertex of which 129 / 212 are part of one of the 16 SCC in 2 ms
Free SCC test removed 113 places
Ensure Unique test removed 261 transitions
Reduce isomorphic transitions removed 261 transitions.
Graph (complete) has 126 edges and 99 vertex of which 27 are kept as prefixes of interest. Removing 72 places using SCC suffix rule.1 ms
Discarding 72 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 27 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 26 transition count 36
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 18 place count 12 transition count 21
Iterating global reduction 2 with 14 rules applied. Total rules applied 32 place count 12 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 12 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 12 transition count 19
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 11 transition count 18
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 11 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 11 transition count 17
Applied a total of 38 rules in 14 ms. Remains 11 /212 variables (removed 201) and now considering 17/298 (removed 281) transitions.
[2026-05-24 17:33:36] [INFO ] Flow matrix only has 11 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9648007344524422682.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1471340740493921408.kers'
[2026-05-24 17:33:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9648007344524422682.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1471340740493921408.kers]
Normalized transition count is 10 out of 11 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 10 rows 8 cols 21 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-24 17:33:36] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1471340740493921408.kers
Total runtime 1 ms.
[2026-05-24 17:33:36] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-24 17:33:36] [INFO ] Flow matrix only has 11 transitions (discarded 6 similar events)
[2026-05-24 17:33:36] [INFO ] Invariant cache hit.
[2026-05-24 17:33:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 17:33:36] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2026-05-24 17:33:36] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2026-05-24 17:33:36] [INFO ] Flow matrix only has 11 transitions (discarded 6 similar events)
[2026-05-24 17:33:36] [INFO ] Invariant cache hit.
[2026-05-24 17:33:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 2/11 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 1/22 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/22 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/22 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 17 constraints, problems are : Problem set: 0 solved, 16 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 2/11 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 1/22 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/22 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/22 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 33 constraints, problems are : Problem set: 0 solved, 16 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 346ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 346ms
Starting structural reductions in SI_CTL mode, iteration 1 : 11/212 places, 17/298 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 416 ms. Remains : 11/212 places, 17/298 transitions.
[2026-05-24 17:33:36] [INFO ] Flatten gal took : 1 ms
[2026-05-24 17:33:36] [INFO ] Flatten gal took : 0 ms
[2026-05-24 17:33:36] [INFO ] Input system was already deterministic with 17 transitions.
[2026-05-24 17:33:36] [INFO ] Flatten gal took : 0 ms
[2026-05-24 17:33:36] [INFO ] Flatten gal took : 1 ms
[2026-05-24 17:33:36] [INFO ] Time to serialize gal into /tmp/CTLFireability1372836220218222536.gal : 0 ms
[2026-05-24 17:33:36] [INFO ] Time to serialize properties into /tmp/CTLFireability18020479978184921669.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/CTLFireability1372836220218222536.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18020479978184921669.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,11,0.007297,3816,2,22,5,83,6,0,48,53,0


Converting to forward existential form...Done !
original formula: AG(AF(!(A(((p15==1)&&(p185==1)) U ((p37==1)&&(p155==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(!(!((E(!(((p37==1)&&(p155==1))) U (!(((p15==1)&&(p185==1))) * !(((p37==1)&&(p155==1)))))...200
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 10/0/7
(forward)formula 0,0,0.014091,4360,1,0,10,242,28,3,247,178,14
FORMULA DLCround-PT-11a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 298/298 transitions.
Graph (trivial) has 294 edges and 212 vertex of which 135 / 212 are part of one of the 16 SCC in 1 ms
Free SCC test removed 119 places
Ensure Unique test removed 277 transitions
Reduce isomorphic transitions removed 277 transitions.
Graph (complete) has 110 edges and 93 vertex of which 20 are kept as prefixes of interest. Removing 73 places using SCC suffix rule.0 ms
Discarding 73 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 20 transition count 20
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 19 transition count 19
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 19 place count 5 transition count 5
Iterating global reduction 2 with 14 rules applied. Total rules applied 33 place count 5 transition count 5
Applied a total of 33 rules in 4 ms. Remains 5 /212 variables (removed 207) and now considering 5/298 (removed 293) transitions.
[2026-05-24 17:33:36] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5468907432258373881.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15756206521830112557.kers'
[2026-05-24 17:33:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5468907432258373881.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15756206521830112557.kers]
Normalized transition count is 3 out of 4 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 3 rows 3 cols 6 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-24 17:33:36] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15756206521830112557.kers
Total runtime 1 ms.
[2026-05-24 17:33:36] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-24 17:33:36] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
[2026-05-24 17:33:36] [INFO ] Invariant cache hit.
[2026-05-24 17:33:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 17:33:36] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2026-05-24 17:33:36] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-24 17:33:36] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
[2026-05-24 17:33:36] [INFO ] Invariant cache hit.
[2026-05-24 17:33:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/8 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/9 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/8 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/9 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 13 constraints, problems are : Problem set: 0 solved, 4 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 106ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 106ms
Starting structural reductions in SI_CTL mode, iteration 1 : 5/212 places, 5/298 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 153 ms. Remains : 5/212 places, 5/298 transitions.
[2026-05-24 17:33:36] [INFO ] Flatten gal took : 0 ms
[2026-05-24 17:33:36] [INFO ] Flatten gal took : 1 ms
[2026-05-24 17:33:36] [INFO ] Input system was already deterministic with 5 transitions.
[2026-05-24 17:33:36] [INFO ] Flatten gal took : 0 ms
[2026-05-24 17:33:36] [INFO ] Flatten gal took : 1 ms
[2026-05-24 17:33:36] [INFO ] Time to serialize gal into /tmp/CTLFireability16141380704908420768.gal : 0 ms
[2026-05-24 17:33:36] [INFO ] Time to serialize properties into /tmp/CTLFireability2596782627517652473.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/CTLFireability16141380704908420768.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2596782627517652473.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,3,0.004474,3740,2,10,5,30,6,0,20,16,0


Converting to forward existential form...Done !
original formula: EF(EG(((p36==1)&&(p254==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p36==1)&&(p254==1)))] != FALSE
Hit Full ! (commute/partial/dont) 2/3/3
(forward)formula 0,1,0.006904,4024,1,0,7,52,19,0,104,35,9
FORMULA DLCround-PT-11a-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 298/298 transitions.
Graph (trivial) has 262 edges and 212 vertex of which 110 / 212 are part of one of the 16 SCC in 1 ms
Free SCC test removed 94 places
Ensure Unique test removed 219 transitions
Reduce isomorphic transitions removed 219 transitions.
Graph (complete) has 168 edges and 118 vertex of which 51 are kept as prefixes of interest. Removing 67 places using SCC suffix rule.0 ms
Discarding 67 places :
Also discarding 0 output transitions
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 0 with 2 rules applied. Total rules applied 4 place count 51 transition count 77
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 49 transition count 75
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 11 place count 47 transition count 74
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 19 place count 39 transition count 65
Iterating global reduction 3 with 8 rules applied. Total rules applied 27 place count 39 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 31 place count 39 transition count 61
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 39 transition count 61
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 38 transition count 60
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 38 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 35 place count 38 transition count 59
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 36 place count 38 transition count 58
Applied a total of 36 rules in 10 ms. Remains 38 /212 variables (removed 174) and now considering 58/298 (removed 240) transitions.
[2026-05-24 17:33:36] [INFO ] Flow matrix only has 37 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14284601400135172095.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12657762761949273568.kers'
[2026-05-24 17:33:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14284601400135172095.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12657762761949273568.kers]
Normalized transition count is 36 out of 37 initially.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 36 rows 30 cols 79 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-05-24 17:33:36] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12657762761949273568.kers
Total runtime 0 ms.
[2026-05-24 17:33:37] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-24 17:33:37] [INFO ] Flow matrix only has 37 transitions (discarded 21 similar events)
[2026-05-24 17:33:37] [INFO ] Invariant cache hit.
[2026-05-24 17:33:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 17:33:37] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2026-05-24 17:33:37] [INFO ] Redundant transitions in 0 ms returned []
Running 57 sub problems to find dead transitions.
[2026-05-24 17:33:37] [INFO ] Flow matrix only has 37 transitions (discarded 21 similar events)
[2026-05-24 17:33:37] [INFO ] Invariant cache hit.
[2026-05-24 17:33:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 7/38 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 36/74 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 1/75 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (OVERLAPS) 0/75 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 55 constraints, problems are : Problem set: 0 solved, 57 unsolved in 994 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 38/38 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 7/38 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 36/74 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 57/111 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 1/75 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/75 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 112 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1032 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 38/38 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2030ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 2030ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/212 places, 58/298 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2105 ms. Remains : 38/212 places, 58/298 transitions.
[2026-05-24 17:33:39] [INFO ] Flatten gal took : 2 ms
[2026-05-24 17:33:39] [INFO ] Flatten gal took : 2 ms
[2026-05-24 17:33:39] [INFO ] Input system was already deterministic with 58 transitions.
[2026-05-24 17:33:39] [INFO ] Flatten gal took : 1 ms
[2026-05-24 17:33:39] [INFO ] Flatten gal took : 1 ms
[2026-05-24 17:33:39] [INFO ] Time to serialize gal into /tmp/CTLFireability13176759572683168496.gal : 0 ms
[2026-05-24 17:33:39] [INFO ] Time to serialize properties into /tmp/CTLFireability4978889590844256298.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/CTLFireability13176759572683168496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4978889590844256298.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,12961,0.009515,4052,2,97,5,328,6,0,167,219,0


Converting to forward existential form...Done !
original formula: E((A(AF(((p94==1)&&(p314==1))) U (!(((p56==1)&&(p269==1))) * AF(((p36==1)&&(p150==1))))) + ((p71==1)&&(p293==1))) U AG(!((((A(((p117==1)&...244
=> equivalent forward existential formula: [(FwdU(Init,(!((E(!((!(((p56==1)&&(p269==1))) * !(EG(!(((p36==1)&&(p150==1))))))) U (!(!(EG(!(((p94==1)&&(p314==...508
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 56/0/2
(forward)formula 0,0,0.02199,4612,1,0,15,2092,31,4,882,969,15
FORMULA DLCround-PT-11a-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 298/298 transitions.
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 145 transition count 298
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 85 place count 127 transition count 262
Iterating global reduction 1 with 18 rules applied. Total rules applied 103 place count 127 transition count 262
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 106 place count 127 transition count 259
Applied a total of 106 rules in 3 ms. Remains 127 /212 variables (removed 85) and now considering 259/298 (removed 39) transitions.
[2026-05-24 17:33:39] [INFO ] Flow matrix only has 201 transitions (discarded 58 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16227995098314818257.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15257312976974950782.kers'
[2026-05-24 17:33:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16227995098314818257.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15257312976974950782.kers]
Normalized transition count is 200 out of 201 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 200 rows 120 cols 415 entries
Finished phase 1 with 104 SingleSign rule and 0 generalized
[2026-05-24 17:33:39] [INFO ] Computed 23 invariants in 1 ms
Computed 23 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15257312976974950782.kers
Total runtime 1 ms.
[2026-05-24 17:33:39] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-24 17:33:39] [INFO ] Flow matrix only has 201 transitions (discarded 58 similar events)
[2026-05-24 17:33:39] [INFO ] Invariant cache hit.
[2026-05-24 17:33:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 17:33:39] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2026-05-24 17:33:39] [INFO ] Flow matrix only has 201 transitions (discarded 58 similar events)
[2026-05-24 17:33:39] [INFO ] Invariant cache hit.
[2026-05-24 17:33:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 7/127 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (OVERLAPS) 200/327 variables, 127/150 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 1/328 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 9 (OVERLAPS) 0/328 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 151 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13276 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 127/127 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 7/127 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (OVERLAPS) 200/327 variables, 127/150 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 258/408 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (OVERLAPS) 1/328 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 10 (OVERLAPS) 0/328 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 409 constraints, problems are : Problem set: 0 solved, 258 unsolved in 12579 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 127/127 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25867ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 25868ms
Starting structural reductions in LTL mode, iteration 1 : 127/212 places, 259/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25978 ms. Remains : 127/212 places, 259/298 transitions.
[2026-05-24 17:34:05] [INFO ] Flatten gal took : 6 ms
[2026-05-24 17:34:05] [INFO ] Flatten gal took : 5 ms
[2026-05-24 17:34:05] [INFO ] Input system was already deterministic with 259 transitions.
[2026-05-24 17:34:05] [INFO ] Flatten gal took : 3 ms
[2026-05-24 17:34:05] [INFO ] Flatten gal took : 3 ms
[2026-05-24 17:34:05] [INFO ] Time to serialize gal into /tmp/CTLFireability17784623803520548732.gal : 1 ms
[2026-05-24 17:34:05] [INFO ] Time to serialize properties into /tmp/CTLFireability3207572123847881437.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/CTLFireability17784623803520548732.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3207572123847881437.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,6.1153e+13,0.03417,5028,2,357,5,1437,6,0,689,1030,0


Converting to forward existential form...Done !
original formula: EF(AX((A(((p7==1)&&(p197==1)) U ((p64==1)&&(p278==1))) * ((AX(((p29==1)&&(p250==1))) + (((p67==0)||(p314==0))&&((p69==0)||(p297==0)))) + ...206
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((!((E(!(((p64==1)&&(p278==1))) U (!(((p7==1)&&(p197==1))) * !(((p64==1)&&(p278==1))))...341
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 255/0/4
(forward)formula 0,0,0.12091,8464,1,0,15,24986,28,4,3065,7805,15
FORMULA DLCround-PT-11a-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 298/298 transitions.
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 144 transition count 298
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 89 place count 123 transition count 256
Iterating global reduction 1 with 21 rules applied. Total rules applied 110 place count 123 transition count 256
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 113 place count 123 transition count 253
Applied a total of 113 rules in 8 ms. Remains 123 /212 variables (removed 89) and now considering 253/298 (removed 45) transitions.
[2026-05-24 17:34:05] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18339059148744257747.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-824551635741912894.kers'
[2026-05-24 17:34:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18339059148744257747.kers, --Pflows, --basisKERS=/tmp/petrispot-output-824551635741912894.kers]
Normalized transition count is 197 out of 198 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 197 rows 117 cols 409 entries
Finished phase 1 with 101 SingleSign rule and 0 generalized
[2026-05-24 17:34:05] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-824551635741912894.kers
Total runtime 1 ms.
[2026-05-24 17:34:05] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-24 17:34:05] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
[2026-05-24 17:34:05] [INFO ] Invariant cache hit.
[2026-05-24 17:34:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 17:34:05] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2026-05-24 17:34:05] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
[2026-05-24 17:34:05] [INFO ] Invariant cache hit.
[2026-05-24 17:34:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 6/123 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 197/320 variables, 123/145 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 1/321 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (OVERLAPS) 0/321 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 146 constraints, problems are : Problem set: 0 solved, 252 unsolved in 12639 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 123/123 constraints, ReadFeed: 1/1 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/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 6/123 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 197/320 variables, 123/145 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 252/397 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 1/321 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (OVERLAPS) 0/321 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 398 constraints, problems are : Problem set: 0 solved, 252 unsolved in 11154 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 123/123 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23803ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 23803ms
Starting structural reductions in LTL mode, iteration 1 : 123/212 places, 253/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23929 ms. Remains : 123/212 places, 253/298 transitions.
[2026-05-24 17:34:29] [INFO ] Flatten gal took : 6 ms
[2026-05-24 17:34:29] [INFO ] Flatten gal took : 3 ms
[2026-05-24 17:34:29] [INFO ] Input system was already deterministic with 253 transitions.
[2026-05-24 17:34:29] [INFO ] Flatten gal took : 3 ms
[2026-05-24 17:34:29] [INFO ] Flatten gal took : 3 ms
[2026-05-24 17:34:29] [INFO ] Time to serialize gal into /tmp/CTLFireability6974141519351493580.gal : 0 ms
[2026-05-24 17:34:29] [INFO ] Time to serialize properties into /tmp/CTLFireability594035828379089464.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/CTLFireability6974141519351493580.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability594035828379089464.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.29497e+13,0.027241,4960,2,346,5,1388,6,0,673,1000,0


Converting to forward existential form...Done !
original formula: (EX((AG(EF(((p56==1)&&(p267==1)))) + EG(((p28==0)||(p219==0))))) + AG((AF(((p97==1)&&(p339==1))) + (((p14==0)||(p184==0)) * !(A(AF(((p93=...201
=> equivalent forward existential formula: [FwdG((FwdU((Init * !(EX((!(E(TRUE U !(E(TRUE U ((p56==1)&&(p267==1)))))) + EG(((p28==0)||(p219==0))))))),TRUE) ...354
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 243/0/10
(forward)formula 0,1,0.118726,8308,1,0,17,21388,49,5,3108,6214,19
FORMULA DLCround-PT-11a-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 298/298 transitions.
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 146 transition count 298
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 86 place count 126 transition count 258
Iterating global reduction 1 with 20 rules applied. Total rules applied 106 place count 126 transition count 258
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 109 place count 126 transition count 255
Applied a total of 109 rules in 3 ms. Remains 126 /212 variables (removed 86) and now considering 255/298 (removed 43) transitions.
[2026-05-24 17:34:29] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14901852682678009537.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16241925137844626769.kers'
[2026-05-24 17:34:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14901852682678009537.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16241925137844626769.kers]
Normalized transition count is 198 out of 199 initially.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 198 rows 118 cols 411 entries
Finished phase 1 with 102 SingleSign rule and 0 generalized
[2026-05-24 17:34:29] [INFO ] Computed 24 invariants in 0 ms
Computed 24 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16241925137844626769.kers
Total runtime 2 ms.
[2026-05-24 17:34:29] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-24 17:34:29] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
[2026-05-24 17:34:29] [INFO ] Invariant cache hit.
[2026-05-24 17:34:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 17:34:29] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 254 sub problems to find dead transitions.
[2026-05-24 17:34:29] [INFO ] Flow matrix only has 199 transitions (discarded 56 similar events)
[2026-05-24 17:34:29] [INFO ] Invariant cache hit.
[2026-05-24 17:34:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 8/126 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (OVERLAPS) 198/324 variables, 126/150 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 1/325 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 9 (OVERLAPS) 0/325 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 151 constraints, problems are : Problem set: 0 solved, 254 unsolved in 12852 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 126/126 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 8/126 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (OVERLAPS) 198/324 variables, 126/150 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 254/404 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (OVERLAPS) 1/325 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 10 (OVERLAPS) 0/325 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 405 constraints, problems are : Problem set: 0 solved, 254 unsolved in 10976 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 126/126 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23838ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 23839ms
Starting structural reductions in LTL mode, iteration 1 : 126/212 places, 255/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23961 ms. Remains : 126/212 places, 255/298 transitions.
[2026-05-24 17:34:53] [INFO ] Flatten gal took : 8 ms
[2026-05-24 17:34:53] [INFO ] Flatten gal took : 4 ms
[2026-05-24 17:34:53] [INFO ] Input system was already deterministic with 255 transitions.
[2026-05-24 17:34:53] [INFO ] Flatten gal took : 2 ms
[2026-05-24 17:34:53] [INFO ] Flatten gal took : 2 ms
[2026-05-24 17:34:53] [INFO ] Time to serialize gal into /tmp/CTLFireability8473013381514966659.gal : 1 ms
[2026-05-24 17:34:53] [INFO ] Time to serialize properties into /tmp/CTLFireability434895013525280815.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/CTLFireability8473013381514966659.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability434895013525280815.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.83184e+13,0.028085,4976,2,353,5,1415,6,0,680,1017,0


Converting to forward existential form...Done !
original formula: (AG(!(A(AF(((p67==1)&&(p258==1))) U AX(AX(((p33==1)&&(p251==1))))))) * E((EF((EF(((p37==1)&&(p311==1))) * ((((p135==1)&&(p363==1))&&((p21...341
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!(!(EX(!(!(EX(!(((p33==1)&&(p251==1)))))))))))) * !(E(!(!(EX(!(!(EX(!(((p33==1)&&(p25...573
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,0.118969,8432,1,0,20,23014,51,7,3245,6650,28
FORMULA DLCround-PT-11a-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-24 17:34:53] [INFO ] Flatten gal took : 8 ms
[2026-05-24 17:34:53] [INFO ] Flatten gal took : 8 ms
Total runtime 324466 ms.

BK_STOP 1779644094819

--------------------
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="DLCround-PT-11a"
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 DLCround-PT-11a, 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 r098-tall-177955695700634"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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