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-177969914000274.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-2A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914000274
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 7.1K Mar 8 06:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Mar 8 06:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 8 06:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 8 06:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 16 08:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 16 08:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 16 08:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 16 08:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 8 06:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Mar 8 06:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Mar 8 06:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K 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 127K 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-2A-CTLFireability-2024-00
FORMULA_NAME NoC3x3-PT-2A-CTLFireability-2024-01
FORMULA_NAME NoC3x3-PT-2A-CTLFireability-2024-02
FORMULA_NAME NoC3x3-PT-2A-CTLFireability-2024-03
FORMULA_NAME NoC3x3-PT-2A-CTLFireability-2024-04
FORMULA_NAME NoC3x3-PT-2A-CTLFireability-2024-05
FORMULA_NAME NoC3x3-PT-2A-CTLFireability-2024-06
FORMULA_NAME NoC3x3-PT-2A-CTLFireability-2024-07
FORMULA_NAME NoC3x3-PT-2A-CTLFireability-2024-08
FORMULA_NAME NoC3x3-PT-2A-CTLFireability-2024-09
FORMULA_NAME NoC3x3-PT-2A-CTLFireability-2024-10
FORMULA_NAME NoC3x3-PT-2A-CTLFireability-2024-11
FORMULA_NAME NoC3x3-PT-2A-CTLFireability-2024-12
FORMULA_NAME NoC3x3-PT-2A-CTLFireability-2024-13
FORMULA_NAME NoC3x3-PT-2A-CTLFireability-2024-14
FORMULA_NAME NoC3x3-PT-2A-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779742740781

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-2A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 20:59:01] [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 20:59:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 20:59:02] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2026-05-25 20:59:02] [INFO ] Transformed 361 places.
[2026-05-25 20:59:02] [INFO ] Transformed 428 transitions.
[2026-05-25 20:59:02] [INFO ] Found NUPN structural information;
[2026-05-25 20:59:02] [INFO ] Parsed PT model containing 361 places and 428 transitions and 1697 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 164 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 428/428 transitions.
Ensure Unique test removed 17 places
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 344 transition count 428
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 71 place count 290 transition count 369
Ensure Unique test removed 14 places
Iterating global reduction 1 with 68 rules applied. Total rules applied 139 place count 276 transition count 369
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 168 place count 276 transition count 340
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 188 place count 276 transition count 320
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 190 place count 274 transition count 320
Applied a total of 190 rules in 61 ms. Remains 274 /361 variables (removed 87) and now considering 320/428 (removed 108) transitions.
[2026-05-25 20:59:02] [INFO ] Flow matrix only has 294 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4355266760641024741.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5567679896063891034.kers'
[2026-05-25 20:59:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4355266760641024741.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5567679896063891034.kers]
Normalized transition count is 293 out of 294 initially.
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 293 rows 260 cols 1060 entries
Finished phase 1 with 128 SingleSign rule and 52 generalized
[2026-05-25 20:59:02] [INFO ] Computed 94 invariants in 2 ms
Computed 94 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5567679896063891034.kers
Total runtime 3 ms.
[2026-05-25 20:59:02] [INFO ] Implicit Places using invariants in 283 ms returned [61, 210]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 314 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 272/361 places, 320/428 transitions.
Applied a total of 0 rules in 17 ms. Remains 272 /272 variables (removed 0) and now considering 320/320 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 406 ms. Remains : 272/361 places, 320/428 transitions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 320/320 transitions.
Applied a total of 0 rules in 6 ms. Remains 272 /272 variables (removed 0) and now considering 320/320 (removed 0) transitions.
[2026-05-25 20:59:02] [INFO ] Flow matrix only has 294 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14495474716327781124.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16073805087971102668.kers'
[2026-05-25 20:59:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14495474716327781124.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16073805087971102668.kers]
Normalized transition count is 293 out of 294 initially.
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 293 rows 260 cols 1060 entries
Finished phase 1 with 128 SingleSign rule and 52 generalized
[2026-05-25 20:59:02] [INFO ] Computed 92 invariants in 1 ms
Computed 92 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16073805087971102668.kers
Total runtime 4 ms.
[2026-05-25 20:59:02] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-25 20:59:02] [INFO ] Flow matrix only has 294 transitions (discarded 26 similar events)
[2026-05-25 20:59:02] [INFO ] Invariant cache hit.
[2026-05-25 20:59:02] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-25 20:59:02] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 319 sub problems to find dead transitions.
[2026-05-25 20:59:02] [INFO ] Flow matrix only has 294 transitions (discarded 26 similar events)
[2026-05-25 20:59:02] [INFO ] Invariant cache hit.
[2026-05-25 20:59:02] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/267 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 1/268 variables, 61/85 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (OVERLAPS) 4/272 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (OVERLAPS) 293/565 variables, 272/364 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 13/377 constraints. Problems are: Problem set: 0 solved, 319 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 10 (OVERLAPS) 1/566 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 12 (OVERLAPS) 0/566 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 378 constraints, problems are : Problem set: 0 solved, 319 unsolved in 23264 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 272/272 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/267 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 1/268 variables, 61/85 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (OVERLAPS) 4/272 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (OVERLAPS) 293/565 variables, 272/364 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 13/377 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 319/696 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 11 (OVERLAPS) 1/566 variables, 1/697 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/566 variables, and 697 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 272/272 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53397ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 53410ms
Finished structural reductions in LTL mode , in 1 iterations and 53785 ms. Remains : 272/272 places, 320/320 transitions.
Support contains 164 out of 272 places after structural reductions.
[2026-05-25 21:00:00] [INFO ] Flatten gal took : 54 ms
[2026-05-25 21:00:00] [INFO ] Flatten gal took : 24 ms
[2026-05-25 21:00:00] [INFO ] Input system was already deterministic with 320 transitions.
RANDOM walk for 40000 steps (8 resets) in 2539 ms. (15 steps per ms) remains 3/81 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 2/2 properties
[2026-05-25 21:00:01] [INFO ] Flow matrix only has 294 transitions (discarded 26 similar events)
[2026-05-25 21:00:01] [INFO ] Invariant cache hit.
[2026-05-25 21:00:01] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 59/76 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 152/228 variables, 48/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp71 is UNSAT
At refinement iteration 5 (OVERLAPS) 44/272 variables, 27/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 293/565 variables, 272/364 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 13/377 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 0/377 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/566 variables, 1/378 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 0/378 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/566 variables, 0/378 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 378 constraints, problems are : Problem set: 1 solved, 1 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 272/272 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/49 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 175/224 variables, 54/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 48/272 variables, 27/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 293/565 variables, 272/364 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 13/377 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 1/378 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 0/378 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/566 variables, 1/379 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 0/379 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/566 variables, 0/379 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 379 constraints, problems are : Problem set: 1 solved, 1 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 272/272 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 490ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 108 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=36 )
Parikh walk visited 1 properties in 8 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2026-05-25 21:00:01] [INFO ] Flatten gal took : 18 ms
[2026-05-25 21:00:01] [INFO ] Flatten gal took : 18 ms
[2026-05-25 21:00:01] [INFO ] Input system was already deterministic with 320 transitions.
Computed a total of 6 stabilizing places and 1 stable transitions
Graph (complete) has 873 edges and 272 vertex of which 268 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 320/320 transitions.
Ensure Unique test removed 5 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 264 transition count 320
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 50 place count 222 transition count 262
Ensure Unique test removed 17 places
Iterating global reduction 1 with 59 rules applied. Total rules applied 109 place count 205 transition count 262
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 134 place count 205 transition count 237
Applied a total of 134 rules in 9 ms. Remains 205 /272 variables (removed 67) and now considering 237/320 (removed 83) transitions.
[2026-05-25 21:00:01] [INFO ] Flow matrix only has 226 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-5820694252567506714.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9027606098333136137.kers'
[2026-05-25 21:00:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5820694252567506714.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9027606098333136137.kers]
Normalized transition count is 225 out of 226 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 225 rows 201 cols 758 entries
Finished phase 1 with 126 SingleSign rule and 12 generalized
[2026-05-25 21:00:01] [INFO ] Computed 67 invariants in 1 ms
Computed 67 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9027606098333136137.kers
Total runtime 1 ms.
[2026-05-25 21:00:01] [INFO ] Implicit Places using invariants in 87 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 204/272 places, 237/320 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 237/237 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 101 ms. Remains : 204/272 places, 237/320 transitions.
[2026-05-25 21:00:01] [INFO ] Flatten gal took : 10 ms
[2026-05-25 21:00:01] [INFO ] Flatten gal took : 10 ms
[2026-05-25 21:00:01] [INFO ] Input system was already deterministic with 237 transitions.
[2026-05-25 21:00:02] [INFO ] Flatten gal took : 10 ms
[2026-05-25 21:00:02] [INFO ] Flatten gal took : 10 ms
[2026-05-25 21:00:02] [INFO ] Time to serialize gal into /tmp/CTLFireability2575242827668960834.gal : 5 ms
[2026-05-25 21:00:02] [INFO ] Time to serialize properties into /tmp/CTLFireability14408825028526016043.ctl : 4 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/CTLFireability2575242827668960834.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14408825028526016043.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.00248e+23,0.703574,29196,2,2098,5,132252,6,0,1043,128939,0


