About the Execution of ITS-Tools for NoC3x3-PT-3A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6936.052 | 3600000.00 | 3716316.00 | 28857.50 | FTFT?FTTFFFF?FFF | 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-177969914000290.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-3A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914000290
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 8.2K Mar 8 06:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Mar 8 06:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 8 06:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 8 06:33 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.5K Mar 16 08:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 16 08:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 16 08:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 16 08:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 8 06:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Mar 8 06:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 8 06:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 8 06:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 16 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:13 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 133K 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-3A-CTLFireability-2024-00
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2024-01
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2024-02
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2024-03
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2024-04
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2024-05
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2024-06
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2024-07
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2024-08
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2024-09
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2024-10
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2024-11
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2024-12
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2024-13
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2024-14
FORMULA_NAME NoC3x3-PT-3A-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1779746131020
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-3A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 21:55:32] [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 21:55:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 21:55:32] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2026-05-25 21:55:32] [INFO ] Transformed 370 places.
[2026-05-25 21:55:32] [INFO ] Transformed 450 transitions.
[2026-05-25 21:55:32] [INFO ] Found NUPN structural information;
[2026-05-25 21:55:32] [INFO ] Parsed PT model containing 370 places and 450 transitions and 1773 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Support contains 144 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 449/449 transitions.
Ensure Unique test removed 16 places
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 354 transition count 449
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 82 place count 288 transition count 377
Ensure Unique test removed 23 places
Iterating global reduction 1 with 89 rules applied. Total rules applied 171 place count 265 transition count 377
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 212 place count 265 transition count 336
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 236 place count 265 transition count 312
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 239 place count 262 transition count 312
Applied a total of 239 rules in 61 ms. Remains 262 /370 variables (removed 108) and now considering 312/449 (removed 137) transitions.
[2026-05-25 21:55:32] [INFO ] Flow matrix only has 287 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13352118140554157411.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13365153382451641909.kers'
[2026-05-25 21:55:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13352118140554157411.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13365153382451641909.kers]
Normalized transition count is 286 out of 287 initially.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 286 rows 254 cols 1024 entries
Finished phase 1 with 132 SingleSign rule and 45 generalized
[2026-05-25 21:55:32] [INFO ] Computed 85 invariants in 1 ms
Computed 85 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13365153382451641909.kers
Total runtime 2 ms.
[2026-05-25 21:55:32] [INFO ] Implicit Places using invariants in 305 ms returned []
[2026-05-25 21:55:32] [INFO ] Flow matrix only has 287 transitions (discarded 25 similar events)
[2026-05-25 21:55:32] [INFO ] Invariant cache hit.
[2026-05-25 21:55:33] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 21:55:33] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2026-05-25 21:55:33] [INFO ] Flow matrix only has 287 transitions (discarded 25 similar events)
[2026-05-25 21:55:33] [INFO ] Invariant cache hit.
[2026-05-25 21:55:33] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (OVERLAPS) 1/256 variables, 58/78 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (OVERLAPS) 6/262 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (OVERLAPS) 286/548 variables, 262/347 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 11/358 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 10 (OVERLAPS) 1/549 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/549 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 12 (OVERLAPS) 0/549 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Real declared 549/549 variables, and 359 constraints, problems are : Problem set: 0 solved, 311 unsolved in 24951 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 262/262 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (OVERLAPS) 1/256 variables, 58/78 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (OVERLAPS) 6/262 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (OVERLAPS) 286/548 variables, 262/347 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 11/358 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 311/669 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/548 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 11 (OVERLAPS) 1/549 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 670 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 262/262 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55106ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 55118ms
Starting structural reductions in LTL mode, iteration 1 : 262/370 places, 312/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55782 ms. Remains : 262/370 places, 312/449 transitions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 312/312 transitions.
Applied a total of 0 rules in 5 ms. Remains 262 /262 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2026-05-25 21:56:28] [INFO ] Flow matrix only has 287 transitions (discarded 25 similar events)
[2026-05-25 21:56:28] [INFO ] Invariant cache hit.
[2026-05-25 21:56:28] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-25 21:56:28] [INFO ] Flow matrix only has 287 transitions (discarded 25 similar events)
[2026-05-25 21:56:28] [INFO ] Invariant cache hit.
[2026-05-25 21:56:28] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 21:56:28] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 321 ms. Remains : 262/262 places, 312/312 transitions.
Support contains 144 out of 262 places after structural reductions.
[2026-05-25 21:56:28] [INFO ] Flatten gal took : 52 ms
[2026-05-25 21:56:28] [INFO ] Flatten gal took : 28 ms
[2026-05-25 21:56:28] [INFO ] Input system was already deterministic with 312 transitions.
Support contains 142 out of 262 places (down from 144) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1402 ms. (28 steps per ms) remains 2/84 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/2 properties
[2026-05-25 21:56:29] [INFO ] Flow matrix only has 287 transitions (discarded 25 similar events)
[2026-05-25 21:56:29] [INFO ] Invariant cache hit.
[2026-05-25 21:56:29] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 200/225 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 37/262 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 286/548 variables, 262/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 11/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/548 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/549 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/549 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/549 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 549/549 variables, and 359 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1081 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 262/262 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 200/225 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 37/262 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 286/548 variables, 262/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 11/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/548 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/548 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/549 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/549 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/549 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 549/549 variables, and 360 constraints, problems are : Problem set: 0 solved, 1 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 262/262 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1367ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 6449 steps, including 73 resets, run visited all 1 properties in 29 ms. (steps per millisecond=222 )
Parikh walk visited 1 properties in 33 ms.
[2026-05-25 21:56:30] [INFO ] Flatten gal took : 17 ms
[2026-05-25 21:56:30] [INFO ] Flatten gal took : 17 ms
[2026-05-25 21:56:30] [INFO ] Input system was already deterministic with 312 transitions.
Computed a total of 7 stabilizing places and 1 stable transitions
Graph (complete) has 820 edges and 262 vertex of which 256 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.102 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 262/262 places, 312/312 transitions.
Graph (complete) has 820 edges and 262 vertex of which 257 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 255 transition count 274
Reduce places removed 38 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 42 rules applied. Total rules applied 81 place count 217 transition count 270
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 85 place count 213 transition count 270
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 133 place count 165 transition count 203
Ensure Unique test removed 20 places
Iterating global reduction 3 with 68 rules applied. Total rules applied 201 place count 145 transition count 203
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 3 with 47 rules applied. Total rules applied 248 place count 145 transition count 156
Reduce places removed 18 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 20 rules applied. Total rules applied 268 place count 127 transition count 154
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 270 place count 125 transition count 154
Applied a total of 270 rules in 32 ms. Remains 125 /262 variables (removed 137) and now considering 154/312 (removed 158) transitions.
[2026-05-25 21:56:31] [INFO ] Flow matrix only has 146 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3429145492943934599.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10712430805186837729.kers'
[2026-05-25 21:56:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3429145492943934599.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10712430805186837729.kers]
Normalized transition count is 145 out of 146 initially.
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 145 rows 115 cols 495 entries
Finished phase 1 with 67 SingleSign rule and 0 generalized
[2026-05-25 21:56:31] [INFO ] Computed 58 invariants in 0 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10712430805186837729.kers
Total runtime 1 ms.
[2026-05-25 21:56:31] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-25 21:56:31] [INFO ] Flow matrix only has 146 transitions (discarded 8 similar events)
[2026-05-25 21:56:31] [INFO ] Invariant cache hit.
[2026-05-25 21:56:31] [INFO ] State equation strengthened by 34 read => feed constraints.
[2026-05-25 21:56:32] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2026-05-25 21:56:32] [INFO ] Redundant transitions in 4 ms returned []
Running 153 sub problems to find dead transitions.
[2026-05-25 21:56:32] [INFO ] Flow matrix only has 146 transitions (discarded 8 similar events)
[2026-05-25 21:56:32] [INFO ] Invariant cache hit.
[2026-05-25 21:56:32] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 1/125 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 145/270 variables, 125/183 constraints. Problems are: Problem set: 0 solved, 153 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 33/216 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (OVERLAPS) 1/271 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 217 constraints, problems are : Problem set: 0 solved, 153 unsolved in 4522 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 125/125 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 1/125 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 145/270 variables, 125/183 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 33/216 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 153/369 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (OVERLAPS) 1/271 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 11 (OVERLAPS) 0/271 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 370 constraints, problems are : Problem set: 0 solved, 153 unsolved in 9378 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 125/125 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13919ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 13920ms
Starting structural reductions in SI_CTL mode, iteration 1 : 125/262 places, 154/312 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14155 ms. Remains : 125/262 places, 154/312 transitions.
[2026-05-25 21:56:45] [INFO ] Flatten gal took : 8 ms
[2026-05-25 21:56:45] [INFO ] Flatten gal took : 8 ms
[2026-05-25 21:56:45] [INFO ] Input system was already deterministic with 154 transitions.
[2026-05-25 21:56:46] [INFO ] Flatten gal took : 7 ms
[2026-05-25 21:56:46] [INFO ] Flatten gal took : 7 ms
[2026-05-25 21:56:46] [INFO ] Time to serialize gal into /tmp/CTLFireability8604919374716981011.gal : 4 ms
[2026-05-25 21:56:46] [INFO ] Time to serialize properties into /tmp/CTLFireability6268017084077306897.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/CTLFireability8604919374716981011.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6268017084077306897.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.1599e+17,0.118952,7064,2,316,5,15782,6,0,626,16444,0
Converting to forward existential form...Done !
original formula: (AG((((p237==0)||(p242==0))&&(p54==0))) * AF(((p346==0)||(p363==0))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !((((p237==0)||(p242==0))&&(p54==0))))] = FALSE * [FwdG(Init,!(((p346==0)||(p363==0))))] = ...161
(forward)formula 0,0,0.168604,7344,1,0,10,15782,21,3,3293,16444,7
FORMULA NoC3x3-PT-3A-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 312/312 transitions.
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 255 transition count 312
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 52 place count 210 transition count 248
Ensure Unique test removed 17 places
Iterating global reduction 1 with 62 rules applied. Total rules applied 114 place count 193 transition count 248
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 140 place count 193 transition count 222
Applied a total of 140 rules in 12 ms. Remains 193 /262 variables (removed 69) and now considering 222/312 (removed 90) transitions.
[2026-05-25 21:56:46] [INFO ] Flow matrix only has 214 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1236205972229505839.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12972471132204952680.kers'
[2026-05-25 21:56:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1236205972229505839.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12972471132204952680.kers]
Normalized transition count is 213 out of 214 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 213 rows 192 cols 706 entries
Finished phase 1 with 126 SingleSign rule and 6 generalized
[2026-05-25 21:56:46] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12972471132204952680.kers
Total runtime 1 ms.
[2026-05-25 21:56:46] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-25 21:56:46] [INFO ] Flow matrix only has 214 transitions (discarded 8 similar events)
[2026-05-25 21:56:46] [INFO ] Invariant cache hit.
[2026-05-25 21:56:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 21:56:46] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2026-05-25 21:56:46] [INFO ] Flow matrix only has 214 transitions (discarded 8 similar events)
[2026-05-25 21:56:46] [INFO ] Invariant cache hit.
[2026-05-25 21:56:46] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 57/60 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 1/193 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 213/406 variables, 193/254 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 9/263 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 1/407 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (OVERLAPS) 0/407 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 264 constraints, problems are : Problem set: 0 solved, 221 unsolved in 11851 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 193/193 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 57/60 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 1/193 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 213/406 variables, 193/254 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 9/263 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 221/484 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 1/407 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 12 (OVERLAPS) 0/407 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 485 constraints, problems are : Problem set: 0 solved, 221 unsolved in 23024 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 193/193 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34901ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 34904ms
Starting structural reductions in LTL mode, iteration 1 : 193/262 places, 222/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35170 ms. Remains : 193/262 places, 222/312 transitions.
[2026-05-25 21:57:21] [INFO ] Flatten gal took : 14 ms
[2026-05-25 21:57:21] [INFO ] Flatten gal took : 9 ms
[2026-05-25 21:57:21] [INFO ] Input system was already deterministic with 222 transitions.
[2026-05-25 21:57:21] [INFO ] Flatten gal took : 9 ms
[2026-05-25 21:57:21] [INFO ] Flatten gal took : 8 ms
[2026-05-25 21:57:21] [INFO ] Time to serialize gal into /tmp/CTLFireability783945576299482537.gal : 3 ms
[2026-05-25 21:57:21] [INFO ] Time to serialize properties into /tmp/CTLFireability14459073904160824422.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/CTLFireability783945576299482537.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14459073904160824422.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.06912e+23,0.538456,24776,2,1851,5,109761,6,0,984,105695,0
Converting to forward existential form...Done !
original formula: EF((EF((((p33==1)&&(p52==1))&&((p346==1)&&(p369==1)))) + E((EX(((p223==1)&&(p266==1))) + (((p168==1)&&(p176==1))&&((p145==1)&&(p193==1)))...238
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),TRUE) * (((p33==1)&&(p52==1))&&((p346==1)&&(p369==1))))] != FALSE + [FwdG((FwdU(FwdU(Ini...327
(forward)formula 0,1,0.573841,24876,1,0,6,109761,9,1,1802,105695,3
FORMULA NoC3x3-PT-3A-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 312/312 transitions.
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 256 transition count 312
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 45 place count 217 transition count 255
Ensure Unique test removed 14 places
Iterating global reduction 1 with 53 rules applied. Total rules applied 98 place count 203 transition count 255
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 121 place count 203 transition count 232
Applied a total of 121 rules in 7 ms. Remains 203 /262 variables (removed 59) and now considering 232/312 (removed 80) transitions.
[2026-05-25 21:57:22] [INFO ] Flow matrix only has 223 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14275818597074850320.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-820992200210671416.kers'
[2026-05-25 21:57:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14275818597074850320.kers, --Pflows, --basisKERS=/tmp/petrispot-output-820992200210671416.kers]
Normalized transition count is 222 out of 223 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 222 rows 201 cols 748 entries
Finished phase 1 with 126 SingleSign rule and 12 generalized
[2026-05-25 21:57:22] [INFO ] Computed 65 invariants in 0 ms
Computed 65 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-820992200210671416.kers
Total runtime 2 ms.
[2026-05-25 21:57:22] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-25 21:57:22] [INFO ] Flow matrix only has 223 transitions (discarded 9 similar events)
[2026-05-25 21:57:22] [INFO ] Invariant cache hit.
[2026-05-25 21:57:22] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 21:57:22] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2026-05-25 21:57:22] [INFO ] Flow matrix only has 223 transitions (discarded 9 similar events)
[2026-05-25 21:57:22] [INFO ] Invariant cache hit.
[2026-05-25 21:57:22] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/202 variables, 57/64 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 1/203 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (OVERLAPS) 222/425 variables, 203/268 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 9/277 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (OVERLAPS) 1/426 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 0/426 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 278 constraints, problems are : Problem set: 0 solved, 231 unsolved in 13880 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 203/203 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/202 variables, 57/64 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 1/203 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (OVERLAPS) 222/425 variables, 203/268 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 9/277 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 231/508 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (OVERLAPS) 1/426 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 12 (OVERLAPS) 0/426 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 509 constraints, problems are : Problem set: 0 solved, 231 unsolved in 27848 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 203/203 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41746ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 41746ms
Starting structural reductions in LTL mode, iteration 1 : 203/262 places, 232/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41992 ms. Remains : 203/262 places, 232/312 transitions.
[2026-05-25 21:58:04] [INFO ] Flatten gal took : 10 ms
[2026-05-25 21:58:04] [INFO ] Flatten gal took : 10 ms
[2026-05-25 21:58:04] [INFO ] Input system was already deterministic with 232 transitions.
[2026-05-25 21:58:04] [INFO ] Flatten gal took : 9 ms
[2026-05-25 21:58:04] [INFO ] Flatten gal took : 8 ms
[2026-05-25 21:58:04] [INFO ] Time to serialize gal into /tmp/CTLFireability2304867750765097341.gal : 2 ms
[2026-05-25 21:58:04] [INFO ] Time to serialize properties into /tmp/CTLFireability1569703693213739296.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/CTLFireability2304867750765097341.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1569703693213739296.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,3.46866e+23,0.562141,26020,2,1928,5,116007,6,0,1034,112085,0
Converting to forward existential form...Done !
original formula: A(!(((p39==1)&&(p80==1))) U (((p21==1) * (!(EF(((p28==1)&&(p61==1)))) + ((!(EF(((p231==1)&&(p364==1)))) * EX(((p230==1)&&(p242==1)))) * E...496
=> equivalent forward existential formula: [((Init * !(EG(!((((p21==1) * (!(E(TRUE U ((p28==1)&&(p61==1)))) + ((!(E(TRUE U ((p231==1)&&(p364==1)))) * EX(((...1525
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 228/2/4
Using saturation style SCC detection
(forward)formula 0,0,6.80963,250408,1,0,69,1.52827e+06,48,47,5440,1.41222e+06,64
FORMULA NoC3x3-PT-3A-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 312/312 transitions.
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 255 transition count 312
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 49 place count 213 transition count 253
Ensure Unique test removed 18 places
Iterating global reduction 1 with 60 rules applied. Total rules applied 109 place count 195 transition count 253
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 136 place count 195 transition count 226
Applied a total of 136 rules in 6 ms. Remains 195 /262 variables (removed 67) and now considering 226/312 (removed 86) transitions.
[2026-05-25 21:58:10] [INFO ] Flow matrix only has 216 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4091510449724599918.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12497823371246266781.kers'
[2026-05-25 21:58:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4091510449724599918.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12497823371246266781.kers]
Normalized transition count is 215 out of 216 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 215 rows 194 cols 712 entries
Finished phase 1 with 131 SingleSign rule and 4 generalized
[2026-05-25 21:58:10] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12497823371246266781.kers
Total runtime 2 ms.
[2026-05-25 21:58:11] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-25 21:58:11] [INFO ] Flow matrix only has 216 transitions (discarded 10 similar events)
[2026-05-25 21:58:11] [INFO ] Invariant cache hit.
[2026-05-25 21:58:11] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 21:58:11] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2026-05-25 21:58:11] [INFO ] Flow matrix only has 216 transitions (discarded 10 similar events)
[2026-05-25 21:58:11] [INFO ] Invariant cache hit.
[2026-05-25 21:58:11] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 1/194 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 1/195 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 215/410 variables, 195/255 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 9/264 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (OVERLAPS) 1/411 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 11 (OVERLAPS) 0/411 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 265 constraints, problems are : Problem set: 0 solved, 225 unsolved in 12707 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 195/195 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 1/194 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 1/195 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 215/410 variables, 195/255 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 9/264 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 225/489 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (OVERLAPS) 1/411 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 12 (OVERLAPS) 0/411 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 490 constraints, problems are : Problem set: 0 solved, 225 unsolved in 25013 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 195/195 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37736ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 37736ms
Starting structural reductions in LTL mode, iteration 1 : 195/262 places, 226/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37957 ms. Remains : 195/262 places, 226/312 transitions.
[2026-05-25 21:58:48] [INFO ] Flatten gal took : 8 ms
[2026-05-25 21:58:48] [INFO ] Flatten gal took : 7 ms
[2026-05-25 21:58:48] [INFO ] Input system was already deterministic with 226 transitions.
[2026-05-25 21:58:48] [INFO ] Flatten gal took : 6 ms
[2026-05-25 21:58:48] [INFO ] Flatten gal took : 7 ms
[2026-05-25 21:58:48] [INFO ] Time to serialize gal into /tmp/CTLFireability6924552551918088325.gal : 2 ms
[2026-05-25 21:58:48] [INFO ] Time to serialize properties into /tmp/CTLFireability4861380235085339893.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/CTLFireability6924552551918088325.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4861380235085339893.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.6302e+23,0.63645,25184,2,1636,5,112111,6,0,996,108552,0
Converting to forward existential form...Done !
original formula: !(A((E((p125==1) U EG(((p153==1)&&(p205==1)))) * !((EX(((p267==1)&&(p290==1))) + !(((((p71==1)&&(p84==1))||((p275==1)&&(p327==1)))||(((p3...357
=> equivalent forward existential formula: (([(EY((FwdU((FwdU(Init,!(!((E(!(!(EX(!(EG(((p278==1)&&(p282==1))))))) U (!(!((!(E(TRUE U ((p150==1)&&(p183==1))...1573
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 221/0/5
(forward)formula 0,1,2.80482,78060,1,0,24,467364,44,10,5280,293773,31
FORMULA NoC3x3-PT-3A-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 262/262 places, 312/312 transitions.
Graph (complete) has 820 edges and 262 vertex of which 256 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 254 transition count 277
Reduce places removed 35 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 41 rules applied. Total rules applied 77 place count 219 transition count 271
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 83 place count 213 transition count 271
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 130 place count 166 transition count 207
Ensure Unique test removed 20 places
Iterating global reduction 3 with 67 rules applied. Total rules applied 197 place count 146 transition count 207
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 46 rules applied. Total rules applied 243 place count 146 transition count 161
Reduce places removed 16 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 4 with 20 rules applied. Total rules applied 263 place count 130 transition count 157
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 267 place count 126 transition count 157
Applied a total of 267 rules in 20 ms. Remains 126 /262 variables (removed 136) and now considering 157/312 (removed 155) transitions.
[2026-05-25 21:58:51] [INFO ] Flow matrix only has 148 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17548396555784772414.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9673419426537603720.kers'
[2026-05-25 21:58:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17548396555784772414.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9673419426537603720.kers]
Normalized transition count is 147 out of 148 initially.
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 147 rows 117 cols 501 entries
Finished phase 1 with 69 SingleSign rule and 0 generalized
[2026-05-25 21:58:51] [INFO ] Computed 57 invariants in 0 ms
Computed 57 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9673419426537603720.kers
Total runtime 1 ms.
[2026-05-25 21:58:51] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-25 21:58:51] [INFO ] Flow matrix only has 148 transitions (discarded 9 similar events)
[2026-05-25 21:58:51] [INFO ] Invariant cache hit.
[2026-05-25 21:58:51] [INFO ] State equation strengthened by 34 read => feed constraints.
[2026-05-25 21:58:51] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2026-05-25 21:58:52] [INFO ] Redundant transitions in 5 ms returned []
Running 156 sub problems to find dead transitions.
[2026-05-25 21:58:52] [INFO ] Flow matrix only has 148 transitions (discarded 9 similar events)
[2026-05-25 21:58:52] [INFO ] Invariant cache hit.
[2026-05-25 21:58:52] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 147/273 variables, 126/183 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 33/216 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 156 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/274 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (OVERLAPS) 0/274 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 217 constraints, problems are : Problem set: 0 solved, 156 unsolved in 4243 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 126/126 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 147/273 variables, 126/183 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 33/216 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 156/372 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 1/274 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (OVERLAPS) 0/274 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 373 constraints, problems are : Problem set: 0 solved, 156 unsolved in 9386 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 126/126 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13648ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 13649ms
Starting structural reductions in SI_CTL mode, iteration 1 : 126/262 places, 157/312 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13861 ms. Remains : 126/262 places, 157/312 transitions.
[2026-05-25 21:59:05] [INFO ] Flatten gal took : 8 ms
[2026-05-25 21:59:05] [INFO ] Flatten gal took : 8 ms
[2026-05-25 21:59:05] [INFO ] Input system was already deterministic with 157 transitions.
[2026-05-25 21:59:05] [INFO ] Flatten gal took : 5 ms
[2026-05-25 21:59:05] [INFO ] Flatten gal took : 4 ms
[2026-05-25 21:59:05] [INFO ] Time to serialize gal into /tmp/CTLFireability8167386982776826705.gal : 1 ms
[2026-05-25 21:59:05] [INFO ] Time to serialize properties into /tmp/CTLFireability2239795221950573609.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/CTLFireability8167386982776826705.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2239795221950573609.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,6.23984e+17,0.080028,7532,2,324,5,17867,6,0,636,18599,0
Converting to forward existential form...Done !
original formula: AF(AG(!(A(!(E(((p150==1)&&(p183==1)) U ((p223==1)&&(p258==1)))) U ((p164==1)&&(p194==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(!((E(!(((p164==1)&&(p194==1))) U (!(!(E(((p150==1)&&(p183==1)) U ((p223==1)&&(p258==...240
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 147/9/10
Hit Full ! (commute/partial/dont) 148/0/9
Detected timeout of ITS tools.
[2026-05-25 21:59:35] [INFO ] Flatten gal took : 9 ms
[2026-05-25 21:59:35] [INFO ] Applying decomposition
[2026-05-25 21:59:35] [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/graph441991275925381788.txt' '-o' '/tmp/graph441991275925381788.bin' '-w' '/tmp/graph441991275925381788.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph441991275925381788.bin' '-l' '-1' '-v' '-w' '/tmp/graph441991275925381788.weights' '-q' '0' '-e' '0.001'
[2026-05-25 21:59:35] [INFO ] Decomposing Gal with order
[2026-05-25 21:59:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 21:59:35] [INFO ] Removed a total of 60 redundant transitions.
[2026-05-25 21:59:35] [INFO ] Flatten gal took : 61 ms
[2026-05-25 21:59:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 9 ms.
[2026-05-25 21:59:35] [INFO ] Time to serialize gal into /tmp/CTLFireability6354137537085171254.gal : 3 ms
[2026-05-25 21:59:35] [INFO ] Time to serialize properties into /tmp/CTLFireability6778056717465625443.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/CTLFireability6354137537085171254.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6778056717465625443.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,6.23984e+17,0.036418,5400,95,26,2186,200,388,2785,61,510,0
Converting to forward existential form...Done !
original formula: AF(AG(!(A(!(E(((i5.i1.u22.p150==1)&&(i7.u25.p183==1)) U ((i8.i0.u29.p223==1)&&(i8.i0.u33.p258==1)))) U ((i7.u25.p164==1)&&(i7.u26.p194==1...161
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(!((E(!(((i7.u25.p164==1)&&(i7.u26.p194==1))) U (!(!(E(((i5.i1.u22.p150==1)&&(i7.u25....319
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
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 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
Fast SCC detection found an SCC at level 11
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 312/312 transitions.
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 254 transition count 312
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 54 place count 208 transition count 249
Ensure Unique test removed 19 places
Iterating global reduction 1 with 65 rules applied. Total rules applied 119 place count 189 transition count 249
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 148 place count 189 transition count 220
Applied a total of 148 rules in 6 ms. Remains 189 /262 variables (removed 73) and now considering 220/312 (removed 92) transitions.
[2026-05-25 22:00:06] [INFO ] Flow matrix only has 211 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13013822409017340254.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3177350930252617124.kers'
[2026-05-25 22:00:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13013822409017340254.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3177350930252617124.kers]
Normalized transition count is 210 out of 211 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 210 rows 189 cols 690 entries
Finished phase 1 with 129 SingleSign rule and 2 generalized
[2026-05-25 22:00:06] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3177350930252617124.kers
Total runtime 1 ms.
[2026-05-25 22:00:06] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-25 22:00:06] [INFO ] Flow matrix only has 211 transitions (discarded 9 similar events)
[2026-05-25 22:00:06] [INFO ] Invariant cache hit.
[2026-05-25 22:00:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 22:00:06] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2026-05-25 22:00:06] [INFO ] Flow matrix only has 211 transitions (discarded 9 similar events)
[2026-05-25 22:00:06] [INFO ] Invariant cache hit.
[2026-05-25 22:00:06] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 210/399 variables, 189/247 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 9/256 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 0/400 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 257 constraints, problems are : Problem set: 0 solved, 219 unsolved in 10851 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 210/399 variables, 189/247 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 9/256 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 219/475 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 1/400 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (OVERLAPS) 0/400 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 476 constraints, problems are : Problem set: 0 solved, 219 unsolved in 21843 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32719ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 32719ms
Starting structural reductions in LTL mode, iteration 1 : 189/262 places, 220/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33040 ms. Remains : 189/262 places, 220/312 transitions.
[2026-05-25 22:00:39] [INFO ] Flatten gal took : 9 ms
[2026-05-25 22:00:39] [INFO ] Flatten gal took : 7 ms
[2026-05-25 22:00:39] [INFO ] Input system was already deterministic with 220 transitions.
[2026-05-25 22:00:39] [INFO ] Flatten gal took : 6 ms
[2026-05-25 22:00:39] [INFO ] Flatten gal took : 5 ms
[2026-05-25 22:00:39] [INFO ] Time to serialize gal into /tmp/CTLFireability18257756161112453519.gal : 1 ms
[2026-05-25 22:00:39] [INFO ] Time to serialize properties into /tmp/CTLFireability5705441122608120553.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/CTLFireability18257756161112453519.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5705441122608120553.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.1209e+23,0.476619,23004,2,1593,5,101738,6,0,969,97325,0
Converting to forward existential form...Done !
original formula: AG(((EG(((AX(AG(((p22==1)&&(p59==1)))) + (p166==0)) + (p194==0))) + AX(AG(AX((p54==1))))) + EX(((p236==1)&&(p260==1)))))
=> equivalent forward existential formula: [(EY(FwdU(EY(((FwdU(Init,TRUE) * !(EX(((p236==1)&&(p260==1))))) * !(EG(((!(EX(!(!(E(TRUE U !(((p22==1)&&(p59==1)...223
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,1.04422,34632,1,0,20,193888,28,7,5128,97325,18
FORMULA NoC3x3-PT-3A-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 262/262 places, 312/312 transitions.
Graph (complete) has 820 edges and 262 vertex of which 256 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 254 transition count 270
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 88 place count 210 transition count 268
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 88 place count 210 transition count 267
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 208 transition count 267
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 91 place count 208 transition count 266
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 93 place count 207 transition count 266
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 140 place count 160 transition count 200
Ensure Unique test removed 19 places
Iterating global reduction 2 with 66 rules applied. Total rules applied 206 place count 141 transition count 200
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 2 with 47 rules applied. Total rules applied 253 place count 141 transition count 153
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 35 rules applied. Total rules applied 288 place count 115 transition count 144
Applied a total of 288 rules in 25 ms. Remains 115 /262 variables (removed 147) and now considering 144/312 (removed 168) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12546816516657308775.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10446658376649317245.kers'
[2026-05-25 22:00:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12546816516657308775.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10446658376649317245.kers]
Normalized transition count is 143 out of 144 initially.
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 0 ms.
// Phase 1: matrix 143 rows 89 cols 349 entries
Finished phase 1 with 65 SingleSign rule and 2 generalized
[2026-05-25 22:00:40] [INFO ] Computed 48 invariants in 0 ms
Computed 48 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-10446658376649317245.kers
Total runtime 6 ms.
[2026-05-25 22:00:40] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-25 22:00:40] [INFO ] Invariant cache hit.
[2026-05-25 22:00:40] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 22:00:40] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2026-05-25 22:00:40] [INFO ] Redundant transitions in 76 ms returned [24, 30, 31, 42, 43, 54, 55, 56, 57, 58, 65, 66, 69, 79, 92, 93, 95, 99, 102, 103, 104, 110, 111, 112, 116, 126, 128, 131, 132, 133, 134, 140]
Found 32 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 32 transitions
Redundant transitions reduction (with SMT) removed 32 transitions.
Running 88 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16283027239358432659.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9954692219266015935.kers'
[2026-05-25 22:00:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16283027239358432659.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9954692219266015935.kers]
Normalized transition count is 111 out of 112 initially.
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 0 ms.
// Phase 1: matrix 111 rows 89 cols 265 entries
Finished phase 1 with 65 SingleSign rule and 2 generalized
[2026-05-25 22:00:40] [INFO ] Computed 48 invariants in 0 ms
Computed 48 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9954692219266015935.kers
Total runtime 0 ms.
[2026-05-25 22:00:40] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (OVERLAPS) 11/115 variables, 11/48 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 111/226 variables, 115/163 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 9/172 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 0/226 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/227 variables, and 172 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1682 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 115/115 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (OVERLAPS) 11/115 variables, 11/48 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 111/226 variables, 115/163 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 9/172 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 88/260 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 0/226 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 226/227 variables, and 260 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2461 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 115/115 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4171ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 4172ms
Starting structural reductions in SI_CTL mode, iteration 1 : 115/262 places, 112/312 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 115 transition count 101
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 33 rules applied. Total rules applied 33 place count 93 transition count 101
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 36 place count 93 transition count 98
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 48 edges and 87 vertex of which 16 / 87 are part of one of the 8 SCC in 2 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 10 rules applied. Total rules applied 46 place count 79 transition count 95
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 54 place count 79 transition count 87
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 84 place count 59 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 58 transition count 76
Graph (trivial) has 39 edges and 58 vertex of which 18 / 58 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 49 transition count 76
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 96 place count 49 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 114 place count 49 transition count 49
Applied a total of 114 rules in 23 ms. Remains 49 /115 variables (removed 66) and now considering 49/112 (removed 63) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10967176017489643534.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9279605062139225793.kers'
[2026-05-25 22:00:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10967176017489643534.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9279605062139225793.kers]
Normalized transition count is 48 out of 49 initially.
Culling duplicate invariants (modulo rational): removing 19 columns.
Culled 19 columns in 0 ms.
// Phase 1: matrix 48 rows 30 cols 97 entries
Finished phase 1 with 25 SingleSign rule and 0 generalized
[2026-05-25 22:00:44] [INFO ] Computed 24 invariants in 0 ms
Computed 24 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-9279605062139225793.kers
Total runtime 6 ms.
[2026-05-25 22:00:44] [INFO ] Implicit Places using invariants in 52 ms returned [21, 38]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 47/262 places, 49/312 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 4511 ms. Remains : 47/262 places, 49/312 transitions.
[2026-05-25 22:00:44] [INFO ] Flatten gal took : 1 ms
[2026-05-25 22:00:44] [INFO ] Flatten gal took : 1 ms
[2026-05-25 22:00:44] [INFO ] Input system was already deterministic with 49 transitions.
[2026-05-25 22:00:44] [INFO ] Flatten gal took : 1 ms
[2026-05-25 22:00:44] [INFO ] Flatten gal took : 2 ms
[2026-05-25 22:00:44] [INFO ] Time to serialize gal into /tmp/CTLFireability1866439691701746096.gal : 0 ms
[2026-05-25 22:00:44] [INFO ] Time to serialize properties into /tmp/CTLFireability12378061445792779636.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/CTLFireability1866439691701746096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12378061445792779636.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.07789e+06,0.00863,4164,2,79,5,873,5,0,238,813,0
Converting to forward existential form...Done !
original formula: EF(EG((((p225==1)&&(p239==1))&&((p147==1)&&(p201==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((p225==1)&&(p239==1))&&((p147==1)&&(p201==1))))] != FALSE
Hit Full ! (commute/partial/dont) 42/14/7
(forward)formula 0,1,0.01566,4460,1,0,6,2517,18,0,1162,813,8
FORMULA NoC3x3-PT-3A-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 312/312 transitions.
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 254 transition count 312
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 53 place count 209 transition count 249
Ensure Unique test removed 19 places
Iterating global reduction 1 with 64 rules applied. Total rules applied 117 place count 190 transition count 249
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 145 place count 190 transition count 221
Applied a total of 145 rules in 4 ms. Remains 190 /262 variables (removed 72) and now considering 221/312 (removed 91) transitions.
[2026-05-25 22:00:44] [INFO ] Flow matrix only has 212 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17092874096276400407.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2411018413730929730.kers'
[2026-05-25 22:00:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17092874096276400407.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2411018413730929730.kers]
Normalized transition count is 211 out of 212 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 211 rows 190 cols 694 entries
Finished phase 1 with 130 SingleSign rule and 2 generalized
[2026-05-25 22:00:44] [INFO ] Computed 58 invariants in 0 ms
Computed 58 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2411018413730929730.kers
Total runtime 2 ms.
[2026-05-25 22:00:44] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-25 22:00:44] [INFO ] Flow matrix only has 212 transitions (discarded 9 similar events)
[2026-05-25 22:00:44] [INFO ] Invariant cache hit.
[2026-05-25 22:00:44] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 22:00:44] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2026-05-25 22:00:44] [INFO ] Flow matrix only has 212 transitions (discarded 9 similar events)
[2026-05-25 22:00:44] [INFO ] Invariant cache hit.
[2026-05-25 22:00:44] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 211/401 variables, 190/248 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 9/257 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 1/402 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (OVERLAPS) 0/402 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 258 constraints, problems are : Problem set: 0 solved, 220 unsolved in 11250 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 190/190 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 211/401 variables, 190/248 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 9/257 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 220/477 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 1/402 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (OVERLAPS) 0/402 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/402 variables, and 478 constraints, problems are : Problem set: 0 solved, 220 unsolved in 20783 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 190/190 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32047ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 32048ms
Starting structural reductions in LTL mode, iteration 1 : 190/262 places, 221/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32270 ms. Remains : 190/262 places, 221/312 transitions.
[2026-05-25 22:01:17] [INFO ] Flatten gal took : 5 ms
[2026-05-25 22:01:17] [INFO ] Flatten gal took : 7 ms
[2026-05-25 22:01:17] [INFO ] Input system was already deterministic with 221 transitions.
[2026-05-25 22:01:17] [INFO ] Flatten gal took : 4 ms
[2026-05-25 22:01:17] [INFO ] Flatten gal took : 4 ms
[2026-05-25 22:01:17] [INFO ] Time to serialize gal into /tmp/CTLFireability166711687098389540.gal : 1 ms
[2026-05-25 22:01:17] [INFO ] Time to serialize properties into /tmp/CTLFireability4714401348734067443.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/CTLFireability166711687098389540.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4714401348734067443.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.37113e+23,0.442539,22524,2,1589,5,98470,6,0,974,94452,0
Converting to forward existential form...Done !
original formula: AF(((AX((((EF(((p307==0)||(p345==0))) + (p369==0)) + ((p150==0)||(p215==0))) + ((p98==0)||(p125==0)))) * AX(((p231==0)||(p364==0)))) * EG...181
=> equivalent forward existential formula: [FwdG(Init,!(((!(EX(!((((E(TRUE U ((p307==0)||(p345==0))) + (p369==0)) + ((p150==0)||(p215==0))) + ((p98==0)||(p...244
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.973952,33728,1,0,16,194363,32,8,4878,94452,15
FORMULA NoC3x3-PT-3A-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 312/312 transitions.
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 254 transition count 312
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 53 place count 209 transition count 252
Ensure Unique test removed 20 places
Iterating global reduction 1 with 65 rules applied. Total rules applied 118 place count 189 transition count 252
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 148 place count 189 transition count 222
Applied a total of 148 rules in 10 ms. Remains 189 /262 variables (removed 73) and now considering 222/312 (removed 90) transitions.
[2026-05-25 22:01:18] [INFO ] Flow matrix only has 211 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7885725455189968873.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3462616204680272728.kers'
[2026-05-25 22:01:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7885725455189968873.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3462616204680272728.kers]
Normalized transition count is 210 out of 211 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 210 rows 189 cols 688 entries
Finished phase 1 with 132 SingleSign rule and 0 generalized
[2026-05-25 22:01:18] [INFO ] Computed 57 invariants in 0 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3462616204680272728.kers
Total runtime 1 ms.
[2026-05-25 22:01:18] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-25 22:01:18] [INFO ] Flow matrix only has 211 transitions (discarded 11 similar events)
[2026-05-25 22:01:18] [INFO ] Invariant cache hit.
[2026-05-25 22:01:18] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 22:01:18] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2026-05-25 22:01:18] [INFO ] Flow matrix only has 211 transitions (discarded 11 similar events)
[2026-05-25 22:01:18] [INFO ] Invariant cache hit.
[2026-05-25 22:01:18] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 210/399 variables, 189/246 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 1/400 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 0/400 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 256 constraints, problems are : Problem set: 0 solved, 221 unsolved in 9507 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 189/189 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 210/399 variables, 189/246 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 221/476 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/400 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 477 constraints, problems are : Problem set: 0 solved, 221 unsolved in 21832 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 189/189 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31355ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 31356ms
Starting structural reductions in LTL mode, iteration 1 : 189/262 places, 222/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31580 ms. Remains : 189/262 places, 222/312 transitions.
[2026-05-25 22:01:49] [INFO ] Flatten gal took : 12 ms
[2026-05-25 22:01:49] [INFO ] Flatten gal took : 4 ms
[2026-05-25 22:01:49] [INFO ] Input system was already deterministic with 222 transitions.
[2026-05-25 22:01:49] [INFO ] Flatten gal took : 4 ms
[2026-05-25 22:01:49] [INFO ] Flatten gal took : 5 ms
[2026-05-25 22:01:49] [INFO ] Time to serialize gal into /tmp/CTLFireability617237910135051406.gal : 1 ms
[2026-05-25 22:01:49] [INFO ] Time to serialize properties into /tmp/CTLFireability11872391797575490991.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/CTLFireability617237910135051406.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11872391797575490991.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.55458e+23,0.497452,22028,2,1548,5,95356,6,0,971,91251,0
Converting to forward existential form...Done !
original formula: A((AG(EF((EG(((p90==1)&&(p125==1))) * AX(((p293==1)&&(p337==1)))))) * (!(EF(AX(((p150==1)&&(p176==1))))) + AF(((EF(((p9==1)&&(p14==1))) *...235
=> equivalent forward existential formula: [((Init * !(EG(!(((p141==1)&&(p176==1)))))) * !(E(!(((p141==1)&&(p176==1))) U (!((!(E(TRUE U !(E(TRUE U (EG(((p9...404
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 211/0/11
(forward)formula 0,0,1.35987,39828,1,0,18,234442,37,9,5107,99712,22
FORMULA NoC3x3-PT-3A-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 262/262 places, 312/312 transitions.
Graph (complete) has 820 edges and 262 vertex of which 257 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 255 transition count 283
Reduce places removed 29 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 42 rules applied. Total rules applied 72 place count 226 transition count 270
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 85 place count 213 transition count 270
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 130 place count 168 transition count 208
Ensure Unique test removed 19 places
Iterating global reduction 3 with 64 rules applied. Total rules applied 194 place count 149 transition count 208
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 42 rules applied. Total rules applied 236 place count 149 transition count 166
Reduce places removed 16 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 4 with 19 rules applied. Total rules applied 255 place count 133 transition count 163
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 258 place count 130 transition count 163
Applied a total of 258 rules in 18 ms. Remains 130 /262 variables (removed 132) and now considering 163/312 (removed 149) transitions.
[2026-05-25 22:01:51] [INFO ] Flow matrix only has 154 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6104054841332775376.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1944885429745336314.kers'
[2026-05-25 22:01:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6104054841332775376.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1944885429745336314.kers]
Normalized transition count is 153 out of 154 initially.
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 153 rows 120 cols 523 entries
Finished phase 1 with 69 SingleSign rule and 2 generalized
[2026-05-25 22:01:51] [INFO ] Computed 59 invariants in 1 ms
Computed 59 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1944885429745336314.kers
Total runtime 2 ms.
[2026-05-25 22:01:51] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-25 22:01:51] [INFO ] Flow matrix only has 154 transitions (discarded 9 similar events)
[2026-05-25 22:01:51] [INFO ] Invariant cache hit.
[2026-05-25 22:01:51] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-25 22:01:51] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2026-05-25 22:01:51] [INFO ] Redundant transitions in 1 ms returned []
Running 162 sub problems to find dead transitions.
[2026-05-25 22:01:51] [INFO ] Flow matrix only has 154 transitions (discarded 9 similar events)
[2026-05-25 22:01:51] [INFO ] Invariant cache hit.
[2026-05-25 22:01:51] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 1/130 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 153/283 variables, 130/189 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 34/223 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 162 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/284 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 11 (OVERLAPS) 0/284 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 224 constraints, problems are : Problem set: 0 solved, 162 unsolved in 5825 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 35/35 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/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 1/130 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 153/283 variables, 130/189 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 34/223 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 162/385 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (OVERLAPS) 1/284 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 12 (OVERLAPS) 0/284 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 386 constraints, problems are : Problem set: 0 solved, 162 unsolved in 10593 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16432ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 16433ms
Starting structural reductions in SI_CTL mode, iteration 1 : 130/262 places, 163/312 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16646 ms. Remains : 130/262 places, 163/312 transitions.
[2026-05-25 22:02:07] [INFO ] Flatten gal took : 3 ms
[2026-05-25 22:02:07] [INFO ] Flatten gal took : 3 ms
[2026-05-25 22:02:07] [INFO ] Input system was already deterministic with 163 transitions.
[2026-05-25 22:02:07] [INFO ] Flatten gal took : 3 ms
[2026-05-25 22:02:07] [INFO ] Flatten gal took : 3 ms
[2026-05-25 22:02:07] [INFO ] Time to serialize gal into /tmp/CTLFireability6284160460959068017.gal : 1 ms
[2026-05-25 22:02:07] [INFO ] Time to serialize properties into /tmp/CTLFireability10829075632142466051.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/CTLFireability6284160460959068017.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10829075632142466051.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.10931e+18,0.084789,7412,2,333,5,17035,6,0,655,17693,0
Converting to forward existential form...Done !
original formula: A(((AF(((p346==1)&&(p359==1))) * (p161==1)) * (p187==1)) U !(((AF(((EF(((p308==1)&&(p337==1))) + ((p132==1)&&(p183==1))) + ((p76==1)&&(p7...217
=> equivalent forward existential formula: [((Init * !(EG(!(!(((!(EG(!(((E(TRUE U ((p308==1)&&(p337==1))) + ((p132==1)&&(p183==1))) + ((p76==1)&&(p79==1)))...614
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,0.19634,10020,1,0,29,27548,38,16,3663,22348,23
FORMULA NoC3x3-PT-3A-CTLFireability-2024-09 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 : 262/262 places, 312/312 transitions.
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 254 transition count 312
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 49 place count 213 transition count 256
Ensure Unique test removed 17 places
Iterating global reduction 1 with 58 rules applied. Total rules applied 107 place count 196 transition count 256
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 132 place count 196 transition count 231
Applied a total of 132 rules in 4 ms. Remains 196 /262 variables (removed 66) and now considering 231/312 (removed 81) transitions.
[2026-05-25 22:02:07] [INFO ] Flow matrix only has 221 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10341410963331368664.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1267466987460207488.kers'
[2026-05-25 22:02:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10341410963331368664.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1267466987460207488.kers]
Normalized transition count is 220 out of 221 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 220 rows 196 cols 730 entries
Finished phase 1 with 130 SingleSign rule and 6 generalized
[2026-05-25 22:02:07] [INFO ] Computed 60 invariants in 0 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1267466987460207488.kers
Total runtime 1 ms.
[2026-05-25 22:02:07] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-25 22:02:07] [INFO ] Flow matrix only has 221 transitions (discarded 10 similar events)
[2026-05-25 22:02:07] [INFO ] Invariant cache hit.
[2026-05-25 22:02:08] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-25 22:02:08] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 230 sub problems to find dead transitions.
[2026-05-25 22:02:08] [INFO ] Flow matrix only has 221 transitions (discarded 10 similar events)
[2026-05-25 22:02:08] [INFO ] Invariant cache hit.
[2026-05-25 22:02:08] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (OVERLAPS) 1/196 variables, 57/60 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (OVERLAPS) 220/416 variables, 196/256 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 10/266 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (OVERLAPS) 1/417 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 9 (OVERLAPS) 0/417 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 267 constraints, problems are : Problem set: 0 solved, 230 unsolved in 12197 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 196/196 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (OVERLAPS) 1/196 variables, 57/60 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (OVERLAPS) 220/416 variables, 196/256 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 10/266 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 230/496 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 8 (OVERLAPS) 1/417 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 10 (OVERLAPS) 0/417 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 497 constraints, problems are : Problem set: 0 solved, 230 unsolved in 23467 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 196/196 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35681ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 35681ms
Starting structural reductions in LTL mode, iteration 1 : 196/262 places, 231/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35892 ms. Remains : 196/262 places, 231/312 transitions.
[2026-05-25 22:02:43] [INFO ] Flatten gal took : 8 ms
[2026-05-25 22:02:43] [INFO ] Flatten gal took : 4 ms
[2026-05-25 22:02:43] [INFO ] Input system was already deterministic with 231 transitions.
[2026-05-25 22:02:43] [INFO ] Flatten gal took : 3 ms
[2026-05-25 22:02:43] [INFO ] Flatten gal took : 4 ms
[2026-05-25 22:02:43] [INFO ] Time to serialize gal into /tmp/CTLFireability13396784753456999821.gal : 1 ms
[2026-05-25 22:02:43] [INFO ] Time to serialize properties into /tmp/CTLFireability15330704516851814509.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/CTLFireability13396784753456999821.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15330704516851814509.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.88212e+23,0.61129,28220,2,1699,5,126920,6,0,1008,123367,0
Converting to forward existential form...Done !
original formula: (AX((((p84==1)&&(p164==1))&&(p194==1))) + AG(E(!((((p24==1)&&(p56==1)) * (AG(((p230==1)&&(p248==1))) * (((p70==1)&&(p88==1))||((p33==1)&&...288
=> equivalent forward existential formula: [(FwdU((Init * !(!(EX(!((((p84==1)&&(p164==1))&&(p194==1))))))),TRUE) * !(E(!((((p24==1)&&(p56==1)) * (!(E(TRUE ...375
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,2.29944,74864,1,0,20,450357,38,7,5211,254484,23
FORMULA NoC3x3-PT-3A-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 312/312 transitions.
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 254 transition count 312
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 54 place count 208 transition count 249
Ensure Unique test removed 19 places
Iterating global reduction 1 with 65 rules applied. Total rules applied 119 place count 189 transition count 249
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 148 place count 189 transition count 220
Applied a total of 148 rules in 13 ms. Remains 189 /262 variables (removed 73) and now considering 220/312 (removed 92) transitions.
[2026-05-25 22:02:46] [INFO ] Flow matrix only has 211 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3420074871360998689.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2585553624700130811.kers'
[2026-05-25 22:02:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3420074871360998689.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2585553624700130811.kers]
Normalized transition count is 210 out of 211 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 210 rows 189 cols 690 entries
Finished phase 1 with 129 SingleSign rule and 2 generalized
[2026-05-25 22:02:46] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2585553624700130811.kers
Total runtime 1 ms.
[2026-05-25 22:02:46] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-25 22:02:46] [INFO ] Flow matrix only has 211 transitions (discarded 9 similar events)
[2026-05-25 22:02:46] [INFO ] Invariant cache hit.
[2026-05-25 22:02:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 22:02:46] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2026-05-25 22:02:46] [INFO ] Flow matrix only has 211 transitions (discarded 9 similar events)
[2026-05-25 22:02:46] [INFO ] Invariant cache hit.
[2026-05-25 22:02:46] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 210/399 variables, 189/247 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 9/256 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 0/400 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 257 constraints, problems are : Problem set: 0 solved, 219 unsolved in 11342 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 210/399 variables, 189/247 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 9/256 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 219/475 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 1/400 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (OVERLAPS) 0/400 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 476 constraints, problems are : Problem set: 0 solved, 219 unsolved in 21147 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32505ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 32506ms
Starting structural reductions in LTL mode, iteration 1 : 189/262 places, 220/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32743 ms. Remains : 189/262 places, 220/312 transitions.
[2026-05-25 22:03:18] [INFO ] Flatten gal took : 6 ms
[2026-05-25 22:03:18] [INFO ] Flatten gal took : 3 ms
[2026-05-25 22:03:18] [INFO ] Input system was already deterministic with 220 transitions.
[2026-05-25 22:03:18] [INFO ] Flatten gal took : 3 ms
[2026-05-25 22:03:18] [INFO ] Flatten gal took : 7 ms
[2026-05-25 22:03:18] [INFO ] Time to serialize gal into /tmp/CTLFireability1446323220188827758.gal : 1 ms
[2026-05-25 22:03:18] [INFO ] Time to serialize properties into /tmp/CTLFireability13212944961664719317.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/CTLFireability1446323220188827758.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13212944961664719317.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.05526e+23,0.453144,22680,2,1613,5,99352,6,0,969,95616,0
Converting to forward existential form...Done !
original formula: AX((AF(((p25==1)&&(p59==1))) + (AX((p21==0)) * (EG((((p141==0)||(p194==0))||((p216==0)||(p266==0)))) + E(((p297==1)&&(p332==1)) U (p194==...162
=> equivalent forward existential formula: ([(EY((EY(Init) * !(!(EG(!(((p25==1)&&(p59==1)))))))) * !((p21==0)))] = FALSE * [(((EY(Init) * !(!(EG(!(((p25==1...285
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 216/2/4
(forward)formula 0,0,0.997558,33888,1,0,19,197631,36,7,4872,95616,16
FORMULA NoC3x3-PT-3A-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 312/312 transitions.
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 254 transition count 312
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 55 place count 207 transition count 246
Ensure Unique test removed 19 places
Iterating global reduction 1 with 66 rules applied. Total rules applied 121 place count 188 transition count 246
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 149 place count 188 transition count 218
Applied a total of 149 rules in 4 ms. Remains 188 /262 variables (removed 74) and now considering 218/312 (removed 94) transitions.
[2026-05-25 22:03:19] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13253632362765797053.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5306561776551977442.kers'
[2026-05-25 22:03:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13253632362765797053.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5306561776551977442.kers]
Normalized transition count is 209 out of 210 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 209 rows 188 cols 686 entries
Finished phase 1 with 128 SingleSign rule and 2 generalized
[2026-05-25 22:03:19] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5306561776551977442.kers
Total runtime 2 ms.
[2026-05-25 22:03:20] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-25 22:03:20] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2026-05-25 22:03:20] [INFO ] Invariant cache hit.
[2026-05-25 22:03:20] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 22:03:20] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2026-05-25 22:03:20] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2026-05-25 22:03:20] [INFO ] Invariant cache hit.
[2026-05-25 22:03:20] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 209/397 variables, 188/246 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 1/398 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 0/398 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 256 constraints, problems are : Problem set: 0 solved, 217 unsolved in 10873 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 209/397 variables, 188/246 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 217/472 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/398 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/398 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 473 constraints, problems are : Problem set: 0 solved, 217 unsolved in 19864 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30751ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 30752ms
Starting structural reductions in LTL mode, iteration 1 : 188/262 places, 218/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30984 ms. Remains : 188/262 places, 218/312 transitions.
[2026-05-25 22:03:50] [INFO ] Flatten gal took : 5 ms
[2026-05-25 22:03:50] [INFO ] Flatten gal took : 3 ms
[2026-05-25 22:03:50] [INFO ] Input system was already deterministic with 218 transitions.
[2026-05-25 22:03:50] [INFO ] Flatten gal took : 4 ms
[2026-05-25 22:03:50] [INFO ] Flatten gal took : 3 ms
[2026-05-25 22:03:50] [INFO ] Time to serialize gal into /tmp/CTLFireability11289009909439829274.gal : 1 ms
[2026-05-25 22:03:50] [INFO ] Time to serialize properties into /tmp/CTLFireability4420602290173876573.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/CTLFireability11289009909439829274.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4420602290173876573.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.18925e+22,0.428015,21700,2,1601,5,93930,6,0,963,89888,0
Converting to forward existential form...Done !
original formula: EG(AF(((((p299==0)||(p343==0)) + (EX(((p230==1)&&(p266==1))) + (p99==0))) + ((p123==0)||((p216==1)&&(p258==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((((p299==0)||(p343==0)) + (EX(((p230==1)&&(p266==1))) + (p99==0))) + ((p123==0)||((p216==1)&&...181
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-25 22:04:21] [INFO ] Flatten gal took : 12 ms
[2026-05-25 22:04:21] [INFO ] Applying decomposition
[2026-05-25 22:04:21] [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/graph10279142449023683836.txt' '-o' '/tmp/graph10279142449023683836.bin' '-w' '/tmp/graph10279142449023683836.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10279142449023683836.bin' '-l' '-1' '-v' '-w' '/tmp/graph10279142449023683836.weights' '-q' '0' '-e' '0.001'
[2026-05-25 22:04:21] [INFO ] Decomposing Gal with order
[2026-05-25 22:04:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 22:04:21] [INFO ] Removed a total of 49 redundant transitions.
[2026-05-25 22:04:21] [INFO ] Flatten gal took : 19 ms
[2026-05-25 22:04:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2026-05-25 22:04:21] [INFO ] Time to serialize gal into /tmp/CTLFireability18104996209096757038.gal : 9 ms
[2026-05-25 22:04:21] [INFO ] Time to serialize properties into /tmp/CTLFireability67971766568376234.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/CTLFireability18104996209096757038.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability67971766568376234.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 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.18925e+22,0.198936,11860,402,53,18396,521,572,18972,77,2051,0
Converting to forward existential form...Done !
original formula: EG(AF(((((i7.u44.p299==0)||(i7.u44.p343==0)) + (EX(((i5.i1.u28.p230==1)&&(i5.i0.u33.p266==1))) + (i3.i1.u18.p99==0))) + ((i3.i1.u18.p123=...206
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((((i7.u44.p299==0)||(i7.u44.p343==0)) + (EX(((i5.i1.u28.p230==1)&&(i5.i0.u33.p266==1))) + (i3...255
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
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 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 : 262/262 places, 312/312 transitions.
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 255 transition count 312
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 50 place count 212 transition count 252
Ensure Unique test removed 18 places
Iterating global reduction 1 with 61 rules applied. Total rules applied 111 place count 194 transition count 252
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 138 place count 194 transition count 225
Applied a total of 138 rules in 11 ms. Remains 194 /262 variables (removed 68) and now considering 225/312 (removed 87) transitions.
[2026-05-25 22:04:51] [INFO ] Flow matrix only has 215 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11148524657211990852.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4371202570058233124.kers'
[2026-05-25 22:04:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11148524657211990852.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4371202570058233124.kers]
Normalized transition count is 214 out of 215 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 214 rows 193 cols 708 entries
Finished phase 1 with 130 SingleSign rule and 4 generalized
[2026-05-25 22:04:51] [INFO ] Computed 60 invariants in 0 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4371202570058233124.kers
Total runtime 1 ms.
[2026-05-25 22:04:51] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-25 22:04:51] [INFO ] Flow matrix only has 215 transitions (discarded 10 similar events)
[2026-05-25 22:04:51] [INFO ] Invariant cache hit.
[2026-05-25 22:04:51] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 22:04:51] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2026-05-25 22:04:51] [INFO ] Flow matrix only has 215 transitions (discarded 10 similar events)
[2026-05-25 22:04:51] [INFO ] Invariant cache hit.
[2026-05-25 22:04:51] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 1/194 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 214/408 variables, 194/254 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 9/263 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (OVERLAPS) 1/409 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 11 (OVERLAPS) 0/409 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 264 constraints, problems are : Problem set: 0 solved, 224 unsolved in 12154 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 194/194 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 1/194 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 214/408 variables, 194/254 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 9/263 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 224/487 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 10 (OVERLAPS) 1/409 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 12 (OVERLAPS) 0/409 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Int declared 409/409 variables, and 488 constraints, problems are : Problem set: 0 solved, 224 unsolved in 23057 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 194/194 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35225ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 35226ms
Starting structural reductions in LTL mode, iteration 1 : 194/262 places, 225/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35470 ms. Remains : 194/262 places, 225/312 transitions.
[2026-05-25 22:05:26] [INFO ] Flatten gal took : 4 ms
[2026-05-25 22:05:26] [INFO ] Flatten gal took : 4 ms
[2026-05-25 22:05:26] [INFO ] Input system was already deterministic with 225 transitions.
[2026-05-25 22:05:26] [INFO ] Flatten gal took : 3 ms
[2026-05-25 22:05:26] [INFO ] Flatten gal took : 4 ms
[2026-05-25 22:05:26] [INFO ] Time to serialize gal into /tmp/CTLFireability10001811912767969407.gal : 1 ms
[2026-05-25 22:05:26] [INFO ] Time to serialize properties into /tmp/CTLFireability3975010160587430669.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/CTLFireability10001811912767969407.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3975010160587430669.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.79135e+23,0.486068,23560,2,1801,5,104328,6,0,991,100133,0
Converting to forward existential form...Done !
original formula: AX((EG(((AG(((p147==0)||(p202==0))) + AF(((p293==0)||(p337==0)))) + EG(((p37==0)||(p80==0))))) * ((AG(((p237==0)||(p258==0))) + EG(((p8==...249
=> equivalent forward existential formula: ([(EY(Init) * !(EG(((!(E(TRUE U !(((p147==0)||(p202==0))))) + !(EG(!(((p293==0)||(p337==0)))))) + EG(((p37==0)||...353
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,1.56629,52956,1,0,14,289954,23,6,4983,141572,12
FORMULA NoC3x3-PT-3A-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 312/312 transitions.
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 255 transition count 312
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 52 place count 210 transition count 248
Ensure Unique test removed 17 places
Iterating global reduction 1 with 62 rules applied. Total rules applied 114 place count 193 transition count 248
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 140 place count 193 transition count 222
Applied a total of 140 rules in 7 ms. Remains 193 /262 variables (removed 69) and now considering 222/312 (removed 90) transitions.
[2026-05-25 22:05:28] [INFO ] Flow matrix only has 214 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18111450487538330909.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9488668188481029477.kers'
[2026-05-25 22:05:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18111450487538330909.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9488668188481029477.kers]
Normalized transition count is 213 out of 214 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 213 rows 192 cols 706 entries
Finished phase 1 with 126 SingleSign rule and 6 generalized
[2026-05-25 22:05:28] [INFO ] Computed 61 invariants in 3 ms
Computed 61 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-9488668188481029477.kers
Total runtime 9 ms.
[2026-05-25 22:05:28] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-25 22:05:28] [INFO ] Flow matrix only has 214 transitions (discarded 8 similar events)
[2026-05-25 22:05:28] [INFO ] Invariant cache hit.
[2026-05-25 22:05:28] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 22:05:28] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2026-05-25 22:05:28] [INFO ] Flow matrix only has 214 transitions (discarded 8 similar events)
[2026-05-25 22:05:28] [INFO ] Invariant cache hit.
[2026-05-25 22:05:28] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 57/60 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 1/193 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 213/406 variables, 193/254 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 9/263 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 1/407 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (OVERLAPS) 0/407 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 264 constraints, problems are : Problem set: 0 solved, 221 unsolved in 12560 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 193/193 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 57/60 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 1/193 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 213/406 variables, 193/254 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 9/263 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 221/484 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 1/407 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 12 (OVERLAPS) 0/407 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 485 constraints, problems are : Problem set: 0 solved, 221 unsolved in 22762 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 193/193 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35336ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 35336ms
Starting structural reductions in LTL mode, iteration 1 : 193/262 places, 222/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35569 ms. Remains : 193/262 places, 222/312 transitions.
[2026-05-25 22:06:03] [INFO ] Flatten gal took : 5 ms
[2026-05-25 22:06:03] [INFO ] Flatten gal took : 4 ms
[2026-05-25 22:06:03] [INFO ] Input system was already deterministic with 222 transitions.
[2026-05-25 22:06:03] [INFO ] Flatten gal took : 3 ms
[2026-05-25 22:06:03] [INFO ] Flatten gal took : 4 ms
[2026-05-25 22:06:03] [INFO ] Time to serialize gal into /tmp/CTLFireability17219417187937881723.gal : 1 ms
[2026-05-25 22:06:03] [INFO ] Time to serialize properties into /tmp/CTLFireability11111211752103856327.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/CTLFireability17219417187937881723.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11111211752103856327.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.08052e+23,0.428818,22468,2,1705,5,98837,6,0,984,94617,0
Converting to forward existential form...Done !
original formula: AG(((E(EF((((p194==1)&&(p92==1))&&(p116==1))) U (((p227==1)&&(p253==1)) * (EX((p79==1)) * AX(((p168==1)&&(p176==1)))))) + ((p311==1)&&(p3...190
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(((p223==1)&&(p266==1)))) * !(((p311==1)&&(p318==1)))) * !(E(E(TRUE U (((p194==1)&&(p92==...262
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.904041,32992,1,0,12,198226,22,5,4592,94617,9
FORMULA NoC3x3-PT-3A-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 312/312 transitions.
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 257 transition count 312
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 49 place count 213 transition count 249
Ensure Unique test removed 17 places
Iterating global reduction 1 with 61 rules applied. Total rules applied 110 place count 196 transition count 249
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 136 place count 196 transition count 223
Applied a total of 136 rules in 9 ms. Remains 196 /262 variables (removed 66) and now considering 223/312 (removed 89) transitions.
[2026-05-25 22:06:04] [INFO ] Flow matrix only has 215 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9188684484801070164.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16863449745088396816.kers'
[2026-05-25 22:06:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9188684484801070164.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16863449745088396816.kers]
Normalized transition count is 214 out of 215 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 214 rows 193 cols 710 entries
Finished phase 1 with 127 SingleSign rule and 6 generalized
[2026-05-25 22:06:04] [INFO ] Computed 63 invariants in 1 ms
Computed 63 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16863449745088396816.kers
Total runtime 1 ms.
[2026-05-25 22:06:04] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-25 22:06:04] [INFO ] Flow matrix only has 215 transitions (discarded 8 similar events)
[2026-05-25 22:06:04] [INFO ] Invariant cache hit.
[2026-05-25 22:06:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 22:06:05] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2026-05-25 22:06:05] [INFO ] Flow matrix only has 215 transitions (discarded 8 similar events)
[2026-05-25 22:06:05] [INFO ] Invariant cache hit.
[2026-05-25 22:06:05] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 57/60 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 3/196 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 214/410 variables, 196/259 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 9/268 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (OVERLAPS) 1/411 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 11 (OVERLAPS) 0/411 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 269 constraints, problems are : Problem set: 0 solved, 222 unsolved in 12807 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 196/196 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 57/60 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 3/196 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 214/410 variables, 196/259 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 9/268 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 222/490 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (OVERLAPS) 1/411 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 12 (OVERLAPS) 0/411 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 491 constraints, problems are : Problem set: 0 solved, 222 unsolved in 24208 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 196/196 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37036ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 37038ms
Starting structural reductions in LTL mode, iteration 1 : 196/262 places, 223/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37241 ms. Remains : 196/262 places, 223/312 transitions.
[2026-05-25 22:06:42] [INFO ] Flatten gal took : 6 ms
[2026-05-25 22:06:42] [INFO ] Flatten gal took : 4 ms
[2026-05-25 22:06:42] [INFO ] Input system was already deterministic with 223 transitions.
[2026-05-25 22:06:42] [INFO ] Flatten gal took : 4 ms
[2026-05-25 22:06:42] [INFO ] Flatten gal took : 3 ms
[2026-05-25 22:06:42] [INFO ] Time to serialize gal into /tmp/CTLFireability1587188485181919508.gal : 1 ms
[2026-05-25 22:06:42] [INFO ] Time to serialize properties into /tmp/CTLFireability15899908101568839562.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/CTLFireability1587188485181919508.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15899908101568839562.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.37049e+23,0.532846,24820,2,1735,5,109207,6,0,991,106474,0
Converting to forward existential form...Done !
original formula: EF((((!(E((((p316==1)&&(p337==1))||((p309==1)&&(p328==1))) U EX(((p43==1)&&(p47==1))))) * AG((!(A(((p279==1)&&(p291==1)) U ((p43==1)&&(p4...459
=> equivalent forward existential formula: (([(EY((FwdU(Init,TRUE) * ((!(E((((p316==1)&&(p337==1))||((p309==1)&&(p328==1))) U EX(((p43==1)&&(p47==1))))) * ...1586
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.990722,32268,1,0,14,179143,32,1,5012,106474,14
FORMULA NoC3x3-PT-3A-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2026-05-25 22:06:43] [INFO ] Flatten gal took : 5 ms
[2026-05-25 22:06:43] [INFO ] Flatten gal took : 5 ms
[2026-05-25 22:06:43] [INFO ] Applying decomposition
[2026-05-25 22:06:43] [INFO ] Flatten gal took : 11 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/graph16805256595252116957.txt' '-o' '/tmp/graph16805256595252116957.bin' '-w' '/tmp/graph16805256595252116957.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16805256595252116957.bin' '-l' '-1' '-v' '-w' '/tmp/graph16805256595252116957.weights' '-q' '0' '-e' '0.001'
[2026-05-25 22:06:43] [INFO ] Decomposing Gal with order
[2026-05-25 22:06:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 22:06:43] [INFO ] Removed a total of 105 redundant transitions.
[2026-05-25 22:06:43] [INFO ] Flatten gal took : 13 ms
[2026-05-25 22:06:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 10 ms.
[2026-05-25 22:06:43] [INFO ] Time to serialize gal into /tmp/CTLFireability274259874016735677.gal : 3 ms
[2026-05-25 22:06:43] [INFO ] Time to serialize properties into /tmp/CTLFireability17076764860176862992.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/CTLFireability274259874016735677.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17076764860176862992.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 2 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.31032e+26,0.713257,31844,658,231,54316,3950,881,115562,251,16514,0
Converting to forward existential form...Done !
original formula: AF(AG(!(A(!(E(((i5.i0.u20.p150==1)&&(i4.i0.u23.p183==1)) U ((i6.i1.u29.p223==1)&&(i6.i1.u32.p258==1)))) U ((u24.p164==1)&&(u24.p194==1)))...158
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(!((E(!(((u24.p164==1)&&(u24.p194==1))) U (!(!(E(((i5.i0.u20.p150==1)&&(i4.i0.u23.p18...304
Reverse transition relation is NOT exact ! Due to transitions i8.t295, i8.t293, i8.u44.t5, i8.u44.t52, i8.u45.t3, Intersection with reachable at each step...213
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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.
[2026-05-25 22:30:26] [INFO ] Applying decomposition
[2026-05-25 22:30:26] [INFO ] Flatten gal took : 8 ms
[2026-05-25 22:30:26] [INFO ] Decomposing Gal with order
[2026-05-25 22:30:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 22:30:26] [INFO ] Removed a total of 136 redundant transitions.
[2026-05-25 22:30:26] [INFO ] Flatten gal took : 15 ms
[2026-05-25 22:30:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 165 labels/synchronizations in 5 ms.
[2026-05-25 22:30:26] [INFO ] Time to serialize gal into /tmp/CTLFireability2503053601784735239.gal : 2 ms
[2026-05-25 22:30:26] [INFO ] Time to serialize properties into /tmp/CTLFireability1532223819487231789.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/CTLFireability2503053601784735239.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1532223819487231789.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 2 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.31032e+26,0.661957,33692,923,97,71458,588,715,81193,121,2187,0
Converting to forward existential form...Done !
original formula: AF(AG(!(A(!(E(((u31.p150==1)&&(u35.p183==1)) U ((u40.p223==1)&&(u45.p258==1)))) U ((u32.p164==1)&&(u36.p194==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(!((E(!(((u32.p164==1)&&(u36.p194==1))) U (!(!(E(((u31.p150==1)&&(u35.p183==1)) U ((u...280
Reverse transition relation is NOT exact ! Due to transitions t295, t300, u59.t5, u59.t52, u64.t3, Intersection with reachable at each step enabled. (dest...198
Fast SCC detection found a local SCC at level 2
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
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
Fast SCC detection found an SCC at level 50
Fast SCC detection found an SCC at level 51
Fast SCC detection found an SCC at level 52
Fast SCC detection found an SCC at level 53
Fast SCC detection found an SCC at level 54
Fast SCC detection found an SCC at level 55
Fast SCC detection found an SCC at level 56
Fast SCC detection found an SCC at level 57
Fast SCC detection found an SCC at level 58
Fast SCC detection found an SCC at level 59
Fast SCC detection found an SCC at level 60
Fast SCC detection found an SCC at level 61
Fast SCC detection found an SCC at level 62
Fast SCC detection found an SCC at level 63
Detected timeout of ITS tools.
[2026-05-25 22:54:09] [INFO ] Flatten gal took : 8 ms
[2026-05-25 22:54:09] [INFO ] Input system was already deterministic with 312 transitions.
[2026-05-25 22:54:09] [INFO ] Transformed 262 places.
[2026-05-25 22:54:09] [INFO ] Transformed 312 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-25 22:54:10] [INFO ] Time to serialize gal into /tmp/CTLFireability9021962503847169072.gal : 3 ms
[2026-05-25 22:54:10] [INFO ] Time to serialize properties into /tmp/CTLFireability6197944111580761175.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/CTLFireability9021962503847169072.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6197944111580761175.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 2 CTL formulae.
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-3A"
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-3A, 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-177969914000290"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-3A.tgz
mv NoC3x3-PT-3A 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 ;