About the Execution of ITS-Tools for NoC3x3-PT-4A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8946.155 | 3600000.00 | 3768856.00 | 26011.30 | T?F?F??????F???? | normal |
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.r194-tall-177969914000306.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 NoC3x3-PT-4A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914000306
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.5K Mar 8 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 8 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 8 06:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 8 06:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 16 08:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 16 08:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 16 08:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 16 08:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 8 06:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Mar 8 06:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 8 06:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 8 06:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 16 08:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 144K 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 NoC3x3-PT-4A-CTLFireability-2024-00
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2024-01
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2024-02
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2024-03
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2024-04
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2024-05
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2024-06
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2024-07
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2024-08
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2024-09
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2024-10
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2024-11
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2024-12
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2024-13
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2024-14
FORMULA_NAME NoC3x3-PT-4A-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1779749394727
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-4A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 22:49:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 22:49:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 22:49:56] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2026-05-25 22:49:56] [INFO ] Transformed 293 places.
[2026-05-25 22:49:56] [INFO ] Transformed 608 transitions.
[2026-05-25 22:49:56] [INFO ] Found NUPN structural information;
[2026-05-25 22:49:56] [INFO ] Parsed PT model containing 293 places and 608 transitions and 1905 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Ensure Unique test removed 155 transitions
Reduce redundant transitions removed 155 transitions.
Support contains 123 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 453/453 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 260 transition count 407
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 260 transition count 407
Drop transitions (Redundant composition of simpler transitions.) removed 59 transitions
Redundant transition composition rules discarded 59 transitions
Iterating global reduction 0 with 59 rules applied. Total rules applied 125 place count 260 transition count 348
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 128 place count 257 transition count 348
Applied a total of 128 rules in 55 ms. Remains 257 /293 variables (removed 36) and now considering 348/453 (removed 105) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12444035321803090783.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-914815816263162279.kers'
[2026-05-25 22:49:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12444035321803090783.kers, --Pflows, --basisKERS=/tmp/petrispot-output-914815816263162279.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 348 rows 251 cols 1166 entries
Finished phase 1 with 194 SingleSign rule and 0 generalized
[2026-05-25 22:49:56] [INFO ] Computed 63 invariants in 1 ms
Computed 63 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-914815816263162279.kers
Total runtime 3 ms.
[2026-05-25 22:49:56] [INFO ] Implicit Places using invariants in 311 ms returned []
[2026-05-25 22:49:56] [INFO ] Invariant cache hit.
[2026-05-25 22:49:56] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Running 347 sub problems to find dead transitions.
[2026-05-25 22:49:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (OVERLAPS) 1/251 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (OVERLAPS) 6/257 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 5 (OVERLAPS) 348/605 variables, 257/320 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/605 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 7 (OVERLAPS) 0/605 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 347 unsolved
No progress, stopping.
After SMT solving in domain Real declared 605/605 variables, and 320 constraints, problems are : Problem set: 0 solved, 347 unsolved in 25504 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 347/347 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 347 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (OVERLAPS) 1/251 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (OVERLAPS) 6/257 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 5 (OVERLAPS) 348/605 variables, 257/320 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/605 variables, 347/667 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/605 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 8 (OVERLAPS) 0/605 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 347 unsolved
No progress, stopping.
After SMT solving in domain Int declared 605/605 variables, and 667 constraints, problems are : Problem set: 0 solved, 347 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 347/347 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55629ms problems are : Problem set: 0 solved, 347 unsolved
Search for dead transitions found 0 dead transitions in 55647ms
Starting structural reductions in LTL mode, iteration 1 : 257/293 places, 348/453 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56296 ms. Remains : 257/293 places, 348/453 transitions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 348/348 transitions.
Applied a total of 0 rules in 6 ms. Remains 257 /257 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2026-05-25 22:50:52] [INFO ] Invariant cache hit.
[2026-05-25 22:50:52] [INFO ] Implicit Places using invariants in 201 ms returned []
[2026-05-25 22:50:52] [INFO ] Invariant cache hit.
[2026-05-25 22:50:52] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 402 ms. Remains : 257/257 places, 348/348 transitions.
Support contains 123 out of 257 places after structural reductions.
[2026-05-25 22:50:53] [INFO ] Flatten gal took : 103 ms
[2026-05-25 22:50:53] [INFO ] Flatten gal took : 27 ms
[2026-05-25 22:50:53] [INFO ] Input system was already deterministic with 348 transitions.
RANDOM walk for 40000 steps (8 resets) in 1923 ms. (20 steps per ms) remains 4/82 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
[2026-05-25 22:50:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 29/38 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 219/257 variables, 55/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 348/605 variables, 257/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/605 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/605 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 605/605 variables, and 320 constraints, problems are : Problem set: 0 solved, 3 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 29/38 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 219/257 variables, 55/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 348/605 variables, 257/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/605 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/605 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/605 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 605/605 variables, and 323 constraints, problems are : Problem set: 0 solved, 3 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 530ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 14410 steps, including 129 resets, run visited all 2 properties in 47 ms. (steps per millisecond=306 )
Parikh walk visited 3 properties in 681 ms.
[2026-05-25 22:50:55] [INFO ] Flatten gal took : 18 ms
[2026-05-25 22:50:55] [INFO ] Flatten gal took : 18 ms
[2026-05-25 22:50:55] [INFO ] Input system was already deterministic with 348 transitions.
Computed a total of 7 stabilizing places and 1 stable transitions
Graph (complete) has 825 edges and 257 vertex of which 251 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 348/348 transitions.
Graph (trivial) has 137 edges and 257 vertex of which 73 / 257 are part of one of the 32 SCC in 2 ms
Free SCC test removed 41 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Graph (complete) has 744 edges and 216 vertex of which 210 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 200 transition count 234
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 67 place count 176 transition count 234
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 90 place count 153 transition count 211
Iterating global reduction 2 with 23 rules applied. Total rules applied 113 place count 153 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 137 place count 153 transition count 187
Applied a total of 137 rules in 40 ms. Remains 153 /257 variables (removed 104) and now considering 187/348 (removed 161) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5507633204017529566.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8328284350095550606.kers'
[2026-05-25 22:50:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5507633204017529566.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8328284350095550606.kers]
Normalized transition count is 186 out of 187 initially.
Culling duplicate invariants (modulo rational): removing 23 columns.
Culled 23 columns in 0 ms.
// Phase 1: matrix 186 rows 130 cols 439 entries
Finished phase 1 with 105 SingleSign rule and 0 generalized
[2026-05-25 22:50:55] [INFO ] Computed 48 invariants in 0 ms
Computed 48 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8328284350095550606.kers
Total runtime 1 ms.
[2026-05-25 22:50:55] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-25 22:50:55] [INFO ] Invariant cache hit.
[2026-05-25 22:50:55] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-25 22:50:55] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2026-05-25 22:50:55] [INFO ] Redundant transitions in 65 ms returned []
Running 162 sub problems to find dead transitions.
[2026-05-25 22:50:55] [INFO ] Invariant cache hit.
[2026-05-25 22:50:55] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 186/339 variables, 153/201 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 53/254 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 0/339 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/340 variables, and 254 constraints, problems are : Problem set: 0 solved, 162 unsolved in 5640 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 153/153 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 186/339 variables, 153/201 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 53/254 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 162/416 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/339 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/340 variables, and 416 constraints, problems are : Problem set: 0 solved, 162 unsolved in 5420 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 153/153 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11079ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 11079ms
Starting structural reductions in SI_CTL mode, iteration 1 : 153/257 places, 187/348 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11447 ms. Remains : 153/257 places, 187/348 transitions.
[2026-05-25 22:51:06] [INFO ] Flatten gal took : 12 ms
[2026-05-25 22:51:06] [INFO ] Flatten gal took : 8 ms
[2026-05-25 22:51:06] [INFO ] Input system was already deterministic with 187 transitions.
RANDOM walk for 369 steps (0 resets) in 5 ms. (61 steps per ms) remains 0/1 properties
FORMULA NoC3x3-PT-4A-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 22:51:06] [INFO ] Flatten gal took : 7 ms
[2026-05-25 22:51:06] [INFO ] Flatten gal took : 8 ms
[2026-05-25 22:51:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16767692920716629766.gal : 13 ms
[2026-05-25 22:51:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8750376866312284226.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16767692920716629766.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8750376866312284226.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 348/348 transitions.
Graph (trivial) has 132 edges and 257 vertex of which 70 / 257 are part of one of the 31 SCC in 1 ms
Free SCC test removed 39 places
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Graph (complete) has 747 edges and 218 vertex of which 213 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 24 place count 191 transition count 248
Iterating global reduction 0 with 22 rules applied. Total rules applied 46 place count 191 transition count 248
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 191 transition count 246
Applied a total of 48 rules in 24 ms. Remains 191 /257 variables (removed 66) and now considering 246/348 (removed 102) transitions.
[2026-05-25 22:51:06] [INFO ] Flow matrix only has 216 transitions (discarded 30 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6275220661614451579.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2202337727977595197.kers'
[2026-05-25 22:51:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6275220661614451579.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2202337727977595197.kers]
Normalized transition count is 215 out of 216 initially.
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 215 rows 182 cols 662 entries
Finished phase 1 with 133 SingleSign rule and 0 generalized
[2026-05-25 22:51:06] [INFO ] Computed 58 invariants in 0 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2202337727977595197.kers
Total runtime 1 ms.
[2026-05-25 22:51:07] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-25 22:51:07] [INFO ] Flow matrix only has 216 transitions (discarded 30 similar events)
[2026-05-25 22:51:07] [INFO ] Invariant cache hit.
[2026-05-25 22:51:07] [INFO ] State equation strengthened by 94 read => feed constraints.
[2026-05-25 22:51:07] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2026-05-25 22:51:07] [INFO ] Redundant transitions in 18 ms returned []
Running 245 sub problems to find dead transitions.
[2026-05-25 22:51:07] [INFO ] Flow matrix only has 216 transitions (discarded 30 similar events)
[2026-05-25 22:51:07] [INFO ] Invariant cache hit.
[2026-05-25 22:51:07] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (OVERLAPS) 1/191 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (OVERLAPS) 215/406 variables, 191/249 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 93/342 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (OVERLAPS) 1/407 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 10 (OVERLAPS) 0/407 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 343 constraints, problems are : Problem set: 0 solved, 245 unsolved in 14917 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 191/191 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (OVERLAPS) 1/191 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (OVERLAPS) 215/406 variables, 191/249 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 93/342 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 245/587 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 9 (OVERLAPS) 1/407 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 11 (OVERLAPS) 0/407 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 588 constraints, problems are : Problem set: 0 solved, 245 unsolved in 20411 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 191/191 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35370ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 35371ms
Starting structural reductions in SI_CTL mode, iteration 1 : 191/257 places, 246/348 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35736 ms. Remains : 191/257 places, 246/348 transitions.
[2026-05-25 22:51:42] [INFO ] Flatten gal took : 13 ms
[2026-05-25 22:51:42] [INFO ] Flatten gal took : 10 ms
[2026-05-25 22:51:42] [INFO ] Input system was already deterministic with 246 transitions.
[2026-05-25 22:51:42] [INFO ] Flatten gal took : 9 ms
[2026-05-25 22:51:42] [INFO ] Flatten gal took : 9 ms
[2026-05-25 22:51:42] [INFO ] Time to serialize gal into /tmp/CTLFireability12388688480585047323.gal : 2 ms
[2026-05-25 22:51:42] [INFO ] Time to serialize properties into /tmp/CTLFireability14237735281998731783.ctl : 3 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/CTLFireability12388688480585047323.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14237735281998731783.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,2.22903e+25,0.295538,15524,2,514,5,63677,6,0,962,58552,0
Converting to forward existential form...Done !
original formula: EF(EG(A(EF(((p16==1)&&(p102==1))) U E((((p194==1)&&(p198==1))&&(p169==1)) U (p198==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((E(!(E((((p194==1)&&(p198==1))&&(p169==1)) U (p198==1))) U (!(E(TRUE U ((p16==1)&&(p102=...292
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 231/30/15
Detected timeout of ITS tools.
[2026-05-25 22:52:12] [INFO ] Flatten gal took : 10 ms
[2026-05-25 22:52:12] [INFO ] Applying decomposition
[2026-05-25 22:52:12] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5455695879316970049.txt' '-o' '/tmp/graph5455695879316970049.bin' '-w' '/tmp/graph5455695879316970049.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5455695879316970049.bin' '-l' '-1' '-v' '-w' '/tmp/graph5455695879316970049.weights' '-q' '0' '-e' '0.001'
[2026-05-25 22:52:12] [INFO ] Decomposing Gal with order
[2026-05-25 22:52:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 22:52:12] [INFO ] Removed a total of 63 redundant transitions.
[2026-05-25 22:52:12] [INFO ] Flatten gal took : 59 ms
[2026-05-25 22:52:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 10 ms.
[2026-05-25 22:52:12] [INFO ] Time to serialize gal into /tmp/CTLFireability4976032317613619203.gal : 5 ms
[2026-05-25 22:52:12] [INFO ] Time to serialize properties into /tmp/CTLFireability11552227645847465095.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/CTLFireability4976032317613619203.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11552227645847465095.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.22903e+25,0.101479,8492,212,34,9207,406,551,14285,63,1709,0
Converting to forward existential form...Done !
original formula: EF(EG(A(EF(((i0.u3.p16==1)&&(i3.u18.p102==1))) U E((((i0.u0.p194==1)&&(i5.i1.u35.p198==1))&&(i4.i0.u30.p169==1)) U (i5.i1.u35.p198==1))))...156
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((E(!(E((((i0.u0.p194==1)&&(i5.i1.u35.p198==1))&&(i4.i0.u30.p169==1)) U (i5.i1.u35.p198==...413
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 348/348 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 252 transition count 348
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 24 place count 233 transition count 329
Iterating global reduction 1 with 19 rules applied. Total rules applied 43 place count 233 transition count 329
Applied a total of 43 rules in 8 ms. Remains 233 /257 variables (removed 24) and now considering 329/348 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10878400472794555876.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3959916428962726032.kers'
[2026-05-25 22:52:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10878400472794555876.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3959916428962726032.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 329 rows 232 cols 1090 entries
Finished phase 1 with 175 SingleSign rule and 0 generalized
[2026-05-25 22:52:43] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3959916428962726032.kers
Total runtime 2 ms.
[2026-05-25 22:52:43] [INFO ] Implicit Places using invariants in 196 ms returned []
[2026-05-25 22:52:43] [INFO ] Invariant cache hit.
[2026-05-25 22:52:43] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2026-05-25 22:52:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (OVERLAPS) 1/232 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (OVERLAPS) 1/233 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (OVERLAPS) 329/562 variables, 233/291 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 0/562 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 328 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 291 constraints, problems are : Problem set: 0 solved, 328 unsolved in 22250 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (OVERLAPS) 1/232 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (OVERLAPS) 1/233 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (OVERLAPS) 329/562 variables, 233/291 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 328/619 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (OVERLAPS) 0/562 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 328 unsolved
No progress, stopping.
After SMT solving in domain Int declared 562/562 variables, and 619 constraints, problems are : Problem set: 0 solved, 328 unsolved in 27559 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49834ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 49836ms
Starting structural reductions in LTL mode, iteration 1 : 233/257 places, 329/348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50275 ms. Remains : 233/257 places, 329/348 transitions.
[2026-05-25 22:53:33] [INFO ] Flatten gal took : 13 ms
[2026-05-25 22:53:33] [INFO ] Flatten gal took : 11 ms
[2026-05-25 22:53:33] [INFO ] Input system was already deterministic with 329 transitions.
[2026-05-25 22:53:33] [INFO ] Flatten gal took : 15 ms
[2026-05-25 22:53:33] [INFO ] Flatten gal took : 10 ms
[2026-05-25 22:53:33] [INFO ] Time to serialize gal into /tmp/CTLFireability17707713575000768552.gal : 2 ms
[2026-05-25 22:53:33] [INFO ] Time to serialize properties into /tmp/CTLFireability8426962856779567253.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/CTLFireability17707713575000768552.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8426962856779567253.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,2.75736e+33,0.401143,19336,2,638,5,75321,6,0,1260,86989,0
Converting to forward existential form...Done !
original formula: (E(((!(((((p171==1)&&(p205==1))||(p81!=1))||(((p276==1)&&(p288==1))&&(p77==1)))) * (AX(((p116==1)||(p260==1))) + (E((p285==1) U ((p66==1)...429
=> equivalent forward existential formula: [(FwdU((Init * E(((!(((((p171==1)&&(p205==1))||(p81!=1))||(((p276==1)&&(p288==1))&&(p77==1)))) * (!(EX(!(((p116=...541
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.564003,19516,1,0,6,75321,15,0,6063,86989,5
FORMULA NoC3x3-PT-4A-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 348/348 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 251 transition count 348
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 29 place count 228 transition count 325
Iterating global reduction 1 with 23 rules applied. Total rules applied 52 place count 228 transition count 325
Applied a total of 52 rules in 4 ms. Remains 228 /257 variables (removed 29) and now considering 325/348 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17547144757740467236.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14118418450326669373.kers'
[2026-05-25 22:53:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17547144757740467236.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14118418450326669373.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 325 rows 228 cols 1074 entries
Finished phase 1 with 171 SingleSign rule and 0 generalized
[2026-05-25 22:53:34] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14118418450326669373.kers
Total runtime 1 ms.
[2026-05-25 22:53:34] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-25 22:53:34] [INFO ] Invariant cache hit.
[2026-05-25 22:53:34] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2026-05-25 22:53:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 285 constraints, problems are : Problem set: 0 solved, 324 unsolved in 17598 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 324/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 609 constraints, problems are : Problem set: 0 solved, 324 unsolved in 23819 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41440ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 41441ms
Starting structural reductions in LTL mode, iteration 1 : 228/257 places, 325/348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41724 ms. Remains : 228/257 places, 325/348 transitions.
[2026-05-25 22:54:15] [INFO ] Flatten gal took : 12 ms
[2026-05-25 22:54:15] [INFO ] Flatten gal took : 10 ms
[2026-05-25 22:54:15] [INFO ] Input system was already deterministic with 325 transitions.
[2026-05-25 22:54:15] [INFO ] Flatten gal took : 7 ms
[2026-05-25 22:54:15] [INFO ] Flatten gal took : 6 ms
[2026-05-25 22:54:15] [INFO ] Time to serialize gal into /tmp/CTLFireability1869929425772049849.gal : 2 ms
[2026-05-25 22:54:15] [INFO ] Time to serialize properties into /tmp/CTLFireability2251579245119631641.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/CTLFireability1869929425772049849.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2251579245119631641.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,1.36774e+33,0.375177,18000,2,624,5,69292,6,0,1239,78552,0
Converting to forward existential form...Done !
original formula: EX(EX(AG((((p198==0)||(p6==0))||(p21==0)))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(E(TRUE U !((((p198==0)||(p6==0))||(p21==0))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2026-05-25 22:54:45] [INFO ] Flatten gal took : 10 ms
[2026-05-25 22:54:45] [INFO ] Applying decomposition
[2026-05-25 22:54:45] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9309945155254252358.txt' '-o' '/tmp/graph9309945155254252358.bin' '-w' '/tmp/graph9309945155254252358.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9309945155254252358.bin' '-l' '-1' '-v' '-w' '/tmp/graph9309945155254252358.weights' '-q' '0' '-e' '0.001'
[2026-05-25 22:54:45] [INFO ] Decomposing Gal with order
[2026-05-25 22:54:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 22:54:45] [INFO ] Removed a total of 80 redundant transitions.
[2026-05-25 22:54:45] [INFO ] Flatten gal took : 17 ms
[2026-05-25 22:54:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-25 22:54:45] [INFO ] Time to serialize gal into /tmp/CTLFireability16970253818022137939.gal : 4 ms
[2026-05-25 22:54:45] [INFO ] Time to serialize properties into /tmp/CTLFireability11478774760318271609.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/CTLFireability16970253818022137939.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11478774760318271609.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.36774e+33,0.098846,7864,137,67,8138,794,516,8979,96,3154,0
Converting to forward existential form...Done !
original formula: EX(EX(AG((((i5.u33.p198==0)||(i0.i1.u1.p6==0))||(i0.i1.u4.p21==0)))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(E(TRUE U !((((i5.u33.p198==0)||(i0.i1.u1.p6==0))||(i0.i1.u4.p21==0))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 348/348 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 252 transition count 348
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 27 place count 230 transition count 326
Iterating global reduction 1 with 22 rules applied. Total rules applied 49 place count 230 transition count 326
Applied a total of 49 rules in 15 ms. Remains 230 /257 variables (removed 27) and now considering 326/348 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7912810782387353914.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3768692007993040927.kers'
[2026-05-25 22:55:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7912810782387353914.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3768692007993040927.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 326 rows 229 cols 1078 entries
Finished phase 1 with 172 SingleSign rule and 0 generalized
[2026-05-25 22:55:16] [INFO ] Computed 58 invariants in 2 ms
Computed 58 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3768692007993040927.kers
Total runtime 3 ms.
[2026-05-25 22:55:16] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-25 22:55:16] [INFO ] Invariant cache hit.
[2026-05-25 22:55:16] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Running 325 sub problems to find dead transitions.
[2026-05-25 22:55:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (OVERLAPS) 1/230 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (OVERLAPS) 326/556 variables, 230/288 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 7 (OVERLAPS) 0/556 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 288 constraints, problems are : Problem set: 0 solved, 325 unsolved in 21738 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 325 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (OVERLAPS) 1/230 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (OVERLAPS) 326/556 variables, 230/288 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 325/613 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 8 (OVERLAPS) 0/556 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 613 constraints, problems are : Problem set: 0 solved, 325 unsolved in 26770 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48541ms problems are : Problem set: 0 solved, 325 unsolved
Search for dead transitions found 0 dead transitions in 48542ms
Starting structural reductions in LTL mode, iteration 1 : 230/257 places, 326/348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48844 ms. Remains : 230/257 places, 326/348 transitions.
[2026-05-25 22:56:04] [INFO ] Flatten gal took : 11 ms
[2026-05-25 22:56:04] [INFO ] Flatten gal took : 7 ms
[2026-05-25 22:56:04] [INFO ] Input system was already deterministic with 326 transitions.
[2026-05-25 22:56:04] [INFO ] Flatten gal took : 6 ms
[2026-05-25 22:56:04] [INFO ] Flatten gal took : 7 ms
[2026-05-25 22:56:04] [INFO ] Time to serialize gal into /tmp/CTLFireability7196281188827323148.gal : 2 ms
[2026-05-25 22:56:04] [INFO ] Time to serialize properties into /tmp/CTLFireability14379493571765038939.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/CTLFireability7196281188827323148.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14379493571765038939.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.64128e+33,0.365529,18604,2,629,5,72681,6,0,1245,82295,0
Converting to forward existential form...Done !
original formula: EF(EX(AX((((p33==1)&&(p79==1))&&((p155==1)&&(p162==1))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EX(!((((p33==1)&&(p79==1))&&((p155==1)&&(p162==1)))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.521628,18784,1,0,6,72681,11,0,5850,82295,4
FORMULA NoC3x3-PT-4A-CTLFireability-2024-04 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 : 257/257 places, 348/348 transitions.
Graph (trivial) has 121 edges and 257 vertex of which 62 / 257 are part of one of the 27 SCC in 0 ms
Free SCC test removed 35 places
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Graph (complete) has 756 edges and 222 vertex of which 216 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 207 transition count 250
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 59 place count 186 transition count 250
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 81 place count 164 transition count 228
Iterating global reduction 2 with 22 rules applied. Total rules applied 103 place count 164 transition count 228
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 2 with 26 rules applied. Total rules applied 129 place count 164 transition count 202
Applied a total of 129 rules in 16 ms. Remains 164 /257 variables (removed 93) and now considering 202/348 (removed 146) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5337357779068723158.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15109281069609709315.kers'
[2026-05-25 22:56:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5337357779068723158.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15109281069609709315.kers]
Normalized transition count is 201 out of 202 initially.
Culling duplicate invariants (modulo rational): removing 19 columns.
Culled 19 columns in 0 ms.
// Phase 1: matrix 201 rows 145 cols 517 entries
Finished phase 1 with 115 SingleSign rule and 0 generalized
[2026-05-25 22:56:05] [INFO ] Computed 49 invariants in 0 ms
Computed 49 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15109281069609709315.kers
Total runtime 1 ms.
[2026-05-25 22:56:05] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-25 22:56:05] [INFO ] Invariant cache hit.
[2026-05-25 22:56:05] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-25 22:56:05] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2026-05-25 22:56:05] [INFO ] Redundant transitions in 69 ms returned []
Running 179 sub problems to find dead transitions.
[2026-05-25 22:56:05] [INFO ] Invariant cache hit.
[2026-05-25 22:56:05] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 201/365 variables, 164/213 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 44/257 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/365 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/366 variables, and 257 constraints, problems are : Problem set: 0 solved, 179 unsolved in 8037 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 164/164 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 201/365 variables, 164/213 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 44/257 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 179/436 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/366 variables, and 436 constraints, problems are : Problem set: 0 solved, 179 unsolved in 7942 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 164/164 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15992ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 15993ms
Starting structural reductions in SI_CTL mode, iteration 1 : 164/257 places, 202/348 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16323 ms. Remains : 164/257 places, 202/348 transitions.
[2026-05-25 22:56:21] [INFO ] Flatten gal took : 7 ms
[2026-05-25 22:56:21] [INFO ] Flatten gal took : 5 ms
[2026-05-25 22:56:21] [INFO ] Input system was already deterministic with 202 transitions.
[2026-05-25 22:56:21] [INFO ] Flatten gal took : 3 ms
[2026-05-25 22:56:21] [INFO ] Flatten gal took : 3 ms
[2026-05-25 22:56:21] [INFO ] Time to serialize gal into /tmp/CTLFireability9367353917292388864.gal : 1 ms
[2026-05-25 22:56:21] [INFO ] Time to serialize properties into /tmp/CTLFireability18023969168062897407.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/CTLFireability9367353917292388864.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18023969168062897407.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.35261e+24,0.105541,8808,2,974,5,25934,5,0,859,23448,0
Converting to forward existential form...Done !
original formula: EG((EF(EG(A(((p103==1)&&(p110==1)) U (p75==1)))) + ((EF(((p17==0)||(p156==0))) * (p205==1)) * ((p26==0)||(p51==0)))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U EG(!((E(!((p75==1)) U (!(((p103==1)&&(p110==1))) * !((p75==1)))) + EG(!((p75==1))))))) + ((...235
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 196/0/6
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-25 22:56:51] [INFO ] Flatten gal took : 4 ms
[2026-05-25 22:56:51] [INFO ] Applying decomposition
[2026-05-25 22:56:51] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph82561197960405551.txt' '-o' '/tmp/graph82561197960405551.bin' '-w' '/tmp/graph82561197960405551.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph82561197960405551.bin' '-l' '-1' '-v' '-w' '/tmp/graph82561197960405551.weights' '-q' '0' '-e' '0.001'
[2026-05-25 22:56:51] [INFO ] Decomposing Gal with order
[2026-05-25 22:56:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 22:56:51] [INFO ] Removed a total of 42 redundant transitions.
[2026-05-25 22:56:51] [INFO ] Flatten gal took : 25 ms
[2026-05-25 22:56:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 22:56:51] [INFO ] Time to serialize gal into /tmp/CTLFireability14036590173051400234.gal : 2 ms
[2026-05-25 22:56:51] [INFO ] Time to serialize properties into /tmp/CTLFireability3943830600717633171.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/CTLFireability14036590173051400234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3943830600717633171.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.35261e+24,0.071244,6076,86,23,4209,214,422,4607,50,635,0
Converting to forward existential form...Done !
original formula: EG((EF(EG(A(((i3.u16.p103==1)&&(i3.u18.p110==1)) U (i2.u12.p75==1)))) + ((EF(((i0.u3.p17==0)||(i4.i1.i0.u24.p156==0))) * (i5.u34.p205==1)...194
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U EG(!((E(!((i2.u12.p75==1)) U (!(((i3.u16.p103==1)&&(i3.u18.p110==1))) * !((i2.u12.p75==1)))...308
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 0
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 0
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 348/348 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 251 transition count 348
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 28 place count 229 transition count 326
Iterating global reduction 1 with 22 rules applied. Total rules applied 50 place count 229 transition count 326
Applied a total of 50 rules in 9 ms. Remains 229 /257 variables (removed 28) and now considering 326/348 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14264817571856451617.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10397997290460673189.kers'
[2026-05-25 22:57:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14264817571856451617.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10397997290460673189.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 326 rows 229 cols 1078 entries
Finished phase 1 with 172 SingleSign rule and 0 generalized
[2026-05-25 22:57:22] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-10397997290460673189.kers
Total runtime 7 ms.
[2026-05-25 22:57:22] [INFO ] Implicit Places using invariants in 163 ms returned []
[2026-05-25 22:57:22] [INFO ] Invariant cache hit.
[2026-05-25 22:57:22] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 325 sub problems to find dead transitions.
[2026-05-25 22:57:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (OVERLAPS) 326/555 variables, 229/286 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (OVERLAPS) 0/555 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 286 constraints, problems are : Problem set: 0 solved, 325 unsolved in 17777 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 325 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (OVERLAPS) 326/555 variables, 229/286 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 325/611 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (OVERLAPS) 0/555 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 611 constraints, problems are : Problem set: 0 solved, 325 unsolved in 24122 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41949ms problems are : Problem set: 0 solved, 325 unsolved
Search for dead transitions found 0 dead transitions in 41960ms
Starting structural reductions in LTL mode, iteration 1 : 229/257 places, 326/348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42323 ms. Remains : 229/257 places, 326/348 transitions.
[2026-05-25 22:58:04] [INFO ] Flatten gal took : 7 ms
[2026-05-25 22:58:04] [INFO ] Flatten gal took : 5 ms
[2026-05-25 22:58:04] [INFO ] Input system was already deterministic with 326 transitions.
[2026-05-25 22:58:04] [INFO ] Flatten gal took : 5 ms
[2026-05-25 22:58:04] [INFO ] Flatten gal took : 5 ms
[2026-05-25 22:58:04] [INFO ] Time to serialize gal into /tmp/CTLFireability14137416244672283884.gal : 1 ms
[2026-05-25 22:58:04] [INFO ] Time to serialize properties into /tmp/CTLFireability10930407161075053685.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/CTLFireability14137416244672283884.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10930407161075053685.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,1.64128e+33,0.385228,20068,2,627,5,81092,6,0,1244,90966,0
Converting to forward existential form...Done !
original formula: AF(!(E(EF((p225==1)) U EX(AG(((p84==1)&&(p111==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(E(TRUE U (p225==1)) U EX(!(E(TRUE U !(((p84==1)&&(p111==1))))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2026-05-25 22:58:34] [INFO ] Flatten gal took : 9 ms
[2026-05-25 22:58:34] [INFO ] Applying decomposition
[2026-05-25 22:58:34] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5564907282882125246.txt' '-o' '/tmp/graph5564907282882125246.bin' '-w' '/tmp/graph5564907282882125246.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5564907282882125246.bin' '-l' '-1' '-v' '-w' '/tmp/graph5564907282882125246.weights' '-q' '0' '-e' '0.001'
[2026-05-25 22:58:34] [INFO ] Decomposing Gal with order
[2026-05-25 22:58:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 22:58:34] [INFO ] Removed a total of 74 redundant transitions.
[2026-05-25 22:58:34] [INFO ] Flatten gal took : 14 ms
[2026-05-25 22:58:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-25 22:58:34] [INFO ] Time to serialize gal into /tmp/CTLFireability10998027805448488649.gal : 11 ms
[2026-05-25 22:58:34] [INFO ] Time to serialize properties into /tmp/CTLFireability9489735795521272666.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/CTLFireability10998027805448488649.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9489735795521272666.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.64128e+33,0.096324,7932,123,40,8531,630,513,8974,74,2314,0
Converting to forward existential form...Done !
original formula: AF(!(E(EF((i6.u39.p225==1)) U EX(AG(((i3.u18.p84==1)&&(i3.u18.p111==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(E(TRUE U (i6.u39.p225==1)) U EX(!(E(TRUE U !(((i3.u18.p84==1)&&(i3.u18.p111==1))))))))))] = FAL...157
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 348/348 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 251 transition count 348
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 26 place count 231 transition count 328
Iterating global reduction 1 with 20 rules applied. Total rules applied 46 place count 231 transition count 328
Applied a total of 46 rules in 13 ms. Remains 231 /257 variables (removed 26) and now considering 328/348 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4994008338521939310.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11349498478011529971.kers'
[2026-05-25 22:59:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4994008338521939310.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11349498478011529971.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 328 rows 231 cols 1086 entries
Finished phase 1 with 174 SingleSign rule and 0 generalized
[2026-05-25 22:59:04] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11349498478011529971.kers
Total runtime 3 ms.
[2026-05-25 22:59:04] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-05-25 22:59:04] [INFO ] Invariant cache hit.
[2026-05-25 22:59:05] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 327 sub problems to find dead transitions.
[2026-05-25 22:59:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (OVERLAPS) 328/559 variables, 231/288 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (OVERLAPS) 0/559 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 288 constraints, problems are : Problem set: 0 solved, 327 unsolved in 18153 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 327 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (OVERLAPS) 328/559 variables, 231/288 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 327/615 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (OVERLAPS) 0/559 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Int declared 559/559 variables, and 615 constraints, problems are : Problem set: 0 solved, 327 unsolved in 23713 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41888ms problems are : Problem set: 0 solved, 327 unsolved
Search for dead transitions found 0 dead transitions in 41889ms
Starting structural reductions in LTL mode, iteration 1 : 231/257 places, 328/348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42210 ms. Remains : 231/257 places, 328/348 transitions.
[2026-05-25 22:59:46] [INFO ] Flatten gal took : 5 ms
[2026-05-25 22:59:47] [INFO ] Flatten gal took : 6 ms
[2026-05-25 22:59:47] [INFO ] Input system was already deterministic with 328 transitions.
[2026-05-25 22:59:47] [INFO ] Flatten gal took : 5 ms
[2026-05-25 22:59:47] [INFO ] Flatten gal took : 5 ms
[2026-05-25 22:59:47] [INFO ] Time to serialize gal into /tmp/CTLFireability16205840465585024303.gal : 1 ms
[2026-05-25 22:59:47] [INFO ] Time to serialize properties into /tmp/CTLFireability9287249543672580698.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/CTLFireability16205840465585024303.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9287249543672580698.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,2.17192e+33,0.386783,20068,2,633,5,79664,6,0,1254,91374,0
Converting to forward existential form...Done !
original formula: EX(((AX(!(A(((p129==1)&&(p157==1)) U ((p161==1)&&(p179==1))))) * (!(E(AF(((p148==1)&&(p156==1))) U !((((p90==1)&&(p111==1))||(p284==1))))...277
=> equivalent forward existential formula: ([(FwdU((EY(Init) * (!(EX(!(!(!((E(!(((p161==1)&&(p179==1))) U (!(((p129==1)&&(p157==1))) * !(((p161==1)&&(p179=...765
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2026-05-25 23:00:17] [INFO ] Flatten gal took : 5 ms
[2026-05-25 23:00:17] [INFO ] Applying decomposition
[2026-05-25 23:00:17] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1396799702782100273.txt' '-o' '/tmp/graph1396799702782100273.bin' '-w' '/tmp/graph1396799702782100273.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1396799702782100273.bin' '-l' '-1' '-v' '-w' '/tmp/graph1396799702782100273.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:00:17] [INFO ] Decomposing Gal with order
[2026-05-25 23:00:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:00:17] [INFO ] Removed a total of 74 redundant transitions.
[2026-05-25 23:00:17] [INFO ] Flatten gal took : 15 ms
[2026-05-25 23:00:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-25 23:00:17] [INFO ] Time to serialize gal into /tmp/CTLFireability16396968289458041159.gal : 2 ms
[2026-05-25 23:00:17] [INFO ] Time to serialize properties into /tmp/CTLFireability7887121353737632056.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/CTLFireability16396968289458041159.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7887121353737632056.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.17192e+33,0.133921,10128,146,74,13693,1330,556,14332,104,4631,0
Converting to forward existential form...Done !
original formula: EX(((AX(!(A(((i4.u24.p129==1)&&(i4.u24.p157==1)) U ((i4.u25.p161==1)&&(i5.u32.p179==1))))) * (!(E(AF(((i4.u24.p148==1)&&(i4.u24.p156==1))...394
=> equivalent forward existential formula: ([(FwdU((EY(Init) * (!(EX(!(!(!((E(!(((i4.u25.p161==1)&&(i5.u32.p179==1))) U (!(((i4.u24.p129==1)&&(i4.u24.p157=...1035
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 348/348 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 252 transition count 348
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 26 place count 231 transition count 327
Iterating global reduction 1 with 21 rules applied. Total rules applied 47 place count 231 transition count 327
Applied a total of 47 rules in 5 ms. Remains 231 /257 variables (removed 26) and now considering 327/348 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7073867007534288762.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10196888098704059238.kers'
[2026-05-25 23:00:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7073867007534288762.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10196888098704059238.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 327 rows 230 cols 1082 entries
Finished phase 1 with 173 SingleSign rule and 0 generalized
[2026-05-25 23:00:47] [INFO ] Computed 58 invariants in 3 ms
Computed 58 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10196888098704059238.kers
Total runtime 5 ms.
[2026-05-25 23:00:47] [INFO ] Implicit Places using invariants in 138 ms returned []
[2026-05-25 23:00:47] [INFO ] Invariant cache hit.
[2026-05-25 23:00:47] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 326 sub problems to find dead transitions.
[2026-05-25 23:00:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (OVERLAPS) 1/231 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (OVERLAPS) 327/558 variables, 231/289 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 7 (OVERLAPS) 0/558 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 289 constraints, problems are : Problem set: 0 solved, 326 unsolved in 21534 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 326 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (OVERLAPS) 1/231 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (OVERLAPS) 327/558 variables, 231/289 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 326/615 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 8 (OVERLAPS) 0/558 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/558 variables, and 615 constraints, problems are : Problem set: 0 solved, 326 unsolved in 26128 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47686ms problems are : Problem set: 0 solved, 326 unsolved
Search for dead transitions found 0 dead transitions in 47687ms
Starting structural reductions in LTL mode, iteration 1 : 231/257 places, 327/348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48002 ms. Remains : 231/257 places, 327/348 transitions.
[2026-05-25 23:01:35] [INFO ] Flatten gal took : 6 ms
[2026-05-25 23:01:35] [INFO ] Flatten gal took : 5 ms
[2026-05-25 23:01:35] [INFO ] Input system was already deterministic with 327 transitions.
[2026-05-25 23:01:35] [INFO ] Flatten gal took : 4 ms
[2026-05-25 23:01:35] [INFO ] Flatten gal took : 4 ms
[2026-05-25 23:01:35] [INFO ] Time to serialize gal into /tmp/CTLFireability2764713486801846496.gal : 1 ms
[2026-05-25 23:01:35] [INFO ] Time to serialize properties into /tmp/CTLFireability4891739134289347579.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/CTLFireability2764713486801846496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4891739134289347579.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,1.96954e+33,0.387829,18496,2,632,5,71631,6,0,1250,81654,0
Converting to forward existential form...Done !
original formula: E(EF(!((AX((((p261==1)&&(p13==1))&&(p17==1))) * AF((p75==1))))) U (((p187==1)&&(p205==1)) * (AG((A(((p86==1)&&(p111==1)) U (p199==1)) * E...270
=> equivalent forward existential formula: [FwdG(((EY(((FwdU(Init,E(TRUE U !((!(EX(!((((p261==1)&&(p13==1))&&(p17==1))))) * !(EG(!((p75==1)))))))) * ((p187...397
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 318/7/9
Detected timeout of ITS tools.
[2026-05-25 23:02:05] [INFO ] Flatten gal took : 7 ms
[2026-05-25 23:02:05] [INFO ] Applying decomposition
[2026-05-25 23:02:05] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph748032354168489821.txt' '-o' '/tmp/graph748032354168489821.bin' '-w' '/tmp/graph748032354168489821.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph748032354168489821.bin' '-l' '-1' '-v' '-w' '/tmp/graph748032354168489821.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:02:05] [INFO ] Decomposing Gal with order
[2026-05-25 23:02:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:02:05] [INFO ] Removed a total of 78 redundant transitions.
[2026-05-25 23:02:05] [INFO ] Flatten gal took : 11 ms
[2026-05-25 23:02:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2026-05-25 23:02:05] [INFO ] Time to serialize gal into /tmp/CTLFireability7139827755428244411.gal : 3 ms
[2026-05-25 23:02:05] [INFO ] Time to serialize properties into /tmp/CTLFireability4622938837113592815.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/CTLFireability7139827755428244411.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4622938837113592815.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.96954e+33,0.0977,8144,138,37,8665,720,571,9869,81,2753,0
Converting to forward existential form...Done !
original formula: E(EF(!((AX((((i7.u47.p261==1)&&(i3.i0.u0.p13==1))&&(i0.i1.u4.p17==1))) * AF((i2.u14.p75==1))))) U (((i5.u34.p187==1)&&(i5.u38.p205==1)) *...403
=> equivalent forward existential formula: [FwdG(((EY(((FwdU(Init,E(TRUE U !((!(EX(!((((i7.u47.p261==1)&&(i3.i0.u0.p13==1))&&(i0.i1.u4.p17==1))))) * !(EG(!...544
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 348/348 transitions.
Graph (trivial) has 113 edges and 257 vertex of which 60 / 257 are part of one of the 27 SCC in 0 ms
Free SCC test removed 33 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Graph (complete) has 760 edges and 224 vertex of which 218 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 24 place count 196 transition count 261
Iterating global reduction 0 with 22 rules applied. Total rules applied 46 place count 196 transition count 261
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 53 place count 196 transition count 254
Applied a total of 53 rules in 23 ms. Remains 196 /257 variables (removed 61) and now considering 254/348 (removed 94) transitions.
[2026-05-25 23:02:35] [INFO ] Flow matrix only has 228 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2322500912546575633.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1871387569497002848.kers'
[2026-05-25 23:02:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2322500912546575633.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1871387569497002848.kers]
Normalized transition count is 227 out of 228 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 227 rows 190 cols 712 entries
Finished phase 1 with 139 SingleSign rule and 0 generalized
[2026-05-25 23:02:35] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1871387569497002848.kers
Total runtime 3 ms.
[2026-05-25 23:02:35] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-25 23:02:35] [INFO ] Flow matrix only has 228 transitions (discarded 26 similar events)
[2026-05-25 23:02:35] [INFO ] Invariant cache hit.
[2026-05-25 23:02:35] [INFO ] State equation strengthened by 82 read => feed constraints.
[2026-05-25 23:02:35] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2026-05-25 23:02:35] [INFO ] Redundant transitions in 2 ms returned []
Running 253 sub problems to find dead transitions.
[2026-05-25 23:02:35] [INFO ] Flow matrix only has 228 transitions (discarded 26 similar events)
[2026-05-25 23:02:35] [INFO ] Invariant cache hit.
[2026-05-25 23:02:35] [INFO ] State equation strengthened by 82 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (OVERLAPS) 227/423 variables, 196/253 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 81/334 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 1/424 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (OVERLAPS) 0/424 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 335 constraints, problems are : Problem set: 0 solved, 253 unsolved in 15794 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 196/196 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (OVERLAPS) 227/423 variables, 196/253 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 81/334 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 253/587 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (OVERLAPS) 1/424 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (OVERLAPS) 0/424 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 588 constraints, problems are : Problem set: 0 solved, 253 unsolved in 19788 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 196/196 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35601ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 35603ms
Starting structural reductions in SI_CTL mode, iteration 1 : 196/257 places, 254/348 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35985 ms. Remains : 196/257 places, 254/348 transitions.
[2026-05-25 23:03:11] [INFO ] Flatten gal took : 5 ms
[2026-05-25 23:03:11] [INFO ] Flatten gal took : 5 ms
[2026-05-25 23:03:11] [INFO ] Input system was already deterministic with 254 transitions.
[2026-05-25 23:03:11] [INFO ] Flatten gal took : 4 ms
[2026-05-25 23:03:11] [INFO ] Flatten gal took : 4 ms
[2026-05-25 23:03:11] [INFO ] Time to serialize gal into /tmp/CTLFireability3503042731145573206.gal : 1 ms
[2026-05-25 23:03:11] [INFO ] Time to serialize properties into /tmp/CTLFireability11660655526395210958.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/CTLFireability3503042731145573206.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11660655526395210958.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,4.51378e+26,0.297261,16120,2,530,5,65500,6,0,1001,61886,0
Converting to forward existential form...Done !
original formula: (AG(EF((p21==0))) * (AF((!(E((((p16==1)&&(p100==1))||(p74==1)) U ((p32==1)&&(p54==1)))) * A(AF((p225==1)) U !(((p110==1)||((p31==1)&&(p56...226
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U (p21==0))))] = FALSE * [FwdG((Init * !(!(EG(!((!(E((((p16==1)&&(p100==1))||(p74=...434
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 238/0/16
Hit Full ! (commute/partial/dont) 242/0/12
Detected timeout of ITS tools.
[2026-05-25 23:03:41] [INFO ] Flatten gal took : 14 ms
[2026-05-25 23:03:41] [INFO ] Applying decomposition
[2026-05-25 23:03:41] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12297860356263924772.txt' '-o' '/tmp/graph12297860356263924772.bin' '-w' '/tmp/graph12297860356263924772.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12297860356263924772.bin' '-l' '-1' '-v' '-w' '/tmp/graph12297860356263924772.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:03:41] [INFO ] Decomposing Gal with order
[2026-05-25 23:03:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:03:41] [INFO ] Removed a total of 61 redundant transitions.
[2026-05-25 23:03:41] [INFO ] Flatten gal took : 12 ms
[2026-05-25 23:03:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 4 ms.
[2026-05-25 23:03:41] [INFO ] Time to serialize gal into /tmp/CTLFireability5537517960006894591.gal : 2 ms
[2026-05-25 23:03:41] [INFO ] Time to serialize properties into /tmp/CTLFireability7596135683237446861.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/CTLFireability5537517960006894591.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7596135683237446861.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.51378e+26,0.097232,7820,229,46,8718,304,543,8548,91,1066,0
Converting to forward existential form...Done !
original formula: (AG(EF((i0.u3.p21==0))) * (AF((!(E((((i0.u1.p16==1)&&(i3.u16.p100==1))||(i2.u12.p74==1)) U ((i1.u5.p32==1)&&(i1.u8.p54==1)))) * A(AF((i6....317
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U (i0.u3.p21==0))))] = FALSE * [FwdG((Init * !(!(EG(!((!(E((((i0.u1.p16==1)&&(i3.u...563
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 348/348 transitions.
Graph (trivial) has 134 edges and 257 vertex of which 71 / 257 are part of one of the 31 SCC in 0 ms
Free SCC test removed 40 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Graph (complete) has 746 edges and 217 vertex of which 212 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 25 place count 189 transition count 246
Iterating global reduction 0 with 23 rules applied. Total rules applied 48 place count 189 transition count 246
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 189 transition count 244
Applied a total of 50 rules in 16 ms. Remains 189 /257 variables (removed 68) and now considering 244/348 (removed 104) transitions.
[2026-05-25 23:04:11] [INFO ] Flow matrix only has 214 transitions (discarded 30 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16893231431272547327.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3639172534105871045.kers'
[2026-05-25 23:04:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16893231431272547327.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3639172534105871045.kers]
Normalized transition count is 213 out of 214 initially.
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 1 ms.
// Phase 1: matrix 213 rows 179 cols 643 entries
Finished phase 1 with 131 SingleSign rule and 0 generalized
[2026-05-25 23:04:11] [INFO ] Computed 58 invariants in 4 ms
Computed 58 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-3639172534105871045.kers
Total runtime 5 ms.
[2026-05-25 23:04:11] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-25 23:04:11] [INFO ] Flow matrix only has 214 transitions (discarded 30 similar events)
[2026-05-25 23:04:11] [INFO ] Invariant cache hit.
[2026-05-25 23:04:11] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-05-25 23:04:12] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2026-05-25 23:04:12] [INFO ] Redundant transitions in 1 ms returned []
Running 243 sub problems to find dead transitions.
[2026-05-25 23:04:12] [INFO ] Flow matrix only has 214 transitions (discarded 30 similar events)
[2026-05-25 23:04:12] [INFO ] Invariant cache hit.
[2026-05-25 23:04:12] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (OVERLAPS) 1/189 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (OVERLAPS) 213/402 variables, 189/247 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 99/346 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (OVERLAPS) 1/403 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (OVERLAPS) 0/403 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 347 constraints, problems are : Problem set: 0 solved, 243 unsolved in 14895 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 189/189 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (OVERLAPS) 1/189 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (OVERLAPS) 213/402 variables, 189/247 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 99/346 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 243/589 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (OVERLAPS) 1/403 variables, 1/590 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (OVERLAPS) 0/403 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 590 constraints, problems are : Problem set: 0 solved, 243 unsolved in 21227 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 189/189 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36142ms problems are : Problem set: 0 solved, 243 unsolved
Search for dead transitions found 0 dead transitions in 36143ms
Starting structural reductions in SI_CTL mode, iteration 1 : 189/257 places, 244/348 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36523 ms. Remains : 189/257 places, 244/348 transitions.
[2026-05-25 23:04:48] [INFO ] Flatten gal took : 4 ms
[2026-05-25 23:04:48] [INFO ] Flatten gal took : 4 ms
[2026-05-25 23:04:48] [INFO ] Input system was already deterministic with 244 transitions.
[2026-05-25 23:04:48] [INFO ] Flatten gal took : 3 ms
[2026-05-25 23:04:48] [INFO ] Flatten gal took : 3 ms
[2026-05-25 23:04:48] [INFO ] Time to serialize gal into /tmp/CTLFireability142285647129219475.gal : 1 ms
[2026-05-25 23:04:48] [INFO ] Time to serialize properties into /tmp/CTLFireability15677468059561243743.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/CTLFireability142285647129219475.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15677468059561243743.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.2876e+24,0.265346,15160,2,508,5,61050,6,0,950,55556,0
Converting to forward existential form...Done !
original formula: EG(E(!(((p209==1)&&(p222==1))) U ((p155==1)&&(p156==1))))
=> equivalent forward existential formula: [FwdG(Init,E(!(((p209==1)&&(p222==1))) U ((p155==1)&&(p156==1))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 238/0/6
Detected timeout of ITS tools.
[2026-05-25 23:05:18] [INFO ] Flatten gal took : 4 ms
[2026-05-25 23:05:18] [INFO ] Applying decomposition
[2026-05-25 23:05:18] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5937639388665760130.txt' '-o' '/tmp/graph5937639388665760130.bin' '-w' '/tmp/graph5937639388665760130.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5937639388665760130.bin' '-l' '-1' '-v' '-w' '/tmp/graph5937639388665760130.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:05:18] [INFO ] Decomposing Gal with order
[2026-05-25 23:05:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:05:18] [INFO ] Removed a total of 63 redundant transitions.
[2026-05-25 23:05:18] [INFO ] Flatten gal took : 9 ms
[2026-05-25 23:05:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 5 ms.
[2026-05-25 23:05:18] [INFO ] Time to serialize gal into /tmp/CTLFireability2193881360281940181.gal : 2 ms
[2026-05-25 23:05:18] [INFO ] Time to serialize properties into /tmp/CTLFireability1640379939169657056.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/CTLFireability2193881360281940181.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1640379939169657056.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.2876e+24,0.101185,7536,205,34,8309,359,446,7279,59,1277,0
Converting to forward existential form...Done !
original formula: EG(E(!(((i6.u35.p209==1)&&(i6.u37.p222==1))) U ((i0.u0.p155==1)&&(i4.u25.p156==1))))
=> equivalent forward existential formula: [FwdG(Init,E(!(((i6.u35.p209==1)&&(i6.u37.p222==1))) U ((i0.u0.p155==1)&&(i4.u25.p156==1))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 348/348 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 251 transition count 348
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 27 place count 230 transition count 327
Iterating global reduction 1 with 21 rules applied. Total rules applied 48 place count 230 transition count 327
Applied a total of 48 rules in 11 ms. Remains 230 /257 variables (removed 27) and now considering 327/348 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9789606743762718232.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10922112427283096059.kers'
[2026-05-25 23:05:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9789606743762718232.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10922112427283096059.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 327 rows 230 cols 1082 entries
Finished phase 1 with 173 SingleSign rule and 0 generalized
[2026-05-25 23:05:48] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10922112427283096059.kers
Total runtime 1 ms.
[2026-05-25 23:05:48] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-25 23:05:48] [INFO ] Invariant cache hit.
[2026-05-25 23:05:48] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 326 sub problems to find dead transitions.
[2026-05-25 23:05:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (OVERLAPS) 327/557 variables, 230/287 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (OVERLAPS) 0/557 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 287 constraints, problems are : Problem set: 0 solved, 326 unsolved in 18056 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 326 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (OVERLAPS) 327/557 variables, 230/287 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 326/613 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (OVERLAPS) 0/557 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 613 constraints, problems are : Problem set: 0 solved, 326 unsolved in 24230 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42310ms problems are : Problem set: 0 solved, 326 unsolved
Search for dead transitions found 0 dead transitions in 42312ms
Starting structural reductions in LTL mode, iteration 1 : 230/257 places, 327/348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42601 ms. Remains : 230/257 places, 327/348 transitions.
[2026-05-25 23:06:31] [INFO ] Flatten gal took : 5 ms
[2026-05-25 23:06:31] [INFO ] Flatten gal took : 4 ms
[2026-05-25 23:06:31] [INFO ] Input system was already deterministic with 327 transitions.
[2026-05-25 23:06:31] [INFO ] Flatten gal took : 5 ms
[2026-05-25 23:06:31] [INFO ] Flatten gal took : 5 ms
[2026-05-25 23:06:31] [INFO ] Time to serialize gal into /tmp/CTLFireability7920812316870778529.gal : 1 ms
[2026-05-25 23:06:31] [INFO ] Time to serialize properties into /tmp/CTLFireability9242692980925076756.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/CTLFireability7920812316870778529.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9242692980925076756.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,1.91483e+33,0.402735,18928,2,630,5,74376,6,0,1249,83856,0
Converting to forward existential form...Done !
original formula: !(E(EX(((p135==1)&&(p200==1))) U EF(((p174==1)&&(p289==1)))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,EX(((p135==1)&&(p200==1)))),TRUE) * ((p174==1)&&(p289==1)))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.898263,27328,1,0,9,122447,16,2,6440,92584,10
FORMULA NoC3x3-PT-4A-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 348/348 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 251 transition count 348
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 26 place count 231 transition count 328
Iterating global reduction 1 with 20 rules applied. Total rules applied 46 place count 231 transition count 328
Applied a total of 46 rules in 5 ms. Remains 231 /257 variables (removed 26) and now considering 328/348 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15035156417176685300.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4791218512230814133.kers'
[2026-05-25 23:06:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15035156417176685300.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4791218512230814133.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 328 rows 231 cols 1086 entries
Finished phase 1 with 174 SingleSign rule and 0 generalized
[2026-05-25 23:06:32] [INFO ] Computed 57 invariants in 3 ms
Computed 57 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-4791218512230814133.kers
Total runtime 6 ms.
[2026-05-25 23:06:32] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-25 23:06:32] [INFO ] Invariant cache hit.
[2026-05-25 23:06:32] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 327 sub problems to find dead transitions.
[2026-05-25 23:06:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (OVERLAPS) 328/559 variables, 231/288 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (OVERLAPS) 0/559 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 288 constraints, problems are : Problem set: 0 solved, 327 unsolved in 17728 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 327 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (OVERLAPS) 328/559 variables, 231/288 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 327/615 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (OVERLAPS) 0/559 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Int declared 559/559 variables, and 615 constraints, problems are : Problem set: 0 solved, 327 unsolved in 24514 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42269ms problems are : Problem set: 0 solved, 327 unsolved
Search for dead transitions found 0 dead transitions in 42270ms
Starting structural reductions in LTL mode, iteration 1 : 231/257 places, 328/348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42543 ms. Remains : 231/257 places, 328/348 transitions.
[2026-05-25 23:07:14] [INFO ] Flatten gal took : 8 ms
[2026-05-25 23:07:14] [INFO ] Flatten gal took : 5 ms
[2026-05-25 23:07:14] [INFO ] Input system was already deterministic with 328 transitions.
[2026-05-25 23:07:14] [INFO ] Flatten gal took : 5 ms
[2026-05-25 23:07:14] [INFO ] Flatten gal took : 5 ms
[2026-05-25 23:07:14] [INFO ] Time to serialize gal into /tmp/CTLFireability13531357497939262164.gal : 2 ms
[2026-05-25 23:07:14] [INFO ] Time to serialize properties into /tmp/CTLFireability12006367339341829494.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/CTLFireability13531357497939262164.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12006367339341829494.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,2.12759e+33,0.439821,19628,2,633,5,78056,6,0,1254,87985,0
Converting to forward existential form...Done !
original formula: EF((AF((!(A(((p125==1)&&(p165==1)) U ((p207==1)&&(p226==1)))) + EG((p222==0)))) * AG(((!(A((p257==1) U ((p49==1)&&(p149==1)))) * (((p95==...267
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!((!(!((E(!(((p207==1)&&(p226==1))) U (!(((p125==1)&&(p165==1))) * !(((p207==1)&&(p226...481
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 318/0/10
Detected timeout of ITS tools.
[2026-05-25 23:07:44] [INFO ] Flatten gal took : 9 ms
[2026-05-25 23:07:44] [INFO ] Applying decomposition
[2026-05-25 23:07:44] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5971993936176730366.txt' '-o' '/tmp/graph5971993936176730366.bin' '-w' '/tmp/graph5971993936176730366.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5971993936176730366.bin' '-l' '-1' '-v' '-w' '/tmp/graph5971993936176730366.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:07:44] [INFO ] Decomposing Gal with order
[2026-05-25 23:07:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:07:44] [INFO ] Removed a total of 83 redundant transitions.
[2026-05-25 23:07:44] [INFO ] Flatten gal took : 22 ms
[2026-05-25 23:07:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 5 ms.
[2026-05-25 23:07:44] [INFO ] Time to serialize gal into /tmp/CTLFireability17189687083741492844.gal : 3 ms
[2026-05-25 23:07:44] [INFO ] Time to serialize properties into /tmp/CTLFireability10501015487803354873.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/CTLFireability17189687083741492844.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10501015487803354873.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.12759e+33,0.124206,8932,136,40,11064,613,558,12829,76,2845,0
Converting to forward existential form...Done !
original formula: EF((AF((!(A(((i6.u23.p125==1)&&(i6.u29.p165==1)) U ((i8.u37.p207==1)&&(i8.u40.p226==1)))) + EG((i8.u39.p222==0)))) * AG(((!(A((i9.u45.p25...378
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!((!(!((E(!(((i8.u37.p207==1)&&(i8.u40.p226==1))) U (!(((i6.u23.p125==1)&&(i6.u29.p165...646
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 348/348 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 254 transition count 348
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 233 transition count 327
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 233 transition count 327
Applied a total of 45 rules in 4 ms. Remains 233 /257 variables (removed 24) and now considering 327/348 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1314855791918378455.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1082860654830437924.kers'
[2026-05-25 23:08:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1314855791918378455.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1082860654830437924.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 327 rows 230 cols 1082 entries
Finished phase 1 with 173 SingleSign rule and 0 generalized
[2026-05-25 23:08:14] [INFO ] Computed 60 invariants in 4 ms
Computed 60 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1082860654830437924.kers
Total runtime 5 ms.
[2026-05-25 23:08:14] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-25 23:08:14] [INFO ] Invariant cache hit.
[2026-05-25 23:08:15] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 326 sub problems to find dead transitions.
[2026-05-25 23:08:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (OVERLAPS) 3/233 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (OVERLAPS) 327/560 variables, 233/293 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/560 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 7 (OVERLAPS) 0/560 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Real declared 560/560 variables, and 293 constraints, problems are : Problem set: 0 solved, 326 unsolved in 21228 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 326 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (OVERLAPS) 3/233 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (OVERLAPS) 327/560 variables, 233/293 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/560 variables, 326/619 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/560 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 8 (OVERLAPS) 0/560 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Int declared 560/560 variables, and 619 constraints, problems are : Problem set: 0 solved, 326 unsolved in 26545 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47808ms problems are : Problem set: 0 solved, 326 unsolved
Search for dead transitions found 0 dead transitions in 47809ms
Starting structural reductions in LTL mode, iteration 1 : 233/257 places, 327/348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48097 ms. Remains : 233/257 places, 327/348 transitions.
[2026-05-25 23:09:02] [INFO ] Flatten gal took : 5 ms
[2026-05-25 23:09:02] [INFO ] Flatten gal took : 5 ms
[2026-05-25 23:09:02] [INFO ] Input system was already deterministic with 327 transitions.
[2026-05-25 23:09:02] [INFO ] Flatten gal took : 5 ms
[2026-05-25 23:09:03] [INFO ] Flatten gal took : 5 ms
[2026-05-25 23:09:03] [INFO ] Time to serialize gal into /tmp/CTLFireability12996967800212145498.gal : 2 ms
[2026-05-25 23:09:03] [INFO ] Time to serialize properties into /tmp/CTLFireability8659789796712465521.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/CTLFireability12996967800212145498.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8659789796712465521.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.91483e+33,0.397319,19088,2,636,5,75086,6,0,1252,84945,0
Converting to forward existential form...Done !
original formula: (AX(((((p1==1)&&(p18==1))&&((p106==1)&&(p113==1))) * (EF((p264==0)) * (((((p178==0)||(p202==0))||(p17==1)) * E(AG((p290==1)) U (((p133==1...385
=> equivalent forward existential formula: ([(EY((Init * !(EX(!(E(TRUE U !(!(!((E(!(((p271==1)&&(p284==1))) U (!(((p212==1)&&(p262==1))) * !(((p271==1)&&(p...1243
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 320/0/7
Detected timeout of ITS tools.
[2026-05-25 23:09:33] [INFO ] Flatten gal took : 8 ms
[2026-05-25 23:09:33] [INFO ] Applying decomposition
[2026-05-25 23:09:33] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14852660106324171171.txt' '-o' '/tmp/graph14852660106324171171.bin' '-w' '/tmp/graph14852660106324171171.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14852660106324171171.bin' '-l' '-1' '-v' '-w' '/tmp/graph14852660106324171171.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:09:33] [INFO ] Decomposing Gal with order
[2026-05-25 23:09:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:09:33] [INFO ] Removed a total of 90 redundant transitions.
[2026-05-25 23:09:33] [INFO ] Flatten gal took : 11 ms
[2026-05-25 23:09:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2026-05-25 23:09:33] [INFO ] Time to serialize gal into /tmp/CTLFireability2165368445902662887.gal : 2 ms
[2026-05-25 23:09:33] [INFO ] Time to serialize properties into /tmp/CTLFireability8558689274789221335.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/CTLFireability2165368445902662887.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8558689274789221335.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.91483e+33,0.09933,8180,128,40,8545,570,519,11031,70,2985,0
Converting to forward existential form...Done !
original formula: (AX(((((i0.i0.u1.p1==1)&&(i0.i1.u4.p18==1))&&((i0.i0.u0.p106==1)&&(i3.u23.p113==1))) * (EF((i7.u50.p264==0)) * (((((i5.u34.p178==0)||(i5....589
=> equivalent forward existential formula: ([(EY((Init * !(EX(!(E(TRUE U !(!(!((E(!(((i8.u52.p271==1)&&(i8.u54.p284==1))) U (!(((i6.u44.p212==1)&&(i7.u49.p...1715
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 348/348 transitions.
Graph (trivial) has 134 edges and 257 vertex of which 72 / 257 are part of one of the 32 SCC in 0 ms
Free SCC test removed 40 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Graph (complete) has 746 edges and 217 vertex of which 211 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 202 transition count 240
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 59 place count 181 transition count 240
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 82 place count 158 transition count 217
Iterating global reduction 2 with 23 rules applied. Total rules applied 105 place count 158 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 2 with 25 rules applied. Total rules applied 130 place count 158 transition count 192
Applied a total of 130 rules in 22 ms. Remains 158 /257 variables (removed 99) and now considering 192/348 (removed 156) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4229465869690844530.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-984713116090181571.kers'
[2026-05-25 23:10:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4229465869690844530.kers, --Pflows, --basisKERS=/tmp/petrispot-output-984713116090181571.kers]
Normalized transition count is 191 out of 192 initially.
Culling duplicate invariants (modulo rational): removing 24 columns.
Culled 24 columns in 0 ms.
// Phase 1: matrix 191 rows 134 cols 450 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-25 23:10:03] [INFO ] Computed 49 invariants in 2 ms
Computed 49 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-984713116090181571.kers
Total runtime 2 ms.
[2026-05-25 23:10:03] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-25 23:10:03] [INFO ] Invariant cache hit.
[2026-05-25 23:10:03] [INFO ] State equation strengthened by 54 read => feed constraints.
[2026-05-25 23:10:03] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2026-05-25 23:10:03] [INFO ] Redundant transitions in 63 ms returned []
Running 166 sub problems to find dead transitions.
[2026-05-25 23:10:03] [INFO ] Invariant cache hit.
[2026-05-25 23:10:03] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 191/349 variables, 158/207 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 54/261 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 0/349 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/350 variables, and 261 constraints, problems are : Problem set: 0 solved, 166 unsolved in 7166 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 158/158 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 191/349 variables, 158/207 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 54/261 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 166/427 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (OVERLAPS) 0/349 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/350 variables, and 427 constraints, problems are : Problem set: 0 solved, 166 unsolved in 6738 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 158/158 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13936ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 13936ms
Starting structural reductions in SI_CTL mode, iteration 1 : 158/257 places, 192/348 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14279 ms. Remains : 158/257 places, 192/348 transitions.
[2026-05-25 23:10:17] [INFO ] Flatten gal took : 3 ms
[2026-05-25 23:10:17] [INFO ] Flatten gal took : 2 ms
[2026-05-25 23:10:17] [INFO ] Input system was already deterministic with 192 transitions.
[2026-05-25 23:10:17] [INFO ] Flatten gal took : 3 ms
[2026-05-25 23:10:17] [INFO ] Flatten gal took : 3 ms
[2026-05-25 23:10:17] [INFO ] Time to serialize gal into /tmp/CTLFireability3252504144355425656.gal : 1 ms
[2026-05-25 23:10:17] [INFO ] Time to serialize properties into /tmp/CTLFireability8392047302722978517.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/CTLFireability3252504144355425656.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8392047302722978517.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,1.42497e+23,0.096809,8412,2,982,5,24705,5,0,825,21248,0
Converting to forward existential form...Done !
original formula: !(A(!(EG(((p239==1)&&(p266==1)))) U !(AG((p261!=1)))))
=> equivalent forward existential formula: ([((FwdU(Init,!(!(!(E(TRUE U !((p261!=1))))))) * !(!(EG(((p239==1)&&(p266==1)))))) * !(E(TRUE U !((p261!=1)))))]...221
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2026-05-25 23:10:47] [INFO ] Flatten gal took : 4 ms
[2026-05-25 23:10:47] [INFO ] Applying decomposition
[2026-05-25 23:10:47] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16820819265804966647.txt' '-o' '/tmp/graph16820819265804966647.bin' '-w' '/tmp/graph16820819265804966647.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16820819265804966647.bin' '-l' '-1' '-v' '-w' '/tmp/graph16820819265804966647.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:10:47] [INFO ] Decomposing Gal with order
[2026-05-25 23:10:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:10:47] [INFO ] Removed a total of 28 redundant transitions.
[2026-05-25 23:10:47] [INFO ] Flatten gal took : 6 ms
[2026-05-25 23:10:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 23:10:47] [INFO ] Time to serialize gal into /tmp/CTLFireability8139421328876155060.gal : 3 ms
[2026-05-25 23:10:47] [INFO ] Time to serialize properties into /tmp/CTLFireability10490014971670801578.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/CTLFireability8139421328876155060.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10490014971670801578.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.42497e+23,0.060518,6252,108,51,4480,378,414,5066,67,1322,0
Converting to forward existential form...Done !
original formula: !(A(!(EG(((i7.u38.p239==1)&&(i7.u42.p266==1)))) U !(AG((i7.u40.p261!=1)))))
=> equivalent forward existential formula: ([((FwdU(Init,!(!(!(E(TRUE U !((i7.u40.p261!=1))))))) * !(!(EG(((i7.u38.p239==1)&&(i7.u42.p266==1)))))) * !(E(TR...256
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 348/348 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 251 transition count 348
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 26 place count 231 transition count 328
Iterating global reduction 1 with 20 rules applied. Total rules applied 46 place count 231 transition count 328
Applied a total of 46 rules in 4 ms. Remains 231 /257 variables (removed 26) and now considering 328/348 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15782966364740625173.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15139208982090405160.kers'
[2026-05-25 23:11:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15782966364740625173.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15139208982090405160.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 328 rows 231 cols 1086 entries
Finished phase 1 with 174 SingleSign rule and 0 generalized
[2026-05-25 23:11:17] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15139208982090405160.kers
Total runtime 1 ms.
[2026-05-25 23:11:17] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-25 23:11:17] [INFO ] Invariant cache hit.
[2026-05-25 23:11:18] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 327 sub problems to find dead transitions.
[2026-05-25 23:11:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (OVERLAPS) 328/559 variables, 231/288 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (OVERLAPS) 0/559 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 288 constraints, problems are : Problem set: 0 solved, 327 unsolved in 18389 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 327 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (OVERLAPS) 328/559 variables, 231/288 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 327/615 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (OVERLAPS) 0/559 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Int declared 559/559 variables, and 615 constraints, problems are : Problem set: 0 solved, 327 unsolved in 24837 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43253ms problems are : Problem set: 0 solved, 327 unsolved
Search for dead transitions found 0 dead transitions in 43254ms
Starting structural reductions in LTL mode, iteration 1 : 231/257 places, 328/348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43549 ms. Remains : 231/257 places, 328/348 transitions.
[2026-05-25 23:12:01] [INFO ] Flatten gal took : 8 ms
[2026-05-25 23:12:01] [INFO ] Flatten gal took : 5 ms
[2026-05-25 23:12:01] [INFO ] Input system was already deterministic with 328 transitions.
[2026-05-25 23:12:01] [INFO ] Flatten gal took : 5 ms
[2026-05-25 23:12:01] [INFO ] Flatten gal took : 9 ms
[2026-05-25 23:12:01] [INFO ] Time to serialize gal into /tmp/CTLFireability10400770175046285161.gal : 2 ms
[2026-05-25 23:12:01] [INFO ] Time to serialize properties into /tmp/CTLFireability5434426936905115729.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/CTLFireability10400770175046285161.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5434426936905115729.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,2.12759e+33,0.431387,21740,2,633,5,86357,6,0,1254,101544,0
Converting to forward existential form...Done !
original formula: A((E(AG(!(((p237==1)&&(p263==1)))) U AX(AX(((p8==1)&&(p17==1))))) * EG((p54==1))) U (!((((p275==1)&&(p290==1))||((p66==1)&&(p78==1)))) * ...431
=> equivalent forward existential formula: [((Init * !(EG(!((!((((p275==1)&&(p290==1))||((p66==1)&&(p78==1)))) * (EG((((((p131==1)&&(p200==1))||(((p134==1)...1509
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 321/0/7
Detected timeout of ITS tools.
[2026-05-25 23:12:31] [INFO ] Flatten gal took : 9 ms
[2026-05-25 23:12:31] [INFO ] Applying decomposition
[2026-05-25 23:12:31] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph139709810095770302.txt' '-o' '/tmp/graph139709810095770302.bin' '-w' '/tmp/graph139709810095770302.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph139709810095770302.bin' '-l' '-1' '-v' '-w' '/tmp/graph139709810095770302.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:12:31] [INFO ] Decomposing Gal with order
[2026-05-25 23:12:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:12:31] [INFO ] Removed a total of 81 redundant transitions.
[2026-05-25 23:12:31] [INFO ] Flatten gal took : 11 ms
[2026-05-25 23:12:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2026-05-25 23:12:31] [INFO ] Time to serialize gal into /tmp/CTLFireability8484586166438537211.gal : 2 ms
[2026-05-25 23:12:31] [INFO ] Time to serialize properties into /tmp/CTLFireability7592953252272483051.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/CTLFireability8484586166438537211.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7592953252272483051.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.12759e+33,0.105998,8540,143,86,9511,1223,567,11002,102,4095,0
Converting to forward existential form...Done !
original formula: A((E(AG(!(((i7.u41.p237==1)&&(i7.u46.p263==1)))) U AX(AX(((i0.i1.u1.p8==1)&&(i0.i1.u3.p17==1))))) * EG((i1.u10.p54==1))) U (!((((i8.u48.p...661
=> equivalent forward existential formula: [((Init * !(EG(!((!((((i8.u48.p275==1)&&(i8.u52.p290==1))||((i2.u12.p66==1)&&(i2.u14.p78==1)))) * (EG((((((i4.i0...2199
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2026-05-25 23:13:01] [INFO ] Flatten gal took : 6 ms
[2026-05-25 23:13:01] [INFO ] Flatten gal took : 5 ms
[2026-05-25 23:13:01] [INFO ] Applying decomposition
[2026-05-25 23:13:01] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5594797637575221583.txt' '-o' '/tmp/graph5594797637575221583.bin' '-w' '/tmp/graph5594797637575221583.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5594797637575221583.bin' '-l' '-1' '-v' '-w' '/tmp/graph5594797637575221583.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:13:01] [INFO ] Decomposing Gal with order
[2026-05-25 23:13:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:13:01] [INFO ] Removed a total of 75 redundant transitions.
[2026-05-25 23:13:01] [INFO ] Flatten gal took : 11 ms
[2026-05-25 23:13:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 2 ms.
[2026-05-25 23:13:01] [INFO ] Time to serialize gal into /tmp/CTLFireability193220628342943193.gal : 3 ms
[2026-05-25 23:13:01] [INFO ] Time to serialize properties into /tmp/CTLFireability2170721464124505407.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/CTLFireability193220628342943193.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2170721464124505407.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 12 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.08448e+34,0.520395,23672,324,204,43846,5031,833,57445,168,19465,0
Converting to forward existential form...Done !
original formula: EF(EG(A(EF(((i3.u3.p16==1)&&(i3.u3.p102==1))) U E((((i0.i0.u0.p194==1)&&(i4.u30.p198==1))&&(i5.u27.p169==1)) U (i4.u30.p198==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((E(!(E((((i0.i0.u0.p194==1)&&(i4.u30.p198==1))&&(i5.u27.p169==1)) U (i4.u30.p198==1))) U...394
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2026-05-25 23:40:42] [INFO ] Applying decomposition
[2026-05-25 23:40:42] [INFO ] Flatten gal took : 6 ms
[2026-05-25 23:40:42] [INFO ] Decomposing Gal with order
[2026-05-25 23:40:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:40:43] [INFO ] Removed a total of 117 redundant transitions.
[2026-05-25 23:40:43] [INFO ] Flatten gal took : 13 ms
[2026-05-25 23:40:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 9 ms.
[2026-05-25 23:40:43] [INFO ] Time to serialize gal into /tmp/CTLFireability12757869900395575819.gal : 2 ms
[2026-05-25 23:40:43] [INFO ] Time to serialize properties into /tmp/CTLFireability8217369815663120762.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/CTLFireability12757869900395575819.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8217369815663120762.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 12 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.08448e+34,0.186069,12788,144,19,19947,796,651,24007,87,4485,0
Converting to forward existential form...Done !
original formula: EF(EG(A(EF(((u4.p16==1)&&(u23.p102==1))) U E((((u42.p194==1)&&(u44.p198==1))&&(u38.p169==1)) U (u44.p198==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((E(!(E((((u42.p194==1)&&(u44.p198==1))&&(u38.p169==1)) U (u44.p198==1))) U (!(E(TRUE U (...347
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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="NoC3x3-PT-4A"
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 NoC3x3-PT-4A, 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 r194-tall-177969914000306"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-4A.tgz
mv NoC3x3-PT-4A 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 '
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 ;