fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r130-smll-177955809000202
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for FireWire-PT-08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1767.859 1504973.00 1629555.00 4871.60 TFTTFTFTFFFFFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r130-smll-177955809000202.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 FireWire-PT-08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809000202
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.1K Mar 7 05:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 7 05:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Mar 7 05:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Mar 7 05:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Mar 7 05:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Mar 7 05:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 7 05:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 05:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:06 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 97K 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 FireWire-PT-08-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-08-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779803806131

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-26 13:56:48] [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-26 13:56:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 13:56:48] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2026-05-26 13:56:48] [INFO ] Transformed 127 places.
[2026-05-26 13:56:49] [INFO ] Transformed 397 transitions.
[2026-05-26 13:56:49] [INFO ] Found NUPN structural information;
[2026-05-26 13:56:49] [INFO ] Parsed PT model containing 127 places and 397 transitions and 1475 arcs in 404 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
Support contains 56 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 344/344 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 336
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 336
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 123 transition count 334
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 123 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 123 transition count 328
Applied a total of 14 rules in 75 ms. Remains 123 /127 variables (removed 4) and now considering 328/344 (removed 16) transitions.
[2026-05-26 13:56:49] [INFO ] Flow matrix only has 302 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-18114681673253796106.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18101597643971642368.kers'
[2026-05-26 13:56:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18114681673253796106.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18101597643971642368.kers]
Normalized transition count is 301 out of 302 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 301 rows 123 cols 1025 entries
Finished phase 1 with 115 SingleSign rule and 0 generalized
[2026-05-26 13:56:49] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18101597643971642368.kers
Total runtime 5 ms.
[2026-05-26 13:56:49] [INFO ] Implicit Places using invariants in 558 ms returned []
[2026-05-26 13:56:49] [INFO ] Flow matrix only has 302 transitions (discarded 26 similar events)
[2026-05-26 13:56:49] [INFO ] Invariant cache hit.
[2026-05-26 13:56:50] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-26 13:56:50] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 1229 ms to find 0 implicit places.
Running 327 sub problems to find dead transitions.
[2026-05-26 13:56:50] [INFO ] Flow matrix only has 302 transitions (discarded 26 similar events)
[2026-05-26 13:56:50] [INFO ] Invariant cache hit.
[2026-05-26 13:56:50] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (OVERLAPS) 301/424 variables, 123/138 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 42/180 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 7 (OVERLAPS) 1/425 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (OVERLAPS) 0/425 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 181 constraints, problems are : Problem set: 0 solved, 327 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 327 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (OVERLAPS) 301/424 variables, 123/138 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 42/180 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 327/507 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/425 variables, and 507 constraints, problems are : Problem set: 0 solved, 327 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 42/43 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60582ms problems are : Problem set: 0 solved, 327 unsolved
Search for dead transitions found 0 dead transitions in 60612ms
Starting structural reductions in LTL mode, iteration 1 : 123/127 places, 328/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62002 ms. Remains : 123/127 places, 328/344 transitions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 328/328 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 328/328 (removed 0) transitions.
[2026-05-26 13:57:51] [INFO ] Flow matrix only has 302 transitions (discarded 26 similar events)
[2026-05-26 13:57:51] [INFO ] Invariant cache hit.
[2026-05-26 13:57:51] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-26 13:57:51] [INFO ] Flow matrix only has 302 transitions (discarded 26 similar events)
[2026-05-26 13:57:51] [INFO ] Invariant cache hit.
[2026-05-26 13:57:51] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-26 13:57:51] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 480 ms. Remains : 123/123 places, 328/328 transitions.
Support contains 56 out of 123 places after structural reductions.
[2026-05-26 13:57:52] [INFO ] Flatten gal took : 115 ms
[2026-05-26 13:57:52] [INFO ] Flatten gal took : 57 ms
[2026-05-26 13:57:52] [INFO ] Input system was already deterministic with 328 transitions.
Reduction of identical properties reduced properties to check from 55 to 54
RANDOM walk for 40000 steps (2249 resets) in 2491 ms. (16 steps per ms) remains 30/54 properties
BEST_FIRST walk for 4003 steps (64 resets) in 40 ms. (97 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (54 resets) in 36 ms. (108 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (56 resets) in 59 ms. (66 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (18 resets) in 42 ms. (93 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (60 resets) in 50 ms. (78 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4002 steps (132 resets) in 44 ms. (88 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (154 resets) in 56 ms. (70 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (107 resets) in 42 ms. (93 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (10 resets) in 44 ms. (88 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (51 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (105 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (68 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (56 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (95 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (35 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4004 steps (17 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (10 resets) in 10 ms. (363 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4003 steps (112 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (63 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (53 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
[2026-05-26 13:57:53] [INFO ] Flow matrix only has 302 transitions (discarded 26 similar events)
[2026-05-26 13:57:53] [INFO ] Invariant cache hit.
[2026-05-26 13:57:53] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 1 (OVERLAPS) 79/114 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 7/121 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 301/422 variables, 121/129 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 42/171 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/171 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 2/424 variables, 2/173 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 0/173 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 1/425 variables, 1/174 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 0/174 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 0/425 variables, 0/174 constraints. Problems are: Problem set: 3 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 174 constraints, problems are : Problem set: 3 solved, 22 unsolved in 1719 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 22 unsolved
Problem AtomicPropp31 is UNSAT
At refinement iteration 1 (OVERLAPS) 85/114 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 3/8 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 7/121 variables, 3/11 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 1/12 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 301/422 variables, 121/133 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 42/175 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 19/194 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 0/194 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 2/424 variables, 2/196 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 2/198 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 1/199 constraints. Problems are: Problem set: 4 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/425 variables, and 199 constraints, problems are : Problem set: 4 solved, 21 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 42/43 constraints, PredecessorRefiner: 21/25 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6765ms problems are : Problem set: 4 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 27 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 328/328 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 123 transition count 325
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 121 transition count 321
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 121 transition count 321
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 121 transition count 320
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 120 transition count 319
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 118 transition count 323
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 18 place count 118 transition count 319
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 118 transition count 317
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 118 transition count 343
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 28 place count 116 transition count 339
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 44 place count 116 transition count 323
Applied a total of 44 rules in 199 ms. Remains 116 /123 variables (removed 7) and now considering 323/328 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 116/123 places, 323/328 transitions.
RANDOM walk for 40000 steps (2157 resets) in 1050 ms. (38 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (59 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (59 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (69 resets) in 36 ms. (108 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (41 resets) in 45 ms. (87 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (150 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (102 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (9 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (61 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (71 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (54 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (33 resets) in 33 ms. (117 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (13 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (100 resets) in 36 ms. (108 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (60 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (9 resets) in 35 ms. (111 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (9 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (57 resets) in 35 ms. (111 steps per ms) remains 19/19 properties
[2026-05-26 13:58:00] [INFO ] Flow matrix only has 295 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5426984088392991232.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13980495185371402011.kers'
[2026-05-26 13:58:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5426984088392991232.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13980495185371402011.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 295 rows 116 cols 1021 entries
Finished phase 1 with 108 SingleSign rule and 0 generalized
[2026-05-26 13:58:00] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13980495185371402011.kers
Total runtime 2 ms.
[2026-05-26 13:58:00] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 78/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 11/113 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 295/408 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 45/168 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 3/411 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 0/411 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 171 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1800 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 78/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 11/113 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 295/408 variables, 113/126 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 18/189 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 3/411 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/411 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/411 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/411 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 0/411 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 194 constraints, problems are : Problem set: 0 solved, 19 unsolved in 6791 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8621ms problems are : Problem set: 0 solved, 19 unsolved
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 8 properties in 9005 ms.
Support contains 18 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 323/323 transitions.
Applied a total of 0 rules in 11 ms. Remains 116 /116 variables (removed 0) and now considering 323/323 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 116/116 places, 323/323 transitions.
RANDOM walk for 40000 steps (2183 resets) in 227 ms. (175 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (573 resets) in 117 ms. (339 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (596 resets) in 105 ms. (377 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (563 resets) in 105 ms. (377 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (13 resets) in 70 ms. (563 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (596 resets) in 100 ms. (396 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (563 resets) in 144 ms. (275 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (352 resets) in 102 ms. (388 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40002 steps (64 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1075 resets) in 76 ms. (519 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (600 resets) in 70 ms. (563 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (601 resets) in 81 ms. (487 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 447081 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :6 out of 10
Probabilistic random walk after 447081 steps, saw 105021 distinct states, run finished after 3007 ms. (steps per millisecond=148 ) properties seen :6
[2026-05-26 13:58:22] [INFO ] Flow matrix only has 295 transitions (discarded 28 similar events)
[2026-05-26 13:58:22] [INFO ] Invariant cache hit.
[2026-05-26 13:58:22] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 56/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 48/113 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 295/408 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 45/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 3/411 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/411 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 171 constraints, problems are : Problem set: 0 solved, 4 unsolved in 554 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 56/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 48/113 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 295/408 variables, 113/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3/411 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/411 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 177 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1360 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1926ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1554 ms.
Support contains 9 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 323/323 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 114 transition count 319
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 114 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 114 transition count 317
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 113 transition count 316
Applied a total of 7 rules in 31 ms. Remains 113 /116 variables (removed 3) and now considering 316/323 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 113/116 places, 316/323 transitions.
RANDOM walk for 40000 steps (2346 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (595 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (623 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (577 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (601 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 534266 steps, run visited all 4 properties in 2871 ms. (steps per millisecond=186 )
Probabilistic random walk after 534266 steps, saw 123151 distinct states, run finished after 2877 ms. (steps per millisecond=185 ) properties seen :4
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2026-05-26 13:58:28] [INFO ] Flatten gal took : 28 ms
[2026-05-26 13:58:28] [INFO ] Flatten gal took : 30 ms
[2026-05-26 13:58:28] [INFO ] Input system was already deterministic with 328 transitions.
Computed a total of 22 stabilizing places and 46 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 328/328 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 118 transition count 319
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 118 transition count 319
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 118 transition count 316
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 117 transition count 315
Applied a total of 13 rules in 28 ms. Remains 117 /123 variables (removed 6) and now considering 315/328 (removed 13) transitions.
[2026-05-26 13:58:28] [INFO ] Flow matrix only has 289 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-11922550079838209630.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17979907171807640480.kers'
[2026-05-26 13:58:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11922550079838209630.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17979907171807640480.kers]
Normalized transition count is 288 out of 289 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 288 rows 115 cols 961 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-26 13:58:28] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17979907171807640480.kers
Total runtime 3 ms.
[2026-05-26 13:58:28] [INFO ] Implicit Places using invariants in 155 ms returned []
[2026-05-26 13:58:28] [INFO ] Flow matrix only has 289 transitions (discarded 26 similar events)
[2026-05-26 13:58:28] [INFO ] Invariant cache hit.
[2026-05-26 13:58:29] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-26 13:58:29] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2026-05-26 13:58:29] [INFO ] Redundant transitions in 21 ms returned []
Running 312 sub problems to find dead transitions.
[2026-05-26 13:58:29] [INFO ] Flow matrix only has 289 transitions (discarded 26 similar events)
[2026-05-26 13:58:29] [INFO ] Invariant cache hit.
[2026-05-26 13:58:29] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (OVERLAPS) 288/404 variables, 116/133 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 41/174 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (OVERLAPS) 1/405 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 405/406 variables, and 175 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (OVERLAPS) 288/404 variables, 116/133 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 41/174 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 312/486 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (OVERLAPS) 1/405 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 405/406 variables, and 488 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60167ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 60170ms
Starting structural reductions in SI_CTL mode, iteration 1 : 117/123 places, 315/328 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60680 ms. Remains : 117/123 places, 315/328 transitions.
[2026-05-26 13:59:29] [INFO ] Flatten gal took : 30 ms
[2026-05-26 13:59:29] [INFO ] Flatten gal took : 28 ms
[2026-05-26 13:59:29] [INFO ] Input system was already deterministic with 315 transitions.
RANDOM walk for 40000 steps (2400 resets) in 249 ms. (160 steps per ms) remains 1/1 properties
[2026-05-26 13:59:29] [INFO ] Flatten gal took : 47 ms
BEST_FIRST walk for 40003 steps (525 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
[2026-05-26 13:59:29] [INFO ] Flatten gal took : 30 ms
[2026-05-26 13:59:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15608725682213065269.gal : 16 ms
[2026-05-26 13:59:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3784754644794947194.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15608725682213065269.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3784754644794947194.prop' '--nowitness' '--gen-order' 'FOLLOW'

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
Loading property file /tmp/ReachabilityCardinality3784754644794947194.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 50
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :50 after 122
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :122 after 382
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :382 after 5146
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5146 after 7829
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7829 after 24813
Reachability property FireWire-PT-08-CTLFireability-2024-00 is true.
FORMULA FireWire-PT-08-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,4.28652e+06,0.877843,20692,2,2187,17,61550,6,0,783,54412,0
Total reachable state count : 4286515

Verifying 1 reachability properties.
Reachability property FireWire-PT-08-CTLFireability-2024-00 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-08-CTLFireability-2024-00,1155,0.878975,20720,2,252,17,61550,7,0,789,54412,0
Finished probabilistic random walk after 537995 steps, run visited all 1 properties in 1276 ms. (steps per millisecond=421 )
Probabilistic random walk after 537995 steps, saw 106325 distinct states, run finished after 1276 ms. (steps per millisecond=421 ) properties seen :1
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 328/328 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 117 transition count 316
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 117 transition count 316
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 106 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 105 transition count 286
Applied a total of 37 rules in 52 ms. Remains 105 /123 variables (removed 18) and now considering 286/328 (removed 42) transitions.
[2026-05-26 13:59:31] [INFO ] Flow matrix only has 260 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-3500006670621246062.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15127694626459393636.kers'
[2026-05-26 13:59:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3500006670621246062.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15127694626459393636.kers]
Normalized transition count is 259 out of 260 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 259 rows 103 cols 855 entries
Finished phase 1 with 97 SingleSign rule and 0 generalized
[2026-05-26 13:59:31] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15127694626459393636.kers
Total runtime 1 ms.
[2026-05-26 13:59:31] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-26 13:59:31] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
[2026-05-26 13:59:31] [INFO ] Invariant cache hit.
[2026-05-26 13:59:31] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-26 13:59:31] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2026-05-26 13:59:31] [INFO ] Redundant transitions in 8 ms returned []
Running 283 sub problems to find dead transitions.
[2026-05-26 13:59:31] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
[2026-05-26 13:59:31] [INFO ] Invariant cache hit.
[2026-05-26 13:59:31] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 259/363 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 36/156 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (OVERLAPS) 1/364 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 0/364 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/365 variables, and 158 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 259/363 variables, 104/121 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 36/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 283/440 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/364 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/365 variables, and 441 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60158ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 60159ms
Starting structural reductions in SI_CTL mode, iteration 1 : 105/123 places, 286/328 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60636 ms. Remains : 105/123 places, 286/328 transitions.
[2026-05-26 14:00:31] [INFO ] Flatten gal took : 24 ms
[2026-05-26 14:00:31] [INFO ] Flatten gal took : 23 ms
[2026-05-26 14:00:31] [INFO ] Input system was already deterministic with 286 transitions.
[2026-05-26 14:00:31] [INFO ] Flatten gal took : 20 ms
[2026-05-26 14:00:31] [INFO ] Flatten gal took : 19 ms
[2026-05-26 14:00:31] [INFO ] Time to serialize gal into /tmp/CTLFireability17180076899422554655.gal : 9 ms
[2026-05-26 14:00:31] [INFO ] Time to serialize properties into /tmp/CTLFireability18310508424882428190.ctl : 7 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/CTLFireability17180076899422554655.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18310508424882428190.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,9.2827e+06,4.57987,106136,2,5120,5,297236,6,0,705,383219,0


Converting to forward existential form...Done !
original formula: EF(AG(((p4==1)&&(p46==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p4==1)&&(p46==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...612
(forward)formula 0,0,7.37468,113912,1,0,511,507455,591,260,5966,443988,579
FORMULA FireWire-PT-08-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 328/328 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 317
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 317
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 110 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 110 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 109 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 109 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 108 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 108 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 107 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 107 transition count 288
Applied a total of 35 rules in 25 ms. Remains 107 /123 variables (removed 16) and now considering 288/328 (removed 40) transitions.
[2026-05-26 14:00:39] [INFO ] Flow matrix only has 262 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-18124514614562280045.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3337897819394623099.kers'
[2026-05-26 14:00:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18124514614562280045.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3337897819394623099.kers]
Normalized transition count is 261 out of 262 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 261 rows 107 cols 875 entries
Finished phase 1 with 99 SingleSign rule and 0 generalized
[2026-05-26 14:00:39] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3337897819394623099.kers
Total runtime 2 ms.
[2026-05-26 14:00:39] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-26 14:00:39] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2026-05-26 14:00:39] [INFO ] Invariant cache hit.
[2026-05-26 14:00:39] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 14:00:39] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2026-05-26 14:00:39] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2026-05-26 14:00:39] [INFO ] Invariant cache hit.
[2026-05-26 14:00:39] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/368 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 159 constraints, problems are : Problem set: 0 solved, 287 unsolved in 27871 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/368 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 287/445 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 287 unsolved
SMT process timed out in 57951ms, After SMT, problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 57952ms
Starting structural reductions in LTL mode, iteration 1 : 107/123 places, 288/328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58349 ms. Remains : 107/123 places, 288/328 transitions.
[2026-05-26 14:01:37] [INFO ] Flatten gal took : 14 ms
[2026-05-26 14:01:37] [INFO ] Flatten gal took : 14 ms
[2026-05-26 14:01:37] [INFO ] Input system was already deterministic with 288 transitions.
[2026-05-26 14:01:37] [INFO ] Flatten gal took : 14 ms
[2026-05-26 14:01:37] [INFO ] Flatten gal took : 14 ms
[2026-05-26 14:01:37] [INFO ] Time to serialize gal into /tmp/CTLFireability17074056602943702070.gal : 5 ms
[2026-05-26 14:01:37] [INFO ] Time to serialize properties into /tmp/CTLFireability382847111639548090.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/CTLFireability17074056602943702070.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability382847111639548090.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13746e+07,7.56815,162344,2,6093,5,443377,6,0,715,562005,0


Converting to forward existential form...Done !
original formula: EG(EX(EF(EG(((p6==1)&&(p111==1))))))
=> equivalent forward existential formula: [FwdG(Init,EX(E(TRUE U EG(((p6==1)&&(p111==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...618
Detected timeout of ITS tools.
[2026-05-26 14:02:07] [INFO ] Flatten gal took : 10 ms
[2026-05-26 14:02:07] [INFO ] Applying decomposition
[2026-05-26 14:02:07] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9989137425982466176.txt' '-o' '/tmp/graph9989137425982466176.bin' '-w' '/tmp/graph9989137425982466176.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9989137425982466176.bin' '-l' '-1' '-v' '-w' '/tmp/graph9989137425982466176.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:02:07] [INFO ] Decomposing Gal with order
[2026-05-26 14:02:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:02:07] [INFO ] Removed a total of 437 redundant transitions.
[2026-05-26 14:02:08] [INFO ] Flatten gal took : 155 ms
[2026-05-26 14:02:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 29 ms.
[2026-05-26 14:02:08] [INFO ] Time to serialize gal into /tmp/CTLFireability14303226522950111011.gal : 10 ms
[2026-05-26 14:02:08] [INFO ] Time to serialize properties into /tmp/CTLFireability7200273176665949045.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/CTLFireability14303226522950111011.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7200273176665949045.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.13746e+07,4.71897,121988,1396,211,194769,4027,601,615730,87,32573,0


Converting to forward existential form...Done !
original formula: EG(EX(EF(EG(((i6.i1.u35.p6==1)&&(i6.i1.u37.p111==1))))))
=> equivalent forward existential formula: [FwdG(Init,EX(E(TRUE U EG(((i6.i1.u35.p6==1)&&(i6.i1.u37.p111==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t48, t49, t51, t59, t64, t69, t74, t79, t82, t94, t99, t136, t137, t138, t140, ...798
Using 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 328/328 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 317
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 317
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 110 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 110 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 109 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 109 transition count 292
Applied a total of 31 rules in 12 ms. Remains 109 /123 variables (removed 14) and now considering 292/328 (removed 36) transitions.
[2026-05-26 14:02:38] [INFO ] Flow matrix only has 266 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-15452350332703074098.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1638624898351038133.kers'
[2026-05-26 14:02:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15452350332703074098.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1638624898351038133.kers]
Normalized transition count is 265 out of 266 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 265 rows 109 cols 891 entries
Finished phase 1 with 101 SingleSign rule and 0 generalized
[2026-05-26 14:02:38] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1638624898351038133.kers
Total runtime 2 ms.
[2026-05-26 14:02:38] [INFO ] Implicit Places using invariants in 143 ms returned []
[2026-05-26 14:02:38] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
[2026-05-26 14:02:38] [INFO ] Invariant cache hit.
[2026-05-26 14:02:38] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 14:02:38] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
Running 291 sub problems to find dead transitions.
[2026-05-26 14:02:38] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
[2026-05-26 14:02:38] [INFO ] Invariant cache hit.
[2026-05-26 14:02:38] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (OVERLAPS) 265/374 variables, 109/124 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 1/375 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (OVERLAPS) 0/375 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 162 constraints, problems are : Problem set: 0 solved, 291 unsolved in 24733 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (OVERLAPS) 265/374 variables, 109/124 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 291/452 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/375 variables, and 452 constraints, problems are : Problem set: 0 solved, 291 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 37/38 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54872ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 54874ms
Starting structural reductions in LTL mode, iteration 1 : 109/123 places, 292/328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55465 ms. Remains : 109/123 places, 292/328 transitions.
[2026-05-26 14:03:33] [INFO ] Flatten gal took : 14 ms
[2026-05-26 14:03:33] [INFO ] Flatten gal took : 14 ms
[2026-05-26 14:03:33] [INFO ] Input system was already deterministic with 292 transitions.
[2026-05-26 14:03:33] [INFO ] Flatten gal took : 13 ms
[2026-05-26 14:03:33] [INFO ] Flatten gal took : 13 ms
[2026-05-26 14:03:33] [INFO ] Time to serialize gal into /tmp/CTLFireability17949371454607234121.gal : 3 ms
[2026-05-26 14:03:33] [INFO ] Time to serialize properties into /tmp/CTLFireability1596925668339549370.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17949371454607234121.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1596925668339549370.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.14125e+07,2.22849,53232,2,2412,5,174054,6,0,727,178836,0


Converting to forward existential form...Done !
original formula: EF(((EX(((EG(((p12==1)&&(p29==1))) + E(((p3==1)&&(p85==1)) U ((p3==1)&&(p85==1)))) + (((p8==1)&&(p35==1))||(p29==1)))) * (p11==1)) * (p12...162
=> equivalent forward existential formula: (([FwdG(EY(((FwdU(Init,TRUE) * (p125==1)) * (p11==1))),((p12==1)&&(p29==1)))] != FALSE + [(FwdU(EY(((FwdU(Init,T...337
Hit Full ! (commute/partial/dont) 277/14/15
(forward)formula 0,1,2.78425,53232,1,0,14,174054,21,5,4186,178836,12
FORMULA FireWire-PT-08-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 328/328 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 119 transition count 319
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 119 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 118 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 118 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 116 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 116 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 114 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 114 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 113 transition count 302
Applied a total of 22 rules in 11 ms. Remains 113 /123 variables (removed 10) and now considering 302/328 (removed 26) transitions.
[2026-05-26 14:03:36] [INFO ] Flow matrix only has 276 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-4366011087142167978.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8528666451956608984.kers'
[2026-05-26 14:03:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4366011087142167978.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8528666451956608984.kers]
Normalized transition count is 275 out of 276 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 275 rows 113 cols 929 entries
Finished phase 1 with 105 SingleSign rule and 0 generalized
[2026-05-26 14:03:36] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8528666451956608984.kers
Total runtime 2 ms.
[2026-05-26 14:03:36] [INFO ] Implicit Places using invariants in 172 ms returned []
[2026-05-26 14:03:36] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
[2026-05-26 14:03:36] [INFO ] Invariant cache hit.
[2026-05-26 14:03:36] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-26 14:03:37] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2026-05-26 14:03:37] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
[2026-05-26 14:03:37] [INFO ] Invariant cache hit.
[2026-05-26 14:03:37] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 275/388 variables, 113/128 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 38/166 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (OVERLAPS) 1/389 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (OVERLAPS) 0/389 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 301 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 167 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 275/388 variables, 113/128 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 38/166 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 301/467 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 301 unsolved
SMT process timed out in 60136ms, After SMT, problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Starting structural reductions in LTL mode, iteration 1 : 113/123 places, 302/328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60732 ms. Remains : 113/123 places, 302/328 transitions.
[2026-05-26 14:04:37] [INFO ] Flatten gal took : 9 ms
[2026-05-26 14:04:37] [INFO ] Flatten gal took : 15 ms
[2026-05-26 14:04:37] [INFO ] Input system was already deterministic with 302 transitions.
[2026-05-26 14:04:37] [INFO ] Flatten gal took : 14 ms
[2026-05-26 14:04:37] [INFO ] Flatten gal took : 17 ms
[2026-05-26 14:04:37] [INFO ] Time to serialize gal into /tmp/CTLFireability5178372231486472281.gal : 5 ms
[2026-05-26 14:04:37] [INFO ] Time to serialize properties into /tmp/CTLFireability16977175688615370050.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/CTLFireability5178372231486472281.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16977175688615370050.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.2126e+07,2.17859,52156,2,2550,5,183817,6,0,753,159152,0


Converting to forward existential form...Done !
original formula: AG(!(E((EX(AG(((p10==1)&&(p124==1)))) * ((!(AF(((p8==1)&&(p51==1)))) + EX(((p8==1)&&(p100==1)))) + !(((p12==1)&&(p126==1))))) U ((!(((AG(...229
=> equivalent forward existential formula: (([(FwdU(((FwdU(FwdU(Init,TRUE),(EX(!(E(TRUE U !(((p10==1)&&(p124==1)))))) * ((!(!(EG(!(((p8==1)&&(p51==1)))))) ...707
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...649
(forward)formula 0,0,27.8521,619848,1,0,754,3.5549e+06,642,380,6428,3.52132e+06,849
FORMULA FireWire-PT-08-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 328/328 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 120 transition count 321
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 120 transition count 321
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 120 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 119 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 118 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 110 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 110 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 109 transition count 293
Applied a total of 30 rules in 14 ms. Remains 109 /123 variables (removed 14) and now considering 293/328 (removed 35) transitions.
[2026-05-26 14:05:05] [INFO ] Flow matrix only has 267 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-1728198173166189443.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14733576927221981315.kers'
[2026-05-26 14:05:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1728198173166189443.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14733576927221981315.kers]
Normalized transition count is 266 out of 267 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 266 rows 109 cols 895 entries
Finished phase 1 with 101 SingleSign rule and 0 generalized
[2026-05-26 14:05:05] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14733576927221981315.kers
Total runtime 2 ms.
[2026-05-26 14:05:05] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-26 14:05:05] [INFO ] Flow matrix only has 267 transitions (discarded 26 similar events)
[2026-05-26 14:05:05] [INFO ] Invariant cache hit.
[2026-05-26 14:05:05] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 14:05:05] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2026-05-26 14:05:05] [INFO ] Flow matrix only has 267 transitions (discarded 26 similar events)
[2026-05-26 14:05:05] [INFO ] Invariant cache hit.
[2026-05-26 14:05:05] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 266/375 variables, 109/123 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 37/160 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (OVERLAPS) 1/376 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (OVERLAPS) 0/376 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 161 constraints, problems are : Problem set: 0 solved, 292 unsolved in 21984 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 266/375 variables, 109/123 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 37/160 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 292/452 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 375/376 variables, and 452 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 37/38 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52100ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 52102ms
Starting structural reductions in LTL mode, iteration 1 : 109/123 places, 293/328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52463 ms. Remains : 109/123 places, 293/328 transitions.
[2026-05-26 14:05:58] [INFO ] Flatten gal took : 14 ms
[2026-05-26 14:05:58] [INFO ] Flatten gal took : 13 ms
[2026-05-26 14:05:58] [INFO ] Input system was already deterministic with 293 transitions.
[2026-05-26 14:05:58] [INFO ] Flatten gal took : 13 ms
[2026-05-26 14:05:58] [INFO ] Flatten gal took : 13 ms
[2026-05-26 14:05:58] [INFO ] Time to serialize gal into /tmp/CTLFireability16514282480867842841.gal : 4 ms
[2026-05-26 14:05:58] [INFO ] Time to serialize properties into /tmp/CTLFireability11333494893302610783.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/CTLFireability16514282480867842841.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11333494893302610783.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.19299e+07,7.59897,169048,2,6289,5,460712,6,0,728,606072,0


Converting to forward existential form...Done !
original formula: (EF((((AX(FALSE) + (p7==0)) + ((p126==0)||(p37==1))) * (E(EX(((p5==1)&&(p72==1))) U E(((p10==1)&&(p44==1)) U ((p10==1)&&(p57==1)))) + EF(...258
=> equivalent forward existential formula: ([((EY((Init * E(TRUE U (((!(EX(!(FALSE))) + (p7==0)) + ((p126==0)||(p37==1))) * (E(EX(((p5==1)&&(p72==1))) U E(...588
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...624
Detected timeout of ITS tools.
[2026-05-26 14:06:28] [INFO ] Flatten gal took : 7 ms
[2026-05-26 14:06:28] [INFO ] Applying decomposition
[2026-05-26 14:06:28] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8900533725008013937.txt' '-o' '/tmp/graph8900533725008013937.bin' '-w' '/tmp/graph8900533725008013937.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8900533725008013937.bin' '-l' '-1' '-v' '-w' '/tmp/graph8900533725008013937.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:06:28] [INFO ] Decomposing Gal with order
[2026-05-26 14:06:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:06:28] [INFO ] Removed a total of 446 redundant transitions.
[2026-05-26 14:06:28] [INFO ] Flatten gal took : 25 ms
[2026-05-26 14:06:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 83 labels/synchronizations in 13 ms.
[2026-05-26 14:06:28] [INFO ] Time to serialize gal into /tmp/CTLFireability2167007328151387999.gal : 3 ms
[2026-05-26 14:06:28] [INFO ] Time to serialize properties into /tmp/CTLFireability14143903235315280558.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/CTLFireability2167007328151387999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14143903235315280558.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.19299e+07,7.23782,142012,1682,180,177088,1808,558,705232,90,18631,0


Converting to forward existential form...Done !
original formula: (EF((((AX(FALSE) + (i2.u2.p7==0)) + ((i6.u34.p126==0)||(i3.u12.p37==1))) * (E(EX(((i1.u1.p5==1)&&(i1.u23.p72==1))) U E(((i4.u3.p10==1)&&(...365
=> equivalent forward existential formula: ([((EY((Init * E(TRUE U (((!(EX(!(FALSE))) + (i2.u2.p7==0)) + ((i6.u34.p126==0)||(i3.u12.p37==1))) * (E(EX(((i1....783
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t45, t48, t49, t59, t64, t69, t74, t79, t82, t94, t99, t138, t139, t140, t142, ...782
(forward)formula 0,1,23.9902,369672,1,0,463016,4440,2865,2.24659e+06,370,24957,854493
FORMULA FireWire-PT-08-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 328/328 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 317
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 317
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 110 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 110 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 109 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 109 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 108 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 108 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 107 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 107 transition count 288
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 106 transition count 287
Applied a total of 37 rules in 37 ms. Remains 106 /123 variables (removed 17) and now considering 287/328 (removed 41) transitions.
[2026-05-26 14:06:52] [INFO ] Flow matrix only has 261 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-5117657915008068011.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8370258705819675985.kers'
[2026-05-26 14:06:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5117657915008068011.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8370258705819675985.kers]
Normalized transition count is 260 out of 261 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 260 rows 106 cols 873 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-26 14:06:52] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8370258705819675985.kers
Total runtime 3 ms.
[2026-05-26 14:06:52] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-26 14:06:52] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2026-05-26 14:06:52] [INFO ] Invariant cache hit.
[2026-05-26 14:06:52] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 14:06:52] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2026-05-26 14:06:52] [INFO ] Redundant transitions in 4 ms returned []
Running 286 sub problems to find dead transitions.
[2026-05-26 14:06:52] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2026-05-26 14:06:52] [INFO ] Invariant cache hit.
[2026-05-26 14:06:52] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/120 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/157 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 158 constraints, problems are : Problem set: 0 solved, 286 unsolved in 19641 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/120 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/157 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 286/443 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 367/367 variables, and 444 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49718ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 49719ms
Starting structural reductions in SI_CTL mode, iteration 1 : 106/123 places, 287/328 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50112 ms. Remains : 106/123 places, 287/328 transitions.
[2026-05-26 14:07:42] [INFO ] Flatten gal took : 6 ms
[2026-05-26 14:07:42] [INFO ] Flatten gal took : 7 ms
[2026-05-26 14:07:42] [INFO ] Input system was already deterministic with 287 transitions.
[2026-05-26 14:07:42] [INFO ] Flatten gal took : 8 ms
[2026-05-26 14:07:42] [INFO ] Flatten gal took : 16 ms
[2026-05-26 14:07:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2811424462581364989.gal : 2 ms
[2026-05-26 14:07:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality915792339986187626.prop : 9 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/ReachabilityCardinality2811424462581364989.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality915792339986187626.prop' '--nowitness' '--gen-order' 'FOLLOW'

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 ...327
RANDOM walk for 40000 steps (2225 resets) in 213 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (553 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1906 steps, run visited all 1 properties in 9 ms. (steps per millisecond=211 )
Probabilistic random walk after 1906 steps, saw 1002 distinct states, run finished after 9 ms. (steps per millisecond=211 ) properties seen :1
FORMULA FireWire-PT-08-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
Loading property file /tmp/ReachabilityCardinality915792339986187626.prop.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 328/328 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 117 transition count 316
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 117 transition count 316
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 106 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 105 transition count 286
Applied a total of 37 rules in 46 ms. Remains 105 /123 variables (removed 18) and now considering 286/328 (removed 42) transitions.
[2026-05-26 14:07:42] [INFO ] Flow matrix only has 260 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-10098627751779176257.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17580104437491687296.kers'
[2026-05-26 14:07:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10098627751779176257.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17580104437491687296.kers]
Normalized transition count is 259 out of 260 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 259 rows 103 cols 855 entries
Finished phase 1 with 97 SingleSign rule and 0 generalized
[2026-05-26 14:07:42] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17580104437491687296.kers
Total runtime 2 ms.
[2026-05-26 14:07:42] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-26 14:07:42] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
[2026-05-26 14:07:42] [INFO ] Invariant cache hit.
[2026-05-26 14:07:42] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-26 14:07:43] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2026-05-26 14:07:43] [INFO ] Redundant transitions in 3 ms returned []
Running 283 sub problems to find dead transitions.
[2026-05-26 14:07:43] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
[2026-05-26 14:07:43] [INFO ] Invariant cache hit.
[2026-05-26 14:07:43] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 259/363 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 36/156 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (OVERLAPS) 1/364 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 0/364 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/365 variables, and 158 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 259/363 variables, 104/121 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 36/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 283/440 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/364 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/365 variables, and 441 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60142ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in SI_CTL mode, iteration 1 : 105/123 places, 286/328 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60606 ms. Remains : 105/123 places, 286/328 transitions.
[2026-05-26 14:08:43] [INFO ] Flatten gal took : 9 ms
[2026-05-26 14:08:43] [INFO ] Flatten gal took : 10 ms
[2026-05-26 14:08:43] [INFO ] Input system was already deterministic with 286 transitions.
[2026-05-26 14:08:43] [INFO ] Flatten gal took : 11 ms
[2026-05-26 14:08:43] [INFO ] Flatten gal took : 11 ms
[2026-05-26 14:08:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3031364089339263644.gal : 4 ms
[2026-05-26 14:08:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4621467593491329371.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3031364089339263644.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4621467593491329371.prop' '--nowitness' '--gen-order' 'FOLLOW'

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 ...328
RANDOM walk for 40000 steps (2296 resets) in 266 ms. (149 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality4621467593491329371.prop.
BEST_FIRST walk for 40003 steps (574 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 18
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :18 after 41
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :41 after 74
Finished probabilistic random walk after 13744 steps, run visited all 1 properties in 55 ms. (steps per millisecond=249 )
Probabilistic random walk after 13744 steps, saw 4988 distinct states, run finished after 55 ms. (steps per millisecond=249 ) properties seen :1
FORMULA FireWire-PT-08-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 328/328 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 117 transition count 316
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 117 transition count 316
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 109 transition count 293
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 108 transition count 292
Applied a total of 31 rules in 40 ms. Remains 108 /123 variables (removed 15) and now considering 292/328 (removed 36) transitions.
[2026-05-26 14:08:43] [INFO ] Flow matrix only has 266 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-2584256900334403974.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15972135166994451180.kers'
[2026-05-26 14:08:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2584256900334403974.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15972135166994451180.kers]
Normalized transition count is 265 out of 266 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 265 rows 106 cols 879 entries
Finished phase 1 with 100 SingleSign rule and 0 generalized
[2026-05-26 14:08:43] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15972135166994451180.kers
Total runtime 2 ms.
[2026-05-26 14:08:43] [INFO ] Implicit Places using invariants in 150 ms returned []
[2026-05-26 14:08:43] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
[2026-05-26 14:08:43] [INFO ] Invariant cache hit.
[2026-05-26 14:08:43] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-26 14:08:44] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
[2026-05-26 14:08:44] [INFO ] Redundant transitions in 3 ms returned []
Running 289 sub problems to find dead transitions.
[2026-05-26 14:08:44] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
[2026-05-26 14:08:44] [INFO ] Invariant cache hit.
[2026-05-26 14:08:44] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (OVERLAPS) 265/372 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 36/160 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 1/373 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 373/374 variables, and 161 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (OVERLAPS) 265/372 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 36/160 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 289/449 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/374 variables, and 452 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/108 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Starting structural reductions in SI_CTL mode, iteration 1 : 108/123 places, 292/328 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60673 ms. Remains : 108/123 places, 292/328 transitions.
[2026-05-26 14:09:44] [INFO ] Flatten gal took : 9 ms
[2026-05-26 14:09:44] [INFO ] Flatten gal took : 10 ms
[2026-05-26 14:09:44] [INFO ] Input system was already deterministic with 292 transitions.
[2026-05-26 14:09:44] [INFO ] Flatten gal took : 11 ms
[2026-05-26 14:09:44] [INFO ] Flatten gal took : 11 ms
[2026-05-26 14:09:44] [INFO ] Time to serialize gal into /tmp/CTLFireability12909004742590208604.gal : 3 ms
[2026-05-26 14:09:44] [INFO ] Time to serialize properties into /tmp/CTLFireability4477512878670333595.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/CTLFireability12909004742590208604.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4477512878670333595.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.34039e+06,5.84456,121624,2,6058,5,342699,6,0,723,432177,0


Converting to forward existential form...Done !
original formula: EF(((AG(A(((p7==1)&&(p59==1)) U ((p9==1)&&(p123==1)))) * ((p4==0)||(p84==0))) * (((p3==0)||(p85==0))&&(((p9==0)||(p123==0))||((p3==0)||(p...166
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (((p3==0)||(p85==0))&&(((p9==0)||(p123==0))||((p3==0)||(p89==0))))) * ((p4==0)||(p84==0)))...299
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...625
Detected timeout of ITS tools.
[2026-05-26 14:10:14] [INFO ] Flatten gal took : 6 ms
[2026-05-26 14:10:14] [INFO ] Applying decomposition
[2026-05-26 14:10:14] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9465596624116784828.txt' '-o' '/tmp/graph9465596624116784828.bin' '-w' '/tmp/graph9465596624116784828.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9465596624116784828.bin' '-l' '-1' '-v' '-w' '/tmp/graph9465596624116784828.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:10:14] [INFO ] Decomposing Gal with order
[2026-05-26 14:10:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:10:14] [INFO ] Removed a total of 445 redundant transitions.
[2026-05-26 14:10:14] [INFO ] Flatten gal took : 19 ms
[2026-05-26 14:10:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 12 ms.
[2026-05-26 14:10:14] [INFO ] Time to serialize gal into /tmp/CTLFireability7407408666327429697.gal : 3 ms
[2026-05-26 14:10:14] [INFO ] Time to serialize properties into /tmp/CTLFireability12679456246535393065.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/CTLFireability7407408666327429697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12679456246535393065.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.34039e+06,3.97509,102288,1534,200,156907,2014,594,470177,86,14420,0


Converting to forward existential form...Done !
original formula: EF(((AG(A(((i2.u2.p7==1)&&(i3.u19.p59==1)) U ((i1.i1.u3.p9==1)&&(i1.i1.u3.p123==1)))) * ((i1.i0.u1.p4==0)||(i1.i1.u29.p84==0))) * (((i0.u...263
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (((i0.u0.p3==0)||(i1.i1.u29.p85==0))&&(((i1.i1.u3.p9==0)||(i1.i1.u3.p123==0))||((i0.u0.p3=...432
Reverse transition relation is NOT exact ! Due to transitions t5, t41, t43, t47, t48, t50, t58, t63, t68, t73, t76, t90, t91, t92, t93, t98, t139, t141, t1...795
Using 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 a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,22.3183,498640,1,0,724788,8460,3132,2.61775e+06,377,58258,1318035
FORMULA FireWire-PT-08-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 328/328 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 119 transition count 320
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 119 transition count 320
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 119 transition count 317
Applied a total of 11 rules in 2 ms. Remains 119 /123 variables (removed 4) and now considering 317/328 (removed 11) transitions.
[2026-05-26 14:10:36] [INFO ] Flow matrix only has 291 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-5074178581674965666.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12699219844949334695.kers'
[2026-05-26 14:10:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5074178581674965666.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12699219844949334695.kers]
Normalized transition count is 290 out of 291 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 119 cols 981 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-26 14:10:36] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12699219844949334695.kers
Total runtime 2 ms.
[2026-05-26 14:10:36] [INFO ] Implicit Places using invariants in 146 ms returned []
[2026-05-26 14:10:36] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2026-05-26 14:10:36] [INFO ] Invariant cache hit.
[2026-05-26 14:10:37] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-26 14:10:37] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
Running 316 sub problems to find dead transitions.
[2026-05-26 14:10:37] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2026-05-26 14:10:37] [INFO ] Invariant cache hit.
[2026-05-26 14:10:37] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 290/409 variables, 119/134 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 42/176 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (OVERLAPS) 1/410 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 9 (OVERLAPS) 0/410 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 177 constraints, problems are : Problem set: 0 solved, 316 unsolved in 26688 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 290/409 variables, 119/134 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 42/176 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 316/492 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 409/410 variables, and 492 constraints, problems are : Problem set: 0 solved, 316 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 42/43 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56827ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 56828ms
Starting structural reductions in LTL mode, iteration 1 : 119/123 places, 317/328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57411 ms. Remains : 119/123 places, 317/328 transitions.
[2026-05-26 14:11:34] [INFO ] Flatten gal took : 10 ms
[2026-05-26 14:11:34] [INFO ] Flatten gal took : 11 ms
[2026-05-26 14:11:34] [INFO ] Input system was already deterministic with 317 transitions.
[2026-05-26 14:11:34] [INFO ] Flatten gal took : 23 ms
[2026-05-26 14:11:34] [INFO ] Flatten gal took : 11 ms
[2026-05-26 14:11:34] [INFO ] Time to serialize gal into /tmp/CTLFireability9371802367835916553.gal : 3 ms
[2026-05-26 14:11:34] [INFO ] Time to serialize properties into /tmp/CTLFireability9463485106586931837.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/CTLFireability9371802367835916553.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9463485106586931837.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.16095e+07,0.866351,21596,2,2300,5,63821,6,0,792,56410,0


Converting to forward existential form...Done !
original formula: EF(((AF((((p10==0)||(p88==0))&&((p9==0)||(p75==0)))) * EX(EG(((((p6==0)||(p60==0))&&(p9==1))&&(p89==1))))) * (EX(((p8==0)||(p59==0))) + (...177
=> equivalent forward existential formula: ([(EY((FwdU(Init,TRUE) * (!(EG(!((((p10==0)||(p88==0))&&((p9==0)||(p75==0)))))) * EX(EG(((((p6==0)||(p60==0))&&(...379
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...690
(forward)formula 0,0,2.4219,53408,1,0,621,238674,657,308,6631,219174,694
FORMULA FireWire-PT-08-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 328/328 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 117 transition count 316
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 117 transition count 316
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 106 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 105 transition count 286
Applied a total of 37 rules in 29 ms. Remains 105 /123 variables (removed 18) and now considering 286/328 (removed 42) transitions.
[2026-05-26 14:11:36] [INFO ] Flow matrix only has 260 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-420007580689248976.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-776148228040167010.kers'
[2026-05-26 14:11:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-420007580689248976.kers, --Pflows, --basisKERS=/tmp/petrispot-output-776148228040167010.kers]
Normalized transition count is 259 out of 260 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 259 rows 103 cols 855 entries
Finished phase 1 with 97 SingleSign rule and 0 generalized
[2026-05-26 14:11:36] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-776148228040167010.kers
Total runtime 2 ms.
[2026-05-26 14:11:36] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-26 14:11:36] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
[2026-05-26 14:11:36] [INFO ] Invariant cache hit.
[2026-05-26 14:11:37] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-26 14:11:37] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2026-05-26 14:11:37] [INFO ] Redundant transitions in 3 ms returned []
Running 283 sub problems to find dead transitions.
[2026-05-26 14:11:37] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
[2026-05-26 14:11:37] [INFO ] Invariant cache hit.
[2026-05-26 14:11:37] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 259/363 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 36/156 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (OVERLAPS) 1/364 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 0/364 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/365 variables, and 158 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 259/363 variables, 104/121 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 36/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 283/440 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/364 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/365 variables, and 441 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60122ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Starting structural reductions in SI_CTL mode, iteration 1 : 105/123 places, 286/328 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60663 ms. Remains : 105/123 places, 286/328 transitions.
[2026-05-26 14:12:37] [INFO ] Flatten gal took : 9 ms
[2026-05-26 14:12:37] [INFO ] Flatten gal took : 10 ms
[2026-05-26 14:12:37] [INFO ] Input system was already deterministic with 286 transitions.
[2026-05-26 14:12:37] [INFO ] Flatten gal took : 10 ms
[2026-05-26 14:12:37] [INFO ] Flatten gal took : 9 ms
[2026-05-26 14:12:37] [INFO ] Time to serialize gal into /tmp/CTLFireability9074156939624858964.gal : 3 ms
[2026-05-26 14:12:37] [INFO ] Time to serialize properties into /tmp/CTLFireability18100436195999133884.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/CTLFireability9074156939624858964.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18100436195999133884.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.2827e+06,4.72154,105788,2,5120,5,297236,6,0,705,383219,0


Converting to forward existential form...Done !
original formula: EF((AG((EF(((p8==1)&&(p26==1))) + ((p8==1)&&(p26==1)))) + AG(((p6==1)&&(p27==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((E(TRUE U ((p8==1)&&(p26==1))) + ((p8==1)&&(p26==1)))))))] != FALSE + [(FwdU(I...214
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...612
Detected timeout of ITS tools.
[2026-05-26 14:13:07] [INFO ] Flatten gal took : 5 ms
[2026-05-26 14:13:07] [INFO ] Applying decomposition
[2026-05-26 14:13:07] [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/graph6855232701800771261.txt' '-o' '/tmp/graph6855232701800771261.bin' '-w' '/tmp/graph6855232701800771261.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6855232701800771261.bin' '-l' '-1' '-v' '-w' '/tmp/graph6855232701800771261.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:13:07] [INFO ] Decomposing Gal with order
[2026-05-26 14:13:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:13:07] [INFO ] Removed a total of 433 redundant transitions.
[2026-05-26 14:13:07] [INFO ] Flatten gal took : 17 ms
[2026-05-26 14:13:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 9 ms.
[2026-05-26 14:13:07] [INFO ] Time to serialize gal into /tmp/CTLFireability5337738068167865577.gal : 2 ms
[2026-05-26 14:13:07] [INFO ] Time to serialize properties into /tmp/CTLFireability13929072488978242728.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/CTLFireability5337738068167865577.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13929072488978242728.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.2827e+06,3.48785,89448,1508,204,113998,2265,598,522401,86,18128,0


Converting to forward existential form...Done !
original formula: EF((AG((EF(((i2.u2.p8==1)&&(i2.u8.p26==1))) + ((i2.u2.p8==1)&&(i2.u8.p26==1)))) + AG(((i4.i1.u36.p6==1)&&(i2.u9.p27==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((E(TRUE U ((i2.u2.p8==1)&&(i2.u8.p26==1))) + ((i2.u2.p8==1)&&(i2.u8.p26==1))))...254
Reverse transition relation is NOT exact ! Due to transitions t5, t41, t43, t47, t48, t50, t58, t63, t68, t73, t78, t81, t93, t98, t135, t136, t137, t139, ...809
(forward)formula 0,0,17.1382,396580,1,0,499934,7185,2713,2.72546e+06,359,45247,944903
FORMULA FireWire-PT-08-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 328/328 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 117 transition count 316
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 117 transition count 316
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 106 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 105 transition count 286
Applied a total of 37 rules in 28 ms. Remains 105 /123 variables (removed 18) and now considering 286/328 (removed 42) transitions.
[2026-05-26 14:13:24] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
[2026-05-26 14:13:24] [INFO ] Invariant cache hit.
[2026-05-26 14:13:24] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-26 14:13:24] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
[2026-05-26 14:13:24] [INFO ] Invariant cache hit.
[2026-05-26 14:13:25] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-26 14:13:25] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2026-05-26 14:13:25] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_CTL mode, iteration 1 : 105/123 places, 286/328 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 369 ms. Remains : 105/123 places, 286/328 transitions.
[2026-05-26 14:13:25] [INFO ] Flatten gal took : 5 ms
[2026-05-26 14:13:25] [INFO ] Flatten gal took : 6 ms
[2026-05-26 14:13:25] [INFO ] Input system was already deterministic with 286 transitions.
[2026-05-26 14:13:25] [INFO ] Flatten gal took : 6 ms
[2026-05-26 14:13:25] [INFO ] Flatten gal took : 5 ms
[2026-05-26 14:13:25] [INFO ] Time to serialize gal into /tmp/CTLFireability4738260617424865709.gal : 2 ms
[2026-05-26 14:13:25] [INFO ] Time to serialize properties into /tmp/CTLFireability1172804240291481676.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/CTLFireability4738260617424865709.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1172804240291481676.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.2827e+06,3.96908,105868,2,5120,5,297236,6,0,705,383219,0


Converting to forward existential form...Done !
original formula: AF((AF(((p7==0)||(p103==0))) * AG(((p8==0)||(p100==0)))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!(((p7==0)||(p103==0))))) * !(E(TRUE U !(((p8==0)||(p100==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...612
Detected timeout of ITS tools.
[2026-05-26 14:13:55] [INFO ] Flatten gal took : 6 ms
[2026-05-26 14:13:55] [INFO ] Applying decomposition
[2026-05-26 14:13:55] [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/graph15518559194924018298.txt' '-o' '/tmp/graph15518559194924018298.bin' '-w' '/tmp/graph15518559194924018298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15518559194924018298.bin' '-l' '-1' '-v' '-w' '/tmp/graph15518559194924018298.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:13:55] [INFO ] Decomposing Gal with order
[2026-05-26 14:13:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:13:55] [INFO ] Removed a total of 433 redundant transitions.
[2026-05-26 14:13:55] [INFO ] Flatten gal took : 18 ms
[2026-05-26 14:13:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 6 ms.
[2026-05-26 14:13:55] [INFO ] Time to serialize gal into /tmp/CTLFireability11208514982227373792.gal : 3 ms
[2026-05-26 14:13:55] [INFO ] Time to serialize properties into /tmp/CTLFireability15978641159042949459.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/CTLFireability11208514982227373792.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15978641159042949459.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.2827e+06,9.83944,224892,2485,222,222814,1774,514,1.73333e+06,86,18183,0


Converting to forward existential form...Done !
original formula: AF((AF(((i4.u2.p7==0)||(i7.u37.p103==0))) * AG(((i4.u2.p8==0)||(i7.u33.p100==0)))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!(((i4.u2.p7==0)||(i7.u37.p103==0))))) * !(E(TRUE U !(((i4.u2.p8==0)||(i7.u33.p100==0))))))))...164
Reverse transition relation is NOT exact ! Due to transitions t5, t41, t43, t47, t48, t50, t58, t63, t68, t73, t78, t81, t90, t91, t92, t93, t98, t139, t14...769
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 a local 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 328/328 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 119 transition count 319
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 119 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 118 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 118 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 116 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 116 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 114 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 114 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 112 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 112 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 111 transition count 297
Applied a total of 26 rules in 13 ms. Remains 111 /123 variables (removed 12) and now considering 297/328 (removed 31) transitions.
[2026-05-26 14:14:25] [INFO ] Flow matrix only has 271 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-14804235179537443914.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10132772370854565741.kers'
[2026-05-26 14:14:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14804235179537443914.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10132772370854565741.kers]
Normalized transition count is 270 out of 271 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 270 rows 111 cols 911 entries
Finished phase 1 with 103 SingleSign rule and 0 generalized
[2026-05-26 14:14:25] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10132772370854565741.kers
Total runtime 1 ms.
[2026-05-26 14:14:25] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-26 14:14:25] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
[2026-05-26 14:14:25] [INFO ] Invariant cache hit.
[2026-05-26 14:14:25] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 14:14:25] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Running 296 sub problems to find dead transitions.
[2026-05-26 14:14:25] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
[2026-05-26 14:14:25] [INFO ] Invariant cache hit.
[2026-05-26 14:14:25] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (OVERLAPS) 270/381 variables, 111/126 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 37/163 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (OVERLAPS) 1/382 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 10 (OVERLAPS) 0/382 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 165 constraints, problems are : Problem set: 0 solved, 296 unsolved in 27323 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (OVERLAPS) 270/381 variables, 111/127 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 37/164 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 296/460 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/382 variables, and 460 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 37/38 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57425ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 57425ms
Starting structural reductions in LTL mode, iteration 1 : 111/123 places, 297/328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57768 ms. Remains : 111/123 places, 297/328 transitions.
[2026-05-26 14:15:23] [INFO ] Flatten gal took : 9 ms
[2026-05-26 14:15:23] [INFO ] Flatten gal took : 10 ms
[2026-05-26 14:15:23] [INFO ] Input system was already deterministic with 297 transitions.
[2026-05-26 14:15:23] [INFO ] Flatten gal took : 10 ms
[2026-05-26 14:15:23] [INFO ] Flatten gal took : 10 ms
[2026-05-26 14:15:23] [INFO ] Time to serialize gal into /tmp/CTLFireability3819253255043537659.gal : 2 ms
[2026-05-26 14:15:23] [INFO ] Time to serialize properties into /tmp/CTLFireability5509516101284047600.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/CTLFireability3819253255043537659.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5509516101284047600.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.20843e+07,2.33624,53172,2,2413,5,179945,6,0,740,173725,0


Converting to forward existential form...Done !
original formula: EG(AF(((AX(AX(((p9==0)||(p40==0)))) * AG(((p8==0)||(p102==0)))) * (EX((p27==0)) * (((p11==1)&&(p39==1))||(((p8==0)||(p109==0))&&((p4==0)|...172
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((!(EX(!(!(EX(!(((p9==0)||(p40==0)))))))) * !(E(TRUE U !(((p8==0)||(p102==0)))))) * (EX((p27==...245
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...637
Detected timeout of ITS tools.
[2026-05-26 14:15:53] [INFO ] Flatten gal took : 8 ms
[2026-05-26 14:15:53] [INFO ] Applying decomposition
[2026-05-26 14:15:53] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7780778174060492155.txt' '-o' '/tmp/graph7780778174060492155.bin' '-w' '/tmp/graph7780778174060492155.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7780778174060492155.bin' '-l' '-1' '-v' '-w' '/tmp/graph7780778174060492155.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:15:53] [INFO ] Decomposing Gal with order
[2026-05-26 14:15:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:15:53] [INFO ] Removed a total of 442 redundant transitions.
[2026-05-26 14:15:53] [INFO ] Flatten gal took : 18 ms
[2026-05-26 14:15:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 4 ms.
[2026-05-26 14:15:53] [INFO ] Time to serialize gal into /tmp/CTLFireability3571161695856531332.gal : 3 ms
[2026-05-26 14:15:53] [INFO ] Time to serialize properties into /tmp/CTLFireability4811962628450128068.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/CTLFireability3571161695856531332.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4811962628450128068.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.20843e+07,7.69713,213120,3308,219,319574,1900,548,1.22882e+06,98,18541,0


Converting to forward existential form...Done !
original formula: EG(AF(((AX(AX(((i1.u3.p9==0)||(i1.u13.p40==0)))) * AG(((i2.u2.p8==0)||(i6.u36.p102==0)))) * (EX((i2.u9.p27==0)) * (((i1.u3.p11==1)&&(i1.u...245
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((!(EX(!(!(EX(!(((i1.u3.p9==0)||(i1.u13.p40==0)))))))) * !(E(TRUE U !(((i2.u2.p8==0)||(i6.u36....318
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t48, t49, t51, t60, t65, t70, t75, t76, t77, t78, t91, t92, t93, t95, t100, t14...805
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 328/328 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 317
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 317
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 112 transition count 299
Applied a total of 25 rules in 8 ms. Remains 112 /123 variables (removed 11) and now considering 299/328 (removed 29) transitions.
[2026-05-26 14:16:23] [INFO ] Flow matrix only has 273 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-1088922652658900509.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1204853231608263462.kers'
[2026-05-26 14:16:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1088922652658900509.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1204853231608263462.kers]
Normalized transition count is 272 out of 273 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 272 rows 112 cols 917 entries
Finished phase 1 with 104 SingleSign rule and 0 generalized
[2026-05-26 14:16:23] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1204853231608263462.kers
Total runtime 3 ms.
[2026-05-26 14:16:23] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-26 14:16:23] [INFO ] Flow matrix only has 273 transitions (discarded 26 similar events)
[2026-05-26 14:16:23] [INFO ] Invariant cache hit.
[2026-05-26 14:16:23] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-26 14:16:23] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 298 sub problems to find dead transitions.
[2026-05-26 14:16:23] [INFO ] Flow matrix only has 273 transitions (discarded 26 similar events)
[2026-05-26 14:16:23] [INFO ] Invariant cache hit.
[2026-05-26 14:16:23] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 272/384 variables, 112/127 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (OVERLAPS) 1/385 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 9 (OVERLAPS) 0/385 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 166 constraints, problems are : Problem set: 0 solved, 298 unsolved in 25442 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 272/384 variables, 112/127 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 298/463 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/385 variables, and 463 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 38/39 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55560ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 55562ms
Starting structural reductions in LTL mode, iteration 1 : 112/123 places, 299/328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55988 ms. Remains : 112/123 places, 299/328 transitions.
[2026-05-26 14:17:19] [INFO ] Flatten gal took : 9 ms
[2026-05-26 14:17:19] [INFO ] Flatten gal took : 10 ms
[2026-05-26 14:17:19] [INFO ] Input system was already deterministic with 299 transitions.
[2026-05-26 14:17:19] [INFO ] Flatten gal took : 10 ms
[2026-05-26 14:17:19] [INFO ] Flatten gal took : 10 ms
[2026-05-26 14:17:19] [INFO ] Time to serialize gal into /tmp/CTLFireability6436281543763468124.gal : 2 ms
[2026-05-26 14:17:19] [INFO ] Time to serialize properties into /tmp/CTLFireability1793690736550727608.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/CTLFireability6436281543763468124.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1793690736550727608.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.14717e+07,2.03771,44736,2,2394,5,154031,6,0,746,141771,0


Converting to forward existential form...Done !
original formula: AG((((AX((((p10==0)||(p47==0))&&((p12==0)||(p101==0)))) * (!(E(((p10==1)&&(p88==1)) U ((p8==1)&&(p103==1)))) + ((p4==1)&&(p82==1)))) + ((...198
=> equivalent forward existential formula: ([(EY(((FwdU(Init,TRUE) * !(((p8==1)&&(p103==1)))) * !(((p7==1)&&(p99==1))))) * !((((p10==0)||(p47==0))&&((p12==...344
Hit Full ! (commute/partial/dont) 258/40/41
(forward)formula 0,0,2.14134,44736,1,0,20,154031,22,9,1575,141771,8
FORMULA FireWire-PT-08-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 328/328 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 317
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 317
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 110 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 110 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 109 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 109 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 108 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 108 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 107 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 107 transition count 288
Applied a total of 35 rules in 10 ms. Remains 107 /123 variables (removed 16) and now considering 288/328 (removed 40) transitions.
[2026-05-26 14:17:21] [INFO ] Flow matrix only has 262 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-12955581007600600200.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6510124816930167058.kers'
[2026-05-26 14:17:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12955581007600600200.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6510124816930167058.kers]
Normalized transition count is 261 out of 262 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 261 rows 107 cols 875 entries
Finished phase 1 with 99 SingleSign rule and 0 generalized
[2026-05-26 14:17:21] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6510124816930167058.kers
Total runtime 3 ms.
[2026-05-26 14:17:21] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-26 14:17:21] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2026-05-26 14:17:21] [INFO ] Invariant cache hit.
[2026-05-26 14:17:22] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 14:17:22] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2026-05-26 14:17:22] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2026-05-26 14:17:22] [INFO ] Invariant cache hit.
[2026-05-26 14:17:22] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/368 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 159 constraints, problems are : Problem set: 0 solved, 287 unsolved in 28795 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/368 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 287/445 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/369 variables, and 445 constraints, problems are : Problem set: 0 solved, 287 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 37/38 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58920ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 58921ms
Starting structural reductions in LTL mode, iteration 1 : 107/123 places, 288/328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59441 ms. Remains : 107/123 places, 288/328 transitions.
[2026-05-26 14:18:21] [INFO ] Flatten gal took : 8 ms
[2026-05-26 14:18:21] [INFO ] Flatten gal took : 9 ms
[2026-05-26 14:18:21] [INFO ] Input system was already deterministic with 288 transitions.
[2026-05-26 14:18:21] [INFO ] Flatten gal took : 8 ms
[2026-05-26 14:18:21] [INFO ] Flatten gal took : 9 ms
[2026-05-26 14:18:21] [INFO ] Time to serialize gal into /tmp/CTLFireability4452681504110644157.gal : 2 ms
[2026-05-26 14:18:21] [INFO ] Time to serialize properties into /tmp/CTLFireability5828965530465614522.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/CTLFireability4452681504110644157.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5828965530465614522.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13746e+07,7.52049,162728,2,6093,5,443377,6,0,715,562005,0


Converting to forward existential form...Done !
original formula: AX(EF(((p9==1)&&(p73==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((p9==1)&&(p73==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...618
Detected timeout of ITS tools.
[2026-05-26 14:18:51] [INFO ] Flatten gal took : 6 ms
[2026-05-26 14:18:51] [INFO ] Applying decomposition
[2026-05-26 14:18:51] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15539774046772561792.txt' '-o' '/tmp/graph15539774046772561792.bin' '-w' '/tmp/graph15539774046772561792.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15539774046772561792.bin' '-l' '-1' '-v' '-w' '/tmp/graph15539774046772561792.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:18:51] [INFO ] Decomposing Gal with order
[2026-05-26 14:18:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:18:51] [INFO ] Removed a total of 437 redundant transitions.
[2026-05-26 14:18:51] [INFO ] Flatten gal took : 16 ms
[2026-05-26 14:18:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 7 ms.
[2026-05-26 14:18:51] [INFO ] Time to serialize gal into /tmp/CTLFireability18091167784614474386.gal : 4 ms
[2026-05-26 14:18:51] [INFO ] Time to serialize properties into /tmp/CTLFireability17360468561160939659.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/CTLFireability18091167784614474386.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17360468561160939659.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.13746e+07,29.8266,532936,2398,226,621954,6190,614,3.26701e+06,87,45842,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 328/328 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 120 transition count 322
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 120 transition count 322
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 120 transition count 320
Applied a total of 8 rules in 3 ms. Remains 120 /123 variables (removed 3) and now considering 320/328 (removed 8) transitions.
[2026-05-26 14:19:21] [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-4186005782666374308.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7228847665816206227.kers'
[2026-05-26 14:19:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4186005782666374308.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7228847665816206227.kers]
Normalized transition count is 293 out of 294 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 293 rows 120 cols 993 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-26 14:19:21] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7228847665816206227.kers
Total runtime 2 ms.
[2026-05-26 14:19:21] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-26 14:19:21] [INFO ] Flow matrix only has 294 transitions (discarded 26 similar events)
[2026-05-26 14:19:21] [INFO ] Invariant cache hit.
[2026-05-26 14:19:21] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-26 14:19:21] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
Running 319 sub problems to find dead transitions.
[2026-05-26 14:19:21] [INFO ] Flow matrix only has 294 transitions (discarded 26 similar events)
[2026-05-26 14:19:21] [INFO ] Invariant cache hit.
[2026-05-26 14:19:21] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (OVERLAPS) 293/413 variables, 120/135 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 42/177 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (OVERLAPS) 1/414 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 9 (OVERLAPS) 0/414 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 178 constraints, problems are : Problem set: 0 solved, 319 unsolved in 29592 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 7/7 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/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (OVERLAPS) 293/413 variables, 120/135 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 42/177 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 319/496 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/414 variables, and 497 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, ReadFeed: 42/43 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59723ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 59725ms
Starting structural reductions in LTL mode, iteration 1 : 120/123 places, 320/328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60260 ms. Remains : 120/123 places, 320/328 transitions.
[2026-05-26 14:20:21] [INFO ] Flatten gal took : 6 ms
[2026-05-26 14:20:21] [INFO ] Flatten gal took : 7 ms
[2026-05-26 14:20:21] [INFO ] Input system was already deterministic with 320 transitions.
[2026-05-26 14:20:21] [INFO ] Flatten gal took : 7 ms
[2026-05-26 14:20:21] [INFO ] Flatten gal took : 7 ms
[2026-05-26 14:20:21] [INFO ] Time to serialize gal into /tmp/CTLFireability6384479949255387645.gal : 1 ms
[2026-05-26 14:20:21] [INFO ] Time to serialize properties into /tmp/CTLFireability13590788345911701718.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/CTLFireability6384479949255387645.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13590788345911701718.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.18523e+07,0.775146,22832,2,2452,5,69402,6,0,799,54026,0


Converting to forward existential form...Done !
original formula: AG((EF(AX((E(((p9==1)&&(p43==1)) U ((p8==1)&&(p100==1))) * E(((p11==1)&&(p96==1)) U ((p3==1)&&(p113==1)))))) + ((EF(AG(((p8==1)&&(p50==1)...184
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((E(TRUE U !(E(TRUE U !(((p8==1)&&(p50==1)))))) * (p8==1)) * (p109==1)))) * !(E(TRUE U !(...271
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...696
(forward)formula 0,0,23.988,547752,1,0,656,2.81663e+06,671,333,6720,2.30116e+06,741
FORMULA FireWire-PT-08-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-26 14:20:45] [INFO ] Flatten gal took : 6 ms
[2026-05-26 14:20:45] [INFO ] Flatten gal took : 7 ms
[2026-05-26 14:20:45] [INFO ] Applying decomposition
[2026-05-26 14:20:45] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9289503143407609190.txt' '-o' '/tmp/graph9289503143407609190.bin' '-w' '/tmp/graph9289503143407609190.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9289503143407609190.bin' '-l' '-1' '-v' '-w' '/tmp/graph9289503143407609190.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:20:45] [INFO ] Decomposing Gal with order
[2026-05-26 14:20:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:20:45] [INFO ] Removed a total of 479 redundant transitions.
[2026-05-26 14:20:45] [INFO ] Flatten gal took : 17 ms
[2026-05-26 14:20:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 113 labels/synchronizations in 5 ms.
[2026-05-26 14:20:45] [INFO ] Time to serialize gal into /tmp/CTLFireability18007251534989090873.gal : 3 ms
[2026-05-26 14:20:45] [INFO ] Time to serialize properties into /tmp/CTLFireability5651352161075960161.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/CTLFireability18007251534989090873.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5651352161075960161.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 4 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.35785e+07,1.72951,54916,1387,235,61367,2582,577,347453,115,18985,0


Converting to forward existential form...Done !
original formula: EG(EX(EF(EG(((i6.u31.p6==1)&&(i7.i1.u34.p111==1))))))
=> equivalent forward existential formula: [FwdG(Init,EX(E(TRUE U EG(((i6.u31.p6==1)&&(i7.i1.u34.p111==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t45, t48, t49, t59, t63, t64, t69, t74, t79, t87, t94, t97, t99, t106, t138, t1...859
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
(forward)formula 0,1,37.882,709004,1,0,921590,6185,3096,4.01209e+06,627,38557,1668958
FORMULA FireWire-PT-08-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF((AF(((i1.u2.p7==0)||(i6.u32.p103==0))) * AG(((i1.u2.p8==0)||(i6.u31.p100==0)))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!(((i1.u2.p7==0)||(i6.u32.p103==0))))) * !(E(TRUE U !(((i1.u2.p8==0)||(i6.u31.p100==0))))))))...164
(forward)formula 1,0,51.368,892804,1,0,1.19713e+06,6755,3127,4.53027e+06,631,41488,2257424
FORMULA FireWire-PT-08-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(AF(((AX(AX(((i2.u3.p9==0)||(i2.u13.p40==0)))) * AG(((i1.u2.p8==0)||(i6.u31.p102==0)))) * (EX((i1.u9.p27==0)) * (((i2.u3.p11==1)&&(i2.u...245
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((!(EX(!(!(EX(!(((i2.u3.p9==0)||(i2.u13.p40==0)))))))) * !(E(TRUE U !(((i1.u2.p8==0)||(i6.u31....318
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
(forward)formula 2,0,63.514,1157912,1,0,1.56449e+06,8088,3236,5.8982e+06,641,49331,2936586
FORMULA FireWire-PT-08-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(EF(((i2.u3.p9==1)&&(i4.u23.p73==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((i2.u3.p9==1)&&(i4.u23.p73==1)))))] = FALSE
(forward)formula 3,1,64.8686,1182932,1,0,1.59848e+06,8343,3241,6.00836e+06,641,50957,3023235
FORMULA FireWire-PT-08-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

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

BK_STOP 1779805311104

--------------------
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="FireWire-PT-08"
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 FireWire-PT-08, 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 r130-smll-177955809000202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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