Converting to forward existential form...Done !
original formula: A(AF(((!(AF((((p349==1)&&(p356==1))||((p14==1)&&(p33==1))))) + EF(((p88==1)&&(p115==1)))) + A((((p263==1)&&(p283==1))&&((p223==1)&&(p250=...552
=> equivalent forward existential formula: [((Init * !(EG(!((!((E(!((!(EG(!(E(((p70==1)&&(p85==1)) U ((p147==1)&&(p245==1)))))) + ((p230==1)&&(p240==1)))) ...2199
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 229/6/8
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,2.85189,88732,1,0,34,564912,74,15,5599,291856,42
FORMULA NoC3x3-PT-2A-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 272/272 places, 320/320 transitions.
Graph (complete) has 873 edges and 272 vertex of which 268 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 0 output transitions
Ensure Unique test removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 261 transition count 286
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 227 transition count 286
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 119 place count 177 transition count 216
Ensure Unique test removed 22 places
Iterating global reduction 2 with 72 rules applied. Total rules applied 191 place count 155 transition count 216
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 2 with 52 rules applied. Total rules applied 243 place count 155 transition count 164
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 263 place count 135 transition count 164
Applied a total of 263 rules in 30 ms. Remains 135 /272 variables (removed 137) and now considering 164/320 (removed 156) transitions.
[2026-05-25 21:00:04] [INFO ] Flow matrix only has 156 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-12394713753559639708.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9693424781898342672.kers'
[2026-05-25 21:00:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12394713753559639708.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9693424781898342672.kers]
Normalized transition count is 155 out of 156 initially.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 155 rows 127 cols 535 entries
Finished phase 1 with 74 SingleSign rule and 2 generalized
[2026-05-25 21:00:04] [INFO ] Computed 59 invariants in 0 ms
Computed 59 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9693424781898342672.kers
Total runtime 1 ms.
[2026-05-25 21:00:05] [INFO ] Implicit Places using invariants in 75 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 134/272 places, 164/320 transitions.
Applied a total of 0 rules in 8 ms. Remains 134 /134 variables (removed 0) and now considering 164/164 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 115 ms. Remains : 134/272 places, 164/320 transitions.
[2026-05-25 21:00:05] [INFO ] Flatten gal took : 7 ms
[2026-05-25 21:00:05] [INFO ] Flatten gal took : 7 ms
[2026-05-25 21:00:05] [INFO ] Input system was already deterministic with 164 transitions.
[2026-05-25 21:00:05] [INFO ] Flatten gal took : 14 ms
RANDOM walk for 5206 steps (0 resets) in 74 ms. (69 steps per ms) remains 0/1 properties
FORMULA NoC3x3-PT-2A-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 21:00:05] [INFO ] Flatten gal took : 14 ms
[2026-05-25 21:00:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4139568621278898411.gal : 2 ms
[2026-05-25 21:00:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality840358247559895139.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4139568621278898411.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality840358247559895139.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 320/320 transitions.
Ensure Unique test removed 7 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 261 transition count 320
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 61 place count 211 transition count 250
Ensure Unique test removed 21 places
Iterating global reduction 1 with 71 rules applied. Total rules applied 132 place count 190 transition count 250
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 163 place count 190 transition count 219
Applied a total of 163 rules in 12 ms. Remains 190 /272 variables (removed 82) and now considering 219/320 (removed 101) transitions.
[2026-05-25 21:00:05] [INFO ] Flow matrix only has 211 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-9944231010448101096.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3611704323192512851.kers'
[2026-05-25 21:00:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9944231010448101096.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3611704323192512851.kers]
Normalized transition count is 210 out of 211 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 210 rows 189 cols 694 entries
Finished phase 1 with 126 SingleSign rule and 4 generalized
[2026-05-25 21:00:05] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3611704323192512851.kers
Total runtime 1 ms.
[2026-05-25 21:00:05] [INFO ] Implicit Places using invariants in 74 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 189/272 places, 219/320 transitions.
Applied a total of 0 rules in 2 ms. Remains 189 /189 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 189/272 places, 219/320 transitions.
[2026-05-25 21:00:05] [INFO ] Flatten gal took : 13 ms
[2026-05-25 21:00:05] [INFO ] Flatten gal took : 9 ms
[2026-05-25 21:00:05] [INFO ] Input system was already deterministic with 219 transitions.
[2026-05-25 21:00:05] [INFO ] Flatten gal took : 8 ms
[2026-05-25 21:00:05] [INFO ] Flatten gal took : 7 ms
[2026-05-25 21:00:05] [INFO ] Time to serialize gal into /tmp/CTLFireability14887234449816346975.gal : 1 ms
[2026-05-25 21:00:05] [INFO ] Time to serialize properties into /tmp/CTLFireability14295800595046452630.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/CTLFireability14887234449816346975.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14295800595046452630.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,7.35006e+22,0.434081,22944,2,1695,5,101259,6,0,968,96721,0


Converting to forward existential form...Done !
original formula: EF((((p226==1)&&(p244==1)) + ((AG(((p32==0)||(p51==0))) * EX((((p128==0)||(p201==0))&&(p319==0)))) * EG(AG(((p154==0)||(p208==0)))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * ((p226==1)&&(p244==1)))] != FALSE + [FwdG((FwdU(Init,TRUE) * (!(E(TRUE U !(((p32==0)||(p51=...257
(forward)formula 0,1,0.435653,23120,1,0,7,101259,8,1,974,96721,1
FORMULA NoC3x3-PT-2A-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 272/272 places, 320/320 transitions.
Graph (complete) has 873 edges and 272 vertex of which 268 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 0 output transitions
Ensure Unique test removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 261 transition count 284
Reduce places removed 36 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 38 rules applied. Total rules applied 75 place count 225 transition count 282
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 223 transition count 282
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 129 place count 171 transition count 210
Ensure Unique test removed 23 places
Iterating global reduction 3 with 75 rules applied. Total rules applied 204 place count 148 transition count 210
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 3 with 54 rules applied. Total rules applied 258 place count 148 transition count 156
Reduce places removed 21 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 23 rules applied. Total rules applied 281 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 283 place count 125 transition count 154
Applied a total of 283 rules in 30 ms. Remains 125 /272 variables (removed 147) and now considering 154/320 (removed 166) transitions.
[2026-05-25 21:00:05] [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-2772177241360973455.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16320592643792293662.kers'
[2026-05-25 21:00:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2772177241360973455.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16320592643792293662.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:00:05] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16320592643792293662.kers
Total runtime 2 ms.
[2026-05-25 21:00:05] [INFO ] Implicit Places using invariants in 70 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 124/272 places, 154/320 transitions.
Applied a total of 0 rules in 5 ms. Remains 124 /124 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 107 ms. Remains : 124/272 places, 154/320 transitions.
[2026-05-25 21:00:05] [INFO ] Flatten gal took : 6 ms
[2026-05-25 21:00:05] [INFO ] Flatten gal took : 5 ms
[2026-05-25 21:00:05] [INFO ] Input system was already deterministic with 154 transitions.
RANDOM walk for 309 steps (0 resets) in 10 ms. (28 steps per ms) remains 0/1 properties
FORMULA NoC3x3-PT-2A-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 21:00:05] [INFO ] Flatten gal took : 5 ms
[2026-05-25 21:00:05] [INFO ] Flatten gal took : 5 ms
[2026-05-25 21:00:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10065934984823135755.gal : 1 ms
[2026-05-25 21:00:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2762361798470424773.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10065934984823135755.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2762361798470424773.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 320/320 transitions.
Ensure Unique test removed 6 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 263 transition count 320
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 55 place count 217 transition count 257
Ensure Unique test removed 20 places
Iterating global reduction 1 with 66 rules applied. Total rules applied 121 place count 197 transition count 257
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 152 place count 197 transition count 226
Applied a total of 152 rules in 9 ms. Remains 197 /272 variables (removed 75) and now considering 226/320 (removed 94) transitions.
[2026-05-25 21:00:05] [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-14819000458827763071.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6297188714320906619.kers'
[2026-05-25 21:00:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14819000458827763071.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6297188714320906619.kers]
Normalized transition count is 215 out of 216 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 215 rows 194 cols 716 entries
Finished phase 1 with 128 SingleSign rule and 6 generalized
[2026-05-25 21:00:05] [INFO ] Computed 63 invariants in 0 ms
Computed 63 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6297188714320906619.kers
Total runtime 1 ms.
[2026-05-25 21:00:05] [INFO ] Implicit Places using invariants in 76 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 196/272 places, 226/320 transitions.
Applied a total of 0 rules in 2 ms. Remains 196 /196 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 196/272 places, 226/320 transitions.
[2026-05-25 21:00:06] [INFO ] Flatten gal took : 7 ms
[2026-05-25 21:00:06] [INFO ] Flatten gal took : 7 ms
[2026-05-25 21:00:06] [INFO ] Input system was already deterministic with 226 transitions.
[2026-05-25 21:00:06] [INFO ] Flatten gal took : 6 ms
[2026-05-25 21:00:06] [INFO ] Flatten gal took : 7 ms
[2026-05-25 21:00:06] [INFO ] Time to serialize gal into /tmp/CTLFireability6302078850806409825.gal : 1 ms
[2026-05-25 21:00:06] [INFO ] Time to serialize properties into /tmp/CTLFireability751608655076688696.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/CTLFireability6302078850806409825.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability751608655076688696.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.63486e+23,0.626641,28924,2,2128,5,132134,6,0,1000,127095,0


Converting to forward existential form...Done !
original formula: ((AG(((EF((((p136==0)||(p209==0))&&((p143==0)||(p197==0)))) + (p309==0)) + (p330==0))) + EG(AX((((AX(((p339==0)||(p356==0))) + (p26==0)) ...428
=> equivalent forward existential formula: [(FwdU((Init * !((!(E(TRUE U !(((E(TRUE U (((p136==0)||(p209==0))&&((p143==0)||(p197==0)))) + (p309==0)) + (p330...686
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 223/0/3
Using saturation style SCC detection
(forward)formula 0,1,2.0216,68380,1,0,29,417165,46,12,5213,224974,29
FORMULA NoC3x3-PT-2A-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 320/320 transitions.
Ensure Unique test removed 6 places
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 262 transition count 320
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 57 place count 215 transition count 255
Ensure Unique test removed 20 places
Iterating global reduction 1 with 67 rules applied. Total rules applied 124 place count 195 transition count 255
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 152 place count 195 transition count 227
Applied a total of 152 rules in 6 ms. Remains 195 /272 variables (removed 77) and now considering 227/320 (removed 93) transitions.
[2026-05-25 21:00:08] [INFO ] Flow matrix only has 218 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-12306545120404626447.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9085922877617408610.kers'
[2026-05-25 21:00:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12306545120404626447.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9085922877617408610.kers]
Normalized transition count is 217 out of 218 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 193 cols 720 entries
Finished phase 1 with 127 SingleSign rule and 6 generalized
[2026-05-25 21:00:08] [INFO ] Computed 62 invariants in 0 ms
Computed 62 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9085922877617408610.kers
Total runtime 1 ms.
[2026-05-25 21:00:08] [INFO ] Implicit Places using invariants in 70 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/272 places, 227/320 transitions.
Applied a total of 0 rules in 3 ms. Remains 194 /194 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80 ms. Remains : 194/272 places, 227/320 transitions.
[2026-05-25 21:00:08] [INFO ] Flatten gal took : 6 ms
[2026-05-25 21:00:08] [INFO ] Flatten gal took : 5 ms
[2026-05-25 21:00:08] [INFO ] Input system was already deterministic with 227 transitions.
[2026-05-25 21:00:08] [INFO ] Flatten gal took : 5 ms
[2026-05-25 21:00:08] [INFO ] Flatten gal took : 9 ms
[2026-05-25 21:00:08] [INFO ] Time to serialize gal into /tmp/CTLFireability15592687714813854399.gal : 1 ms
[2026-05-25 21:00:08] [INFO ] Time to serialize properties into /tmp/CTLFireability4827859105150369294.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/CTLFireability15592687714813854399.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4827859105150369294.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.50201e+23,0.490947,23976,2,1796,5,106045,6,0,996,101306,0


Converting to forward existential form...Done !
original formula: (AG((EF((((p344==1)&&(p360==1)) + ((AF(((p155==1)&&(p179==1))) * (p3==1)) * (p15==1)))) * (AX(EF(((p2==1)&&(p16==1)))) + E((A(((p286==1)&...406
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E(TRUE U (((p344==1)&&(p360==1)) + ((!(EG(!(((p155==1)&&(p179==1))))) * (p3==1)) * (p15=...670
Hit Full ! (commute/partial/dont) 216/10/11
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 223/0/4
(forward)formula 0,0,1.61776,56796,1,0,26,332206,46,10,5175,183837,28
FORMULA NoC3x3-PT-2A-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 320/320 transitions.
Ensure Unique test removed 7 places
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 262 transition count 320
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 55 place count 217 transition count 258
Ensure Unique test removed 21 places
Iterating global reduction 1 with 66 rules applied. Total rules applied 121 place count 196 transition count 258
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 152 place count 196 transition count 227
Applied a total of 152 rules in 4 ms. Remains 196 /272 variables (removed 76) and now considering 227/320 (removed 93) transitions.
[2026-05-25 21:00:09] [INFO ] Flow matrix only has 216 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-3751362754237908322.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7305702567875818889.kers'
[2026-05-25 21:00:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3751362754237908322.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7305702567875818889.kers]
Normalized transition count is 215 out of 216 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 215 rows 194 cols 714 entries
Finished phase 1 with 131 SingleSign rule and 4 generalized
[2026-05-25 21:00:09] [INFO ] Computed 61 invariants in 3 ms
Computed 61 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7305702567875818889.kers
Total runtime 4 ms.
[2026-05-25 21:00:09] [INFO ] Implicit Places using invariants in 71 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 195/272 places, 227/320 transitions.
Applied a total of 0 rules in 2 ms. Remains 195 /195 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 195/272 places, 227/320 transitions.
[2026-05-25 21:00:09] [INFO ] Flatten gal took : 5 ms
[2026-05-25 21:00:09] [INFO ] Flatten gal took : 6 ms
[2026-05-25 21:00:09] [INFO ] Input system was already deterministic with 227 transitions.
[2026-05-25 21:00:09] [INFO ] Flatten gal took : 4 ms
[2026-05-25 21:00:09] [INFO ] Flatten gal took : 4 ms
[2026-05-25 21:00:09] [INFO ] Time to serialize gal into /tmp/CTLFireability10083851742400652926.gal : 1 ms
[2026-05-25 21:00:09] [INFO ] Time to serialize properties into /tmp/CTLFireability56353721258775675.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/CTLFireability10083851742400652926.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability56353721258775675.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,2.442e+23,0.67239,28724,2,1673,5,129839,6,0,997,127712,0


Converting to forward existential form...Done !
original formula: (E(((((AG(((p40==1)&&(p78==1))) * (p107==1)) * ((p121==1)&&(p202==1))) * ((p291==1)&&(((p146==1)&&(p211==1))||((p150==1)&&(p165==1))))) +...322
=> equivalent forward existential formula: ([(Init * !(E(((((!(E(TRUE U !(((p40==1)&&(p78==1))))) * (p107==1)) * ((p121==1)&&(p202==1))) * ((p291==1)&&(((p...483
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 220/0/7
(forward)formula 0,1,1.70956,54380,1,0,20,312392,52,9,5196,156679,27
FORMULA NoC3x3-PT-2A-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 320/320 transitions.
Ensure Unique test removed 7 places
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 262 transition count 320
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 59 place count 213 transition count 251
Ensure Unique test removed 20 places
Iterating global reduction 1 with 69 rules applied. Total rules applied 128 place count 193 transition count 251
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 158 place count 193 transition count 221
Applied a total of 158 rules in 4 ms. Remains 193 /272 variables (removed 79) and now considering 221/320 (removed 99) transitions.
[2026-05-25 21:00:11] [INFO ] Flow matrix only has 213 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-7783543406052296314.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3186755203985739275.kers'
[2026-05-25 21:00:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7783543406052296314.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3186755203985739275.kers]
Normalized transition count is 212 out of 213 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 212 rows 191 cols 704 entries
Finished phase 1 with 125 SingleSign rule and 6 generalized
[2026-05-25 21:00:11] [INFO ] Computed 62 invariants in 1 ms
Computed 62 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3186755203985739275.kers
Total runtime 2 ms.
[2026-05-25 21:00:11] [INFO ] Implicit Places using invariants in 72 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 192/272 places, 221/320 transitions.
Applied a total of 0 rules in 1 ms. Remains 192 /192 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 192/272 places, 221/320 transitions.
[2026-05-25 21:00:11] [INFO ] Flatten gal took : 5 ms
[2026-05-25 21:00:11] [INFO ] Flatten gal took : 5 ms
[2026-05-25 21:00:11] [INFO ] Input system was already deterministic with 221 transitions.
[2026-05-25 21:00:11] [INFO ] Flatten gal took : 5 ms
[2026-05-25 21:00:11] [INFO ] Flatten gal took : 5 ms
[2026-05-25 21:00:11] [INFO ] Time to serialize gal into /tmp/CTLFireability18022632562753091176.gal : 1 ms
[2026-05-25 21:00:11] [INFO ] Time to serialize properties into /tmp/CTLFireability15048672149291128903.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/CTLFireability18022632562753091176.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15048672149291128903.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,8.11162e+22,0.429637,22224,2,1747,5,97283,6,0,979,92814,0


Converting to forward existential form...Done !
original formula: (AF((EX((((((p214==0)||(p242==0))&&((p216==0)||(p253==0)))||(p226==0))||(p262==0))) * AX(((((p300==0)||(p319==0))&&(p81==0))||((p349==1)&...204
=> equivalent forward existential formula: ([FwdG(Init,!((EX((((((p214==0)||(p242==0))&&((p216==0)||(p253==0)))||(p226==0))||(p262==0))) * !(EX(!(((((p300=...287
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,1.30816,44372,1,0,7,248389,19,1,5049,107459,11
FORMULA NoC3x3-PT-2A-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 320/320 transitions.
Ensure Unique test removed 7 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 261 transition count 320
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 63 place count 209 transition count 248
Ensure Unique test removed 23 places
Iterating global reduction 1 with 75 rules applied. Total rules applied 138 place count 186 transition count 248
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 171 place count 186 transition count 215
Applied a total of 171 rules in 8 ms. Remains 186 /272 variables (removed 86) and now considering 215/320 (removed 105) transitions.
[2026-05-25 21:00:13] [INFO ] Flow matrix only has 207 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-16675078396137245290.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-974206240731027654.kers'
[2026-05-25 21:00:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16675078396137245290.kers, --Pflows, --basisKERS=/tmp/petrispot-output-974206240731027654.kers]
Normalized transition count is 206 out of 207 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 206 rows 185 cols 674 entries
Finished phase 1 with 128 SingleSign rule and 0 generalized
[2026-05-25 21:00:13] [INFO ] Computed 58 invariants in 0 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-974206240731027654.kers
Total runtime 1 ms.
[2026-05-25 21:00:13] [INFO ] Implicit Places using invariants in 73 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/272 places, 215/320 transitions.
Applied a total of 0 rules in 1 ms. Remains 185 /185 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83 ms. Remains : 185/272 places, 215/320 transitions.
[2026-05-25 21:00:13] [INFO ] Flatten gal took : 4 ms
[2026-05-25 21:00:13] [INFO ] Flatten gal took : 4 ms
[2026-05-25 21:00:13] [INFO ] Input system was already deterministic with 215 transitions.
[2026-05-25 21:00:13] [INFO ] Flatten gal took : 5 ms
[2026-05-25 21:00:13] [INFO ] Flatten gal took : 5 ms
[2026-05-25 21:00:13] [INFO ] Time to serialize gal into /tmp/CTLFireability9100860206402508957.gal : 1 ms
[2026-05-25 21:00:13] [INFO ] Time to serialize properties into /tmp/CTLFireability1643024238625780301.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/CTLFireability9100860206402508957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1643024238625780301.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.95469e+22,0.397585,21364,2,1529,5,92421,6,0,948,88394,0


Converting to forward existential form...Done !
original formula: AG(EX((AG(((p155==0)||(p172==0))) * EX((p179==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((!(E(TRUE U !(((p155==0)||(p172==0))))) * EX((p179==0))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.963552,34676,1,0,11,213218,16,4,4398,88394,8
FORMULA NoC3x3-PT-2A-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 272/272 places, 320/320 transitions.
Graph (complete) has 873 edges and 272 vertex of which 269 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 262 transition count 294
Reduce places removed 26 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 33 rules applied. Total rules applied 60 place count 236 transition count 287
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 67 place count 229 transition count 287
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 110 place count 186 transition count 231
Ensure Unique test removed 19 places
Iterating global reduction 3 with 62 rules applied. Total rules applied 172 place count 167 transition count 231
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 3 with 44 rules applied. Total rules applied 216 place count 167 transition count 187
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 18 rules applied. Total rules applied 234 place count 150 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 235 place count 149 transition count 186
Applied a total of 235 rules in 22 ms. Remains 149 /272 variables (removed 123) and now considering 186/320 (removed 134) transitions.
[2026-05-25 21:00:14] [INFO ] Flow matrix only has 172 transitions (discarded 14 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1622705763604519602.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16159955611856432693.kers'
[2026-05-25 21:00:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1622705763604519602.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16159955611856432693.kers]
Normalized transition count is 171 out of 172 initially.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 171 rows 141 cols 592 entries
Finished phase 1 with 78 SingleSign rule and 8 generalized
[2026-05-25 21:00:14] [INFO ] Computed 63 invariants in 0 ms
Computed 63 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16159955611856432693.kers
Total runtime 1 ms.
[2026-05-25 21:00:14] [INFO ] Implicit Places using invariants in 66 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 148/272 places, 186/320 transitions.
Applied a total of 0 rules in 5 ms. Remains 148 /148 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 94 ms. Remains : 148/272 places, 186/320 transitions.
[2026-05-25 21:00:14] [INFO ] Flatten gal took : 4 ms
[2026-05-25 21:00:14] [INFO ] Flatten gal took : 4 ms
[2026-05-25 21:00:14] [INFO ] Input system was already deterministic with 186 transitions.
[2026-05-25 21:00:14] [INFO ] Flatten gal took : 4 ms
[2026-05-25 21:00:14] [INFO ] Flatten gal took : 7 ms
[2026-05-25 21:00:14] [INFO ] Time to serialize gal into /tmp/CTLFireability9728087555039252240.gal : 1 ms
[2026-05-25 21:00:14] [INFO ] Time to serialize properties into /tmp/CTLFireability500854131886807429.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/CTLFireability9728087555039252240.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability500854131886807429.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.78037e+19,0.133138,9640,2,525,5,28328,6,0,756,28701,0


Converting to forward existential form...Done !
original formula: EG((AF((((!(E(((p307==1)&&(p353==1)) U ((p104==1)&&(p113==1)))) + (p263==0)) + (p280==0)) * (((((p309==1)&&(p314==1))||(p143==0))||((p199...374
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!((((!(E(((p307==1)&&(p353==1)) U ((p104==1)&&(p113==1)))) + (p263==0)) + (p280==0)) * (((((p30...474
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 179/6/7
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 182/0/4
Detected timeout of ITS tools.
[2026-05-25 21:00:44] [INFO ] Flatten gal took : 5 ms
[2026-05-25 21:00:44] [INFO ] Applying decomposition
[2026-05-25 21:00:44] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph940017881350340654.txt' '-o' '/tmp/graph940017881350340654.bin' '-w' '/tmp/graph940017881350340654.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph940017881350340654.bin' '-l' '-1' '-v' '-w' '/tmp/graph940017881350340654.weights' '-q' '0' '-e' '0.001'
[2026-05-25 21:00:44] [INFO ] Decomposing Gal with order
[2026-05-25 21:00:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 21:00:44] [INFO ] Removed a total of 66 redundant transitions.
[2026-05-25 21:00:44] [INFO ] Flatten gal took : 54 ms
[2026-05-25 21:00:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 12 ms.
[2026-05-25 21:00:44] [INFO ] Time to serialize gal into /tmp/CTLFireability5460986404067082962.gal : 3 ms
[2026-05-25 21:00:44] [INFO ] Time to serialize properties into /tmp/CTLFireability7019498890377084318.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/CTLFireability5460986404067082962.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7019498890377084318.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.78037e+19,0.060875,6512,163,53,4197,1246,496,5702,109,2955,0


Converting to forward existential form...Done !
original formula: EG((AF((((!(E(((i9.u44.p307==1)&&(i10.u47.p353==1)) U ((i3.u16.p104==1)&&(i3.u16.p113==1)))) + (i7.u34.p263==0)) + (i8.u36.p280==0)) * ((...555
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!((((!(E(((i9.u44.p307==1)&&(i10.u47.p353==1)) U ((i3.u16.p104==1)&&(i3.u16.p113==1)))) + (i7.u...667
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 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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 320/320 transitions.
Ensure Unique test removed 7 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 261 transition count 320
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 59 place count 213 transition count 254
Ensure Unique test removed 21 places
Iterating global reduction 1 with 69 rules applied. Total rules applied 128 place count 192 transition count 254
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 159 place count 192 transition count 223
Applied a total of 159 rules in 4 ms. Remains 192 /272 variables (removed 80) and now considering 223/320 (removed 97) transitions.
[2026-05-25 21:01:14] [INFO ] Flow matrix only has 213 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-10867264081659619006.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-530562202602542251.kers'
[2026-05-25 21:01:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10867264081659619006.kers, --Pflows, --basisKERS=/tmp/petrispot-output-530562202602542251.kers]
Normalized transition count is 212 out of 213 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 212 rows 191 cols 702 entries
Finished phase 1 with 128 SingleSign rule and 4 generalized
[2026-05-25 21:01:14] [INFO ] Computed 60 invariants in 0 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-530562202602542251.kers
Total runtime 1 ms.
[2026-05-25 21:01:14] [INFO ] Implicit Places using invariants in 116 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 191/272 places, 223/320 transitions.
Applied a total of 0 rules in 2 ms. Remains 191 /191 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 191/272 places, 223/320 transitions.
[2026-05-25 21:01:14] [INFO ] Flatten gal took : 6 ms
[2026-05-25 21:01:14] [INFO ] Flatten gal took : 6 ms
[2026-05-25 21:01:14] [INFO ] Input system was already deterministic with 223 transitions.
[2026-05-25 21:01:14] [INFO ] Flatten gal took : 6 ms
[2026-05-25 21:01:14] [INFO ] Flatten gal took : 5 ms
[2026-05-25 21:01:14] [INFO ] Time to serialize gal into /tmp/CTLFireability15080428959724425459.gal : 1 ms
[2026-05-25 21:01:14] [INFO ] Time to serialize properties into /tmp/CTLFireability1468839513130608944.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/CTLFireability15080428959724425459.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1468839513130608944.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.18328e+23,0.563913,24712,2,1733,5,109669,6,0,980,104460,0


Converting to forward existential form...Done !
original formula: EG(AX(((EF(AG((p193==1))) + E((((p300==1)&&(p338==1))||((p300==1)&&(p314==1))) U (((p38==1)&&(p53==1))||((p161==1)&&(p175==1))))) + ((p35...279
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(((E(TRUE U !(E(TRUE U !((p193==1))))) + E((((p300==1)&&(p338==1))||((p300==1)&&(p314==1))) U (...346
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 206/0/17
(forward)formula 0,0,2.01353,67588,1,0,16,403718,30,5,4976,258959,18
FORMULA NoC3x3-PT-2A-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 272/272 places, 320/320 transitions.
Graph (complete) has 873 edges and 272 vertex of which 268 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 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 262 transition count 285
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 227 transition count 285
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 121 place count 177 transition count 217
Ensure Unique test removed 23 places
Iterating global reduction 2 with 73 rules applied. Total rules applied 194 place count 154 transition count 217
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 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 2 with 51 rules applied. Total rules applied 245 place count 154 transition count 166
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 263 place count 136 transition count 166
Applied a total of 263 rules in 24 ms. Remains 136 /272 variables (removed 136) and now considering 166/320 (removed 154) transitions.
[2026-05-25 21:01:16] [INFO ] Flow matrix only has 156 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-11193021116072264451.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3578897546150886928.kers'
[2026-05-25 21:01:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11193021116072264451.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3578897546150886928.kers]
Normalized transition count is 155 out of 156 initially.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 155 rows 128 cols 528 entries
Finished phase 1 with 77 SingleSign rule and 0 generalized
[2026-05-25 21:01:16] [INFO ] Computed 59 invariants in 0 ms
Computed 59 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3578897546150886928.kers
Total runtime 0 ms.
[2026-05-25 21:01:17] [INFO ] Implicit Places using invariants in 79 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 135/272 places, 166/320 transitions.
Applied a total of 0 rules in 3 ms. Remains 135 /135 variables (removed 0) and now considering 166/166 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 107 ms. Remains : 135/272 places, 166/320 transitions.
[2026-05-25 21:01:17] [INFO ] Flatten gal took : 3 ms
[2026-05-25 21:01:17] [INFO ] Flatten gal took : 4 ms
[2026-05-25 21:01:17] [INFO ] Input system was already deterministic with 166 transitions.
[2026-05-25 21:01:17] [INFO ] Flatten gal took : 3 ms
[2026-05-25 21:01:17] [INFO ] Flatten gal took : 3 ms
[2026-05-25 21:01:17] [INFO ] Time to serialize gal into /tmp/CTLFireability5255094105199838663.gal : 1 ms
[2026-05-25 21:01:17] [INFO ] Time to serialize properties into /tmp/CTLFireability15690985886373241.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/CTLFireability5255094105199838663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15690985886373241.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.94323e+18,0.12548,9480,2,453,5,28548,6,0,687,27835,0


Converting to forward existential form...Done !
original formula: A(EG(AG(AF((((p98==1)&&(p180==1))||((p69==1)&&(p84==1)))))) U AF(((p153==1)&&(p245==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(((p153==1)&&(p245==1))))))))) * !(E(!(!(EG(!(((p153==1)&&(p245==1)))))) U (!(EG(!(E(TRUE...272
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.23339,10392,1,0,10,31389,39,3,3783,27835,15
FORMULA NoC3x3-PT-2A-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 272/272 places, 320/320 transitions.
Graph (complete) has 873 edges and 272 vertex of which 268 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Ensure Unique test removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 261 transition count 286
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 227 transition count 284
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 225 transition count 284
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 124 place count 174 transition count 213
Ensure Unique test removed 22 places
Iterating global reduction 3 with 73 rules applied. Total rules applied 197 place count 152 transition count 213
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 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 3 with 51 rules applied. Total rules applied 248 place count 152 transition count 162
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 20 rules applied. Total rules applied 268 place count 133 transition count 161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 269 place count 132 transition count 161
Applied a total of 269 rules in 19 ms. Remains 132 /272 variables (removed 140) and now considering 161/320 (removed 159) transitions.
[2026-05-25 21:01:17] [INFO ] Flow matrix only has 153 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-4441257195083114785.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6074176259638733031.kers'
[2026-05-25 21:01:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4441257195083114785.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6074176259638733031.kers]
Normalized transition count is 152 out of 153 initially.
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 152 rows 123 cols 524 entries
Finished phase 1 with 71 SingleSign rule and 2 generalized
[2026-05-25 21:01:17] [INFO ] Computed 59 invariants in 0 ms
Computed 59 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6074176259638733031.kers
Total runtime 1 ms.
[2026-05-25 21:01:17] [INFO ] Implicit Places using invariants in 109 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 111 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 131/272 places, 161/320 transitions.
Applied a total of 0 rules in 3 ms. Remains 131 /131 variables (removed 0) and now considering 161/161 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 133 ms. Remains : 131/272 places, 161/320 transitions.
[2026-05-25 21:01:17] [INFO ] Flatten gal took : 3 ms
[2026-05-25 21:01:17] [INFO ] Flatten gal took : 10 ms
[2026-05-25 21:01:17] [INFO ] Input system was already deterministic with 161 transitions.
[2026-05-25 21:01:17] [INFO ] Flatten gal took : 3 ms
[2026-05-25 21:01:17] [INFO ] Flatten gal took : 3 ms
[2026-05-25 21:01:17] [INFO ] Time to serialize gal into /tmp/CTLFireability3101257766394529004.gal : 1 ms
[2026-05-25 21:01:17] [INFO ] Time to serialize properties into /tmp/CTLFireability10522584372496711999.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/CTLFireability3101257766394529004.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10522584372496711999.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.47907e+18,0.121934,9188,2,454,5,26407,6,0,662,27178,0


Converting to forward existential form...Done !
original formula: AF(AG(A(((p290==1)&&(p323==1)) U ((p137==1)&&(p211==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!((E(!(((p137==1)&&(p211==1))) U (!(((p290==1)&&(p323==1))) * !(((p137==1)&&(p211==1))...206
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 147/0/14
(forward)formula 0,0,0.297116,13756,1,0,9,51062,30,2,3746,36250,15
FORMULA NoC3x3-PT-2A-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 320/320 transitions.
Ensure Unique test removed 7 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 261 transition count 320
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 63 place count 209 transition count 248
Ensure Unique test removed 23 places
Iterating global reduction 1 with 75 rules applied. Total rules applied 138 place count 186 transition count 248
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 171 place count 186 transition count 215
Applied a total of 171 rules in 9 ms. Remains 186 /272 variables (removed 86) and now considering 215/320 (removed 105) transitions.
[2026-05-25 21:01:17] [INFO ] Flow matrix only has 207 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-14284771148926086326.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-745221424277500692.kers'
[2026-05-25 21:01:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14284771148926086326.kers, --Pflows, --basisKERS=/tmp/petrispot-output-745221424277500692.kers]
Normalized transition count is 206 out of 207 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 206 rows 185 cols 674 entries
Finished phase 1 with 128 SingleSign rule and 0 generalized
[2026-05-25 21:01:17] [INFO ] Computed 58 invariants in 0 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-745221424277500692.kers
Total runtime 1 ms.
[2026-05-25 21:01:17] [INFO ] Implicit Places using invariants in 64 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/272 places, 215/320 transitions.
Applied a total of 0 rules in 1 ms. Remains 185 /185 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 185/272 places, 215/320 transitions.
[2026-05-25 21:01:17] [INFO ] Flatten gal took : 3 ms
[2026-05-25 21:01:17] [INFO ] Flatten gal took : 3 ms
[2026-05-25 21:01:17] [INFO ] Input system was already deterministic with 215 transitions.
[2026-05-25 21:01:17] [INFO ] Flatten gal took : 4 ms
[2026-05-25 21:01:17] [INFO ] Flatten gal took : 3 ms
[2026-05-25 21:01:17] [INFO ] Time to serialize gal into /tmp/CTLFireability10586595567663501029.gal : 1 ms
[2026-05-25 21:01:17] [INFO ] Time to serialize properties into /tmp/CTLFireability12181366338704419033.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/CTLFireability10586595567663501029.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12181366338704419033.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.95469e+22,0.400418,21304,2,1529,5,92421,6,0,948,88394,0


Converting to forward existential form...Done !
original formula: EX(EF(((p128==1)&&(p190==1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * ((p128==1)&&(p190==1)))] != FALSE
(forward)formula 0,1,0.650866,21444,1,0,9,93025,9,1,1801,88704,4
FORMULA NoC3x3-PT-2A-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 320/320 transitions.
Ensure Unique test removed 5 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 263 transition count 320
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 57 place count 215 transition count 253
Ensure Unique test removed 22 places
Iterating global reduction 1 with 70 rules applied. Total rules applied 127 place count 193 transition count 253
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 159 place count 193 transition count 221
Applied a total of 159 rules in 9 ms. Remains 193 /272 variables (removed 79) and now considering 221/320 (removed 99) transitions.
[2026-05-25 21:01:18] [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-1584223031398688519.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13848200861471858681.kers'
[2026-05-25 21:01:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1584223031398688519.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13848200861471858681.kers]
Normalized transition count is 211 out of 212 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 211 rows 190 cols 696 entries
Finished phase 1 with 130 SingleSign rule and 2 generalized
[2026-05-25 21:01:18] [INFO ] Computed 61 invariants in 0 ms
Computed 61 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13848200861471858681.kers
Total runtime 1 ms.
[2026-05-25 21:01:18] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-25 21:01:18] [INFO ] Flow matrix only has 212 transitions (discarded 9 similar events)
[2026-05-25 21:01:18] [INFO ] Invariant cache hit.
[2026-05-25 21:01:18] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 21:01:18] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2026-05-25 21:01:18] [INFO ] Flow matrix only has 212 transitions (discarded 9 similar events)
[2026-05-25 21:01:18] [INFO ] Invariant cache hit.
[2026-05-25 21:01:18] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 211/404 variables, 193/254 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 11/265 constraints. Problems are: Problem set: 0 solved, 220 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 1/405 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (OVERLAPS) 0/405 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 266 constraints, problems are : Problem set: 0 solved, 220 unsolved in 9734 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 193/193 constraints, ReadFeed: 12/12 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/192 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 211/404 variables, 193/254 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 11/265 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 220/485 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 1/405 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (OVERLAPS) 0/405 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/405 variables, and 486 constraints, problems are : Problem set: 0 solved, 220 unsolved in 22739 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 193/193 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32493ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 32494ms
Starting structural reductions in LTL mode, iteration 1 : 193/272 places, 221/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32734 ms. Remains : 193/272 places, 221/320 transitions.
[2026-05-25 21:01:51] [INFO ] Flatten gal took : 9 ms
[2026-05-25 21:01:51] [INFO ] Flatten gal took : 4 ms
[2026-05-25 21:01:51] [INFO ] Input system was already deterministic with 221 transitions.
[2026-05-25 21:01:51] [INFO ] Flatten gal took : 4 ms
[2026-05-25 21:01:51] [INFO ] Flatten gal took : 4 ms
[2026-05-25 21:01:51] [INFO ] Time to serialize gal into /tmp/CTLFireability12764103395627765393.gal : 1 ms
[2026-05-25 21:01:51] [INFO ] Time to serialize properties into /tmp/CTLFireability13838437979927690805.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/CTLFireability12764103395627765393.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13838437979927690805.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.32656e+23,0.596463,25264,2,1658,5,113377,6,0,984,108947,0


Converting to forward existential form...Done !
original formula: A(((p17==1)&&(p89==1)) U (((p293==1)&&(p330==1)) + (AF((!((((p147==1)&&(p201==1))||((p290==1)&&(p327==1)))) * EF(((p11==1)&&(p16==1))))) ...240
=> equivalent forward existential formula: [((Init * !(EG(!((((p293==1)&&(p330==1)) + (!(EG(!((!((((p147==1)&&(p201==1))||((p290==1)&&(p327==1)))) * E(TRUE...745
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,1.29724,40496,1,0,20,236455,33,13,5109,108947,22
FORMULA NoC3x3-PT-2A-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 272/272 places, 320/320 transitions.
Graph (complete) has 873 edges and 272 vertex of which 269 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 263 transition count 290
Reduce places removed 30 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 35 rules applied. Total rules applied 66 place count 233 transition count 285
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 71 place count 228 transition count 285
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 122 place count 177 transition count 214
Ensure Unique test removed 22 places
Iterating global reduction 3 with 73 rules applied. Total rules applied 195 place count 155 transition count 214
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 3 with 49 rules applied. Total rules applied 244 place count 155 transition count 165
Reduce places removed 17 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 4 with 20 rules applied. Total rules applied 264 place count 138 transition count 162
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 267 place count 135 transition count 162
Applied a total of 267 rules in 36 ms. Remains 135 /272 variables (removed 137) and now considering 162/320 (removed 158) transitions.
[2026-05-25 21:01:52] [INFO ] Flow matrix only has 154 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-7024434147071382547.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5379145972068457450.kers'
[2026-05-25 21:01:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7024434147071382547.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5379145972068457450.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 125 cols 529 entries
Finished phase 1 with 72 SingleSign rule and 2 generalized
[2026-05-25 21:01:52] [INFO ] Computed 61 invariants in 0 ms
Computed 61 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5379145972068457450.kers
Total runtime 1 ms.
[2026-05-25 21:01:52] [INFO ] Implicit Places using invariants in 67 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 134/272 places, 162/320 transitions.
Applied a total of 0 rules in 2 ms. Remains 134 /134 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 106 ms. Remains : 134/272 places, 162/320 transitions.
[2026-05-25 21:01:52] [INFO ] Flatten gal took : 3 ms
[2026-05-25 21:01:52] [INFO ] Flatten gal took : 3 ms
[2026-05-25 21:01:52] [INFO ] Input system was already deterministic with 162 transitions.
[2026-05-25 21:01:52] [INFO ] Flatten gal took : 2 ms
[2026-05-25 21:01:52] [INFO ] Flatten gal took : 2 ms
[2026-05-25 21:01:52] [INFO ] Time to serialize gal into /tmp/CTLFireability12307588013954297343.gal : 1 ms
[2026-05-25 21:01:52] [INFO ] Time to serialize properties into /tmp/CTLFireability1456425982415539382.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/CTLFireability12307588013954297343.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1456425982415539382.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.21861e+18,0.123097,9240,2,465,5,26586,6,0,674,27346,0


Converting to forward existential form...Done !
original formula: AG(((!(E(((p107==1)&&(p110==1)) U !((E(((p128==1)&&(p190==1)) U ((p348==1)&&(p359==1))) + !(((p155==1)&&(p211==1))))))) + (p297==0)) + (p...164
=> equivalent forward existential formula: [((FwdU(((FwdU(Init,TRUE) * !((p326==0))) * !((p297==0))),((p107==1)&&(p110==1))) * !(!(((p155==1)&&(p211==1))))...222
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 151/10/11
Hit Full ! (commute/partial/dont) 157/5/5
(forward)formula 0,0,0.218247,9904,1,0,17,32680,29,7,3719,27346,12
FORMULA NoC3x3-PT-2A-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 21:01:52] [INFO ] Flatten gal took : 6 ms
[2026-05-25 21:01:52] [INFO ] Flatten gal took : 6 ms
[2026-05-25 21:01:52] [INFO ] Applying decomposition
[2026-05-25 21:01:52] [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/graph18436831957067510630.txt' '-o' '/tmp/graph18436831957067510630.bin' '-w' '/tmp/graph18436831957067510630.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18436831957067510630.bin' '-l' '-1' '-v' '-w' '/tmp/graph18436831957067510630.weights' '-q' '0' '-e' '0.001'
[2026-05-25 21:01:53] [INFO ] Decomposing Gal with order
[2026-05-25 21:01:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 21:01:53] [INFO ] Removed a total of 113 redundant transitions.
[2026-05-25 21:01:53] [INFO ] Flatten gal took : 14 ms
[2026-05-25 21:01:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 9 ms.
[2026-05-25 21:01:53] [INFO ] Time to serialize gal into /tmp/CTLFireability15118731439340860094.gal : 4 ms
[2026-05-25 21:01:53] [INFO ] Time to serialize properties into /tmp/CTLFireability11234682895524641996.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/CTLFireability15118731439340860094.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11234682895524641996.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.23864e+26,0.727423,31200,534,349,46885,7653,894,119128,305,30274,0


Converting to forward existential form...Done !
original formula: EG((AF((((!(E(((i8.u40.p307==1)&&(i9.i0.u43.p353==1)) U ((i3.i0.u14.p104==1)&&(i3.i0.u14.p113==1)))) + (i7.u32.p263==0)) + (i7.u33.p280==...579
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!((((!(E(((i8.u40.p307==1)&&(i9.i0.u43.p353==1)) U ((i3.i0.u14.p104==1)&&(i3.i0.u14.p113==1))))...697
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 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
Detected timeout of ITS tools.
[2026-05-25 21:22:50] [INFO ] Applying decomposition
[2026-05-25 21:22:50] [INFO ] Flatten gal took : 8 ms
[2026-05-25 21:22:50] [INFO ] Decomposing Gal with order
[2026-05-25 21:22:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 21:22:50] [INFO ] Removed a total of 135 redundant transitions.
[2026-05-25 21:22:50] [INFO ] Flatten gal took : 15 ms
[2026-05-25 21:22:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 181 labels/synchronizations in 8 ms.
[2026-05-25 21:22:50] [INFO ] Time to serialize gal into /tmp/CTLFireability15510865922649517778.gal : 3 ms
[2026-05-25 21:22:50] [INFO ] Time to serialize properties into /tmp/CTLFireability5682274277463481704.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/CTLFireability15510865922649517778.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5682274277463481704.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.23864e+26,1.33214,58124,982,117,129203,531,744,164553,146,3487,0


Converting to forward existential form...Done !
original formula: EG((AF((((!(E(((u55.p307==1)&&(u64.p353==1)) U ((u23.p104==1)&&(u26.p113==1)))) + (u47.p263==0)) + (u51.p280==0)) * (((((u56.p309==1)&&(u...476
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!((((!(E(((u55.p307==1)&&(u64.p353==1)) U ((u23.p104==1)&&(u26.p113==1)))) + (u47.p263==0)) + (...584
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 7
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 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 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 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
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 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 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 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 a local SCC at level 5
Fast SCC detection found an SCC at level 7
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 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 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 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
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 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 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 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
Detected timeout of ITS tools.
[2026-05-25 21:43:47] [INFO ] Flatten gal took : 10 ms
[2026-05-25 21:43:47] [INFO ] Input system was already deterministic with 320 transitions.
[2026-05-25 21:43:47] [INFO ] Transformed 272 places.
[2026-05-25 21:43:47] [INFO ] Transformed 320 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 21:43:47] [INFO ] Time to serialize gal into /tmp/CTLFireability1027146547593220278.gal : 3 ms
[2026-05-25 21:43:47] [INFO ] Time to serialize properties into /tmp/CTLFireability15134577742215532819.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/CTLFireability1027146547593220278.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15134577742215532819.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 -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 1 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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-2A"
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-2A, 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-177969914000274"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-2A.tgz
mv NoC3x3-PT-2A execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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