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-177955808900162.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-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955808900162
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.8K Mar 7 05:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Mar 7 05:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 7 05:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 7 05:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 05:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Mar 7 05:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Mar 7 05:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 7 05:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:04 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 86K 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-03-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779795439210

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-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-26 11:37:21] [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 11:37:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 11:37:22] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2026-05-26 11:37:22] [INFO ] Transformed 112 places.
[2026-05-26 11:37:22] [INFO ] Transformed 356 transitions.
[2026-05-26 11:37:22] [INFO ] Found NUPN structural information;
[2026-05-26 11:37:22] [INFO ] Parsed PT model containing 112 places and 356 transitions and 1308 arcs in 418 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
FORMULA FireWire-PT-03-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-03-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 72 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 303/303 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 111 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 301
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 8 place count 111 transition count 295
Applied a total of 8 rules in 64 ms. Remains 111 /112 variables (removed 1) and now considering 295/303 (removed 8) transitions.
[2026-05-26 11:37:22] [INFO ] Flow matrix only has 269 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-13868646656225016466.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12019144865785864720.kers'
[2026-05-26 11:37:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13868646656225016466.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12019144865785864720.kers]
Normalized transition count is 268 out of 269 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 268 rows 111 cols 890 entries
Finished phase 1 with 102 SingleSign rule and 0 generalized
[2026-05-26 11:37:22] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12019144865785864720.kers
Total runtime 4 ms.
[2026-05-26 11:37:23] [INFO ] Implicit Places using invariants in 486 ms returned []
[2026-05-26 11:37:23] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
[2026-05-26 11:37:23] [INFO ] Invariant cache hit.
[2026-05-26 11:37:23] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-26 11:37:23] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 1026 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2026-05-26 11:37:23] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
[2026-05-26 11:37:23] [INFO ] Invariant cache hit.
[2026-05-26 11:37:23] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 268/379 variables, 111/128 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 40/168 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 1/380 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 169 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 111/111 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 268/379 variables, 111/128 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 40/168 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 294/462 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (OVERLAPS) 1/380 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 463 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 111/111 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60536ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 60579ms
Starting structural reductions in LTL mode, iteration 1 : 111/112 places, 295/303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61745 ms. Remains : 111/112 places, 295/303 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 295/295 transitions.
Applied a total of 0 rules in 3 ms. Remains 111 /111 variables (removed 0) and now considering 295/295 (removed 0) transitions.
[2026-05-26 11:38:24] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
[2026-05-26 11:38:24] [INFO ] Invariant cache hit.
[2026-05-26 11:38:24] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-26 11:38:24] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
[2026-05-26 11:38:24] [INFO ] Invariant cache hit.
[2026-05-26 11:38:24] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-26 11:38:24] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 283 ms. Remains : 111/111 places, 295/295 transitions.
Support contains 72 out of 111 places after structural reductions.
[2026-05-26 11:38:24] [INFO ] Flatten gal took : 79 ms
[2026-05-26 11:38:24] [INFO ] Flatten gal took : 37 ms
[2026-05-26 11:38:24] [INFO ] Input system was already deterministic with 295 transitions.
Support contains 70 out of 111 places (down from 72) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 80 to 77
RANDOM walk for 40000 steps (2089 resets) in 2980 ms. (13 steps per ms) remains 39/77 properties
BEST_FIRST walk for 4001 steps (50 resets) in 69 ms. (57 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (45 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (10 resets) in 25 ms. (154 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (9 resets) in 34 ms. (114 steps per ms) remains 37/39 properties
BEST_FIRST walk for 4002 steps (83 resets) in 37 ms. (105 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 47 ms. (83 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (77 resets) in 24 ms. (160 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (47 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (27 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (17 resets) in 12 ms. (307 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (57 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (14 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (55 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (81 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (10 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (50 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (50 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (13 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (41 resets) in 35 ms. (111 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (124 resets) in 40 ms. (97 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (46 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (69 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (50 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (45 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (56 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (53 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (86 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (43 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (69 resets) in 21 ms. (181 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (124 resets) in 41 ms. (95 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (55 resets) in 21 ms. (182 steps per ms) remains 36/36 properties
[2026-05-26 11:38:26] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
[2026-05-26 11:38:26] [INFO ] Invariant cache hit.
[2026-05-26 11:38:26] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp44 is UNSAT
At refinement iteration 1 (OVERLAPS) 54/104 variables, 7/7 constraints. Problems are: Problem set: 5 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 3/10 constraints. Problems are: Problem set: 5 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 2/12 constraints. Problems are: Problem set: 5 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/12 constraints. Problems are: Problem set: 5 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 7/111 variables, 2/14 constraints. Problems are: Problem set: 5 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/14 constraints. Problems are: Problem set: 5 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 268/379 variables, 111/125 constraints. Problems are: Problem set: 5 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 40/165 constraints. Problems are: Problem set: 5 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 0/165 constraints. Problems are: Problem set: 5 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 1/380 variables, 1/166 constraints. Problems are: Problem set: 5 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 0/166 constraints. Problems are: Problem set: 5 solved, 31 unsolved
At refinement iteration 12 (OVERLAPS) 0/380 variables, 0/166 constraints. Problems are: Problem set: 5 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 166 constraints, problems are : Problem set: 5 solved, 31 unsolved in 3303 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 111/111 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 31 unsolved
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp77 is UNSAT
At refinement iteration 1 (OVERLAPS) 61/102 variables, 6/6 constraints. Problems are: Problem set: 7 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 5/11 constraints. Problems are: Problem set: 7 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/11 constraints. Problems are: Problem set: 7 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 9/111 variables, 3/14 constraints. Problems are: Problem set: 7 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 2/16 constraints. Problems are: Problem set: 7 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/16 constraints. Problems are: Problem set: 7 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 268/379 variables, 111/127 constraints. Problems are: Problem set: 7 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 40/167 constraints. Problems are: Problem set: 7 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 29/196 constraints. Problems are: Problem set: 7 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 0/196 constraints. Problems are: Problem set: 7 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 1/380 variables, 1/197 constraints. Problems are: Problem set: 7 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 0/197 constraints. Problems are: Problem set: 7 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 197 constraints, problems are : Problem set: 7 solved, 29 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 111/111 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 29/36 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8363ms problems are : Problem set: 7 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 295/295 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 111 transition count 292
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 111 transition count 291
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 5 place count 110 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 109 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 109 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 108 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 108 transition count 286
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 106 transition count 284
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 104 transition count 288
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 21 place count 104 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 104 transition count 280
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 104 transition count 282
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 103 transition count 280
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 31 place count 103 transition count 278
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 103 transition count 278
Applied a total of 32 rules in 165 ms. Remains 103 /111 variables (removed 8) and now considering 278/295 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 103/111 places, 278/295 transitions.
RANDOM walk for 40000 steps (2191 resets) in 758 ms. (52 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4004 steps (56 resets) in 31 ms. (125 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (58 resets) in 35 ms. (111 steps per ms) remains 24/28 properties
BEST_FIRST walk for 4004 steps (16 resets) in 27 ms. (143 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (9 resets) in 27 ms. (143 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (105 resets) in 44 ms. (88 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (51 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (14 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (70 resets) in 33 ms. (117 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (20 resets) in 31 ms. (125 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (108 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (56 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (11 resets) in 43 ms. (90 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (59 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (44 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (59 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (68 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (60 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (114 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (57 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (57 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
[2026-05-26 11:38:35] [INFO ] Flow matrix only has 252 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-5259625937229161534.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7460062225672072155.kers'
[2026-05-26 11:38:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5259625937229161534.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7460062225672072155.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 252 rows 102 cols 845 entries
Finished phase 1 with 94 SingleSign rule and 0 generalized
[2026-05-26 11:38:35] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7460062225672072155.kers
Total runtime 2 ms.
[2026-05-26 11:38:35] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 63/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 7/103 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 252/355 variables, 103/117 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 40/157 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/355 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 157 constraints, problems are : Problem set: 0 solved, 24 unsolved in 2150 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 63/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 7/103 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 252/355 variables, 103/117 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 40/157 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 24/181 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 0/355 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 355/355 variables, and 181 constraints, problems are : Problem set: 0 solved, 24 unsolved in 4799 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6986ms problems are : Problem set: 0 solved, 24 unsolved
Fused 24 Parikh solutions to 23 different solutions.
Parikh walk visited 1 properties in 7632 ms.
Support contains 31 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 278/278 transitions.
Applied a total of 0 rules in 14 ms. Remains 103 /103 variables (removed 0) and now considering 278/278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 103/103 places, 278/278 transitions.
RANDOM walk for 40000 steps (2198 resets) in 387 ms. (103 steps per ms) remains 20/23 properties
BEST_FIRST walk for 4004 steps (52 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (43 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (23 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (108 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (58 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (15 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (11 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (112 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (59 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (19 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (50 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (50 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (67 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (45 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (115 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (51 resets) in 15 ms. (250 steps per ms) remains 19/20 properties
[2026-05-26 11:38:50] [INFO ] Flow matrix only has 252 transitions (discarded 26 similar events)
[2026-05-26 11:38:50] [INFO ] Invariant cache hit.
[2026-05-26 11:38:50] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 68/94 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 9/103 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 252/355 variables, 103/116 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 40/156 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/355 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 156 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1684 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 4/4 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/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 68/94 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 9/103 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 252/355 variables, 103/117 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 40/157 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 19/176 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 0/355 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 355/355 variables, and 176 constraints, problems are : Problem set: 0 solved, 19 unsolved in 3146 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4856ms problems are : Problem set: 0 solved, 19 unsolved
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 2762 ms.
Support contains 26 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 278/278 transitions.
Applied a total of 0 rules in 12 ms. Remains 103 /103 variables (removed 0) and now considering 278/278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 103/103 places, 278/278 transitions.
RANDOM walk for 40000 steps (2150 resets) in 293 ms. (136 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (72 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (105 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (38 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (16 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (108 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (58 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (60 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (53 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (66 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (58 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (111 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (48 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 489752 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :8 out of 19
Probabilistic random walk after 489752 steps, saw 91970 distinct states, run finished after 3017 ms. (steps per millisecond=162 ) properties seen :8
[2026-05-26 11:39:01] [INFO ] Flow matrix only has 252 transitions (discarded 26 similar events)
[2026-05-26 11:39:01] [INFO ] Invariant cache hit.
[2026-05-26 11:39:01] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 76/94 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 9/103 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 252/355 variables, 103/114 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 40/154 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/355 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 154 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1189 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 76/94 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 9/103 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 252/355 variables, 103/114 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 40/154 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 11/165 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/355 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 0/355 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 355/355 variables, and 166 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2091 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3292ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 3963 ms.
Support contains 18 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 278/278 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 102 transition count 275
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 102 transition count 275
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 101 transition count 273
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 101 transition count 273
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 101 transition count 273
Applied a total of 5 rules in 31 ms. Remains 101 /103 variables (removed 2) and now considering 273/278 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 101/103 places, 273/278 transitions.
RANDOM walk for 40000 steps (2204 resets) in 194 ms. (205 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (516 resets) in 111 ms. (357 steps per ms) remains 7/11 properties
BEST_FIRST walk for 40003 steps (57 resets) in 115 ms. (344 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (564 resets) in 103 ms. (384 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (10 resets) in 49 ms. (800 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1053 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 7/7 properties
[2026-05-26 11:39:08] [INFO ] Flow matrix only has 247 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-12928899722177276195.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16258690326845073780.kers'
[2026-05-26 11:39:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12928899722177276195.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16258690326845073780.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 247 rows 100 cols 829 entries
Finished phase 1 with 92 SingleSign rule and 0 generalized
[2026-05-26 11:39:08] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16258690326845073780.kers
Total runtime 2 ms.
[2026-05-26 11:39:08] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 77/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 9/101 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 247/348 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 39/151 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/348 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 151 constraints, problems are : Problem set: 0 solved, 7 unsolved in 678 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 101/101 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 77/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 9/101 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 247/348 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 39/151 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 7/158 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/348 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/348 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/348 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 160 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1326 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 101/101 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2028ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 1276 ms.
Support contains 15 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 273/273 transitions.
Applied a total of 0 rules in 9 ms. Remains 101 /101 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 101/101 places, 273/273 transitions.
RANDOM walk for 40000 steps (2134 resets) in 161 ms. (246 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (557 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (64 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (529 resets) in 72 ms. (548 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (10 resets) in 36 ms. (1081 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1056 resets) in 71 ms. (555 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 562685 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :0 out of 7
Probabilistic random walk after 562685 steps, saw 106305 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
[2026-05-26 11:39:15] [INFO ] Flow matrix only has 247 transitions (discarded 26 similar events)
[2026-05-26 11:39:15] [INFO ] Invariant cache hit.
[2026-05-26 11:39:15] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 77/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 9/101 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 247/348 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 39/151 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/348 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 151 constraints, problems are : Problem set: 0 solved, 7 unsolved in 681 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 101/101 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 77/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 9/101 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 247/348 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 39/151 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 7/158 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/348 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/348 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/348 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 160 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1676 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 101/101 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2365ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 1411 ms.
Support contains 15 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 273/273 transitions.
Applied a total of 0 rules in 9 ms. Remains 101 /101 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 101/101 places, 273/273 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 273/273 transitions.
Applied a total of 0 rules in 8 ms. Remains 101 /101 variables (removed 0) and now considering 273/273 (removed 0) transitions.
[2026-05-26 11:39:19] [INFO ] Flow matrix only has 247 transitions (discarded 26 similar events)
[2026-05-26 11:39:19] [INFO ] Invariant cache hit.
[2026-05-26 11:39:19] [INFO ] Implicit Places using invariants in 100 ms returned [100]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 100/101 places, 273/273 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 100 transition count 272
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 99 transition count 272
Applied a total of 2 rules in 11 ms. Remains 99 /100 variables (removed 1) and now considering 272/273 (removed 1) transitions.
[2026-05-26 11:39:19] [INFO ] Flow matrix only has 246 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-5924757396296061521.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-180974213970184761.kers'
[2026-05-26 11:39:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5924757396296061521.kers, --Pflows, --basisKERS=/tmp/petrispot-output-180974213970184761.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 99 cols 827 entries
Finished phase 1 with 91 SingleSign rule and 0 generalized
[2026-05-26 11:39:19] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-180974213970184761.kers
Total runtime 1 ms.
[2026-05-26 11:39:19] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-26 11:39:19] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
[2026-05-26 11:39:19] [INFO ] Invariant cache hit.
[2026-05-26 11:39:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 11:39:19] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 99/101 places, 272/273 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 484 ms. Remains : 99/101 places, 272/273 transitions.
RANDOM walk for 40000 steps (2299 resets) in 172 ms. (231 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (605 resets) in 57 ms. (689 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (62 resets) in 64 ms. (615 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 76 ms. (519 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (586 resets) in 57 ms. (689 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (12 resets) in 38 ms. (1025 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1239 resets) in 63 ms. (625 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 84 ms. (470 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 1311458 steps, run timeout after 3001 ms. (steps per millisecond=437 ) properties seen :6 out of 7
Probabilistic random walk after 1311458 steps, saw 273982 distinct states, run finished after 3001 ms. (steps per millisecond=437 ) properties seen :6
[2026-05-26 11:39:22] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
[2026-05-26 11:39:22] [INFO ] Invariant cache hit.
[2026-05-26 11:39:22] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 68/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/99 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 246/345 variables, 99/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 38/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/345 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 145 constraints, problems are : Problem set: 0 solved, 1 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 68/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/99 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 246/345 variables, 99/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 38/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/345 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 146 constraints, problems are : Problem set: 0 solved, 1 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 335ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 272/272 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 98 transition count 277
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 98 transition count 275
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 98 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 97 transition count 273
Applied a total of 6 rules in 29 ms. Remains 97 /99 variables (removed 2) and now considering 273/272 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 97/99 places, 273/272 transitions.
RANDOM walk for 40000 steps (2418 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (10 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1599019 steps, run timeout after 3001 ms. (steps per millisecond=532 ) properties seen :0 out of 1
Probabilistic random walk after 1599019 steps, saw 331397 distinct states, run finished after 3001 ms. (steps per millisecond=532 ) properties seen :0
[2026-05-26 11:39:26] [INFO ] Flow matrix only has 245 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-9529609448833612902.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3058244594191145501.kers'
[2026-05-26 11:39:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9529609448833612902.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3058244594191145501.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 245 rows 95 cols 814 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-26 11:39:26] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3058244594191145501.kers
Total runtime 2 ms.
[2026-05-26 11:39:26] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/69 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 217/286 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 53/339 variables, 26/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 11/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/342 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/342 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/69 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 217/286 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 53/339 variables, 26/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 11/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/342 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/342 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/342 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 450ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 273/273 transitions.
Applied a total of 0 rules in 12 ms. Remains 97 /97 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 97/97 places, 273/273 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 273/273 transitions.
Applied a total of 0 rules in 15 ms. Remains 97 /97 variables (removed 0) and now considering 273/273 (removed 0) transitions.
[2026-05-26 11:39:26] [INFO ] Flow matrix only has 245 transitions (discarded 28 similar events)
[2026-05-26 11:39:26] [INFO ] Invariant cache hit.
[2026-05-26 11:39:26] [INFO ] Implicit Places using invariants in 163 ms returned []
[2026-05-26 11:39:26] [INFO ] Flow matrix only has 245 transitions (discarded 28 similar events)
[2026-05-26 11:39:26] [INFO ] Invariant cache hit.
[2026-05-26 11:39:26] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-26 11:39:27] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2026-05-26 11:39:27] [INFO ] Redundant transitions in 16 ms returned []
Running 271 sub problems to find dead transitions.
[2026-05-26 11:39:27] [INFO ] Flow matrix only has 245 transitions (discarded 28 similar events)
[2026-05-26 11:39:27] [INFO ] Invariant cache hit.
[2026-05-26 11:39:27] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (OVERLAPS) 245/342 variables, 97/116 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 37/153 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (OVERLAPS) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 153 constraints, problems are : Problem set: 0 solved, 271 unsolved in 20698 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (OVERLAPS) 245/342 variables, 97/116 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 37/153 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 271/424 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/342 variables, and 424 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50791ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 50792ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51306 ms. Remains : 97/97 places, 273/273 transitions.
Successfully simplified 7 atomic propositions for a total of 14 simplifications.
[2026-05-26 11:40:18] [INFO ] Flatten gal took : 25 ms
[2026-05-26 11:40:18] [INFO ] Flatten gal took : 40 ms
[2026-05-26 11:40:18] [INFO ] Input system was already deterministic with 295 transitions.
Support contains 61 out of 111 places (down from 62) after GAL structural reductions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 295/295 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 111 transition count 294
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 294
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 108 transition count 288
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 108 transition count 288
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 106 transition count 284
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 106 transition count 284
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 104 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 104 transition count 280
Applied a total of 16 rules in 44 ms. Remains 104 /111 variables (removed 7) and now considering 280/295 (removed 15) transitions.
[2026-05-26 11:40:18] [INFO ] Flow matrix only has 255 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-333227168543869920.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16065573098723588775.kers'
[2026-05-26 11:40:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-333227168543869920.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16065573098723588775.kers]
Normalized transition count is 254 out of 255 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 254 rows 103 cols 845 entries
Finished phase 1 with 95 SingleSign rule and 0 generalized
[2026-05-26 11:40:18] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16065573098723588775.kers
Total runtime 3 ms.
[2026-05-26 11:40:18] [INFO ] Implicit Places using invariants in 155 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 157 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 103/111 places, 280/295 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 103 transition count 279
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 102 transition count 279
Applied a total of 2 rules in 17 ms. Remains 102 /103 variables (removed 1) and now considering 279/280 (removed 1) transitions.
[2026-05-26 11:40:18] [INFO ] Flow matrix only has 254 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10331486225445837648.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4277409855137989542.kers'
[2026-05-26 11:40:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10331486225445837648.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4277409855137989542.kers]
Normalized transition count is 253 out of 254 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 253 rows 102 cols 843 entries
Finished phase 1 with 94 SingleSign rule and 0 generalized
[2026-05-26 11:40:18] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4277409855137989542.kers
Total runtime 2 ms.
[2026-05-26 11:40:18] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-26 11:40:18] [INFO ] Flow matrix only has 254 transitions (discarded 25 similar events)
[2026-05-26 11:40:18] [INFO ] Invariant cache hit.
[2026-05-26 11:40:18] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-26 11:40:18] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 102/111 places, 279/295 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 712 ms. Remains : 102/111 places, 279/295 transitions.
[2026-05-26 11:40:18] [INFO ] Flatten gal took : 33 ms
[2026-05-26 11:40:18] [INFO ] Flatten gal took : 29 ms
[2026-05-26 11:40:19] [INFO ] Input system was already deterministic with 279 transitions.
[2026-05-26 11:40:19] [INFO ] Flatten gal took : 22 ms
[2026-05-26 11:40:19] [INFO ] Flatten gal took : 21 ms
[2026-05-26 11:40:19] [INFO ] Time to serialize gal into /tmp/CTLFireability4953006422057215503.gal : 13 ms
[2026-05-26 11:40:19] [INFO ] Time to serialize properties into /tmp/CTLFireability9409264609640947827.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4953006422057215503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9409264609640947827.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(((AF(((p43==1)&&(p57==1))) * (p12==1)) * ((EF(((p10==1)&&(p97==1))) + !(A(((p68==1)&&(p102==1)) U ((p7==1)&&(p72==1))))) + (A((p7==1) ...196
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,TRUE) * (!(EG(!(((p43==1)&&(p57==1))))) * (p12==1))),TRUE) * ((p10==1)&&(p97==1)))] != FALSE...632
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t14, t15, t16, t17, t18, t20, t22, t27, t28, t29, t30, t31, t33, t35,...542
Detected timeout of ITS tools.
[2026-05-26 11:40:49] [INFO ] Flatten gal took : 16 ms
[2026-05-26 11:40:49] [INFO ] Applying decomposition
[2026-05-26 11:40:49] [INFO ] Flatten gal took : 16 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/graph15090917846870090227.txt' '-o' '/tmp/graph15090917846870090227.bin' '-w' '/tmp/graph15090917846870090227.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15090917846870090227.bin' '-l' '-1' '-v' '-w' '/tmp/graph15090917846870090227.weights' '-q' '0' '-e' '0.001'
[2026-05-26 11:40:49] [INFO ] Decomposing Gal with order
[2026-05-26 11:40:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 11:40:49] [INFO ] Removed a total of 410 redundant transitions.
[2026-05-26 11:40:49] [INFO ] Flatten gal took : 101 ms
[2026-05-26 11:40:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 15 ms.
[2026-05-26 11:40:49] [INFO ] Time to serialize gal into /tmp/CTLFireability6605250729819222559.gal : 7 ms
[2026-05-26 11:40:49] [INFO ] Time to serialize properties into /tmp/CTLFireability18345548796765909401.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6605250729819222559.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18345548796765909401.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,3.07891e+06,6.8707,163008,2123,121,240455,1724,531,796104,85,15245,0


Converting to forward existential form...Done !
original formula: EF(((AF(((i1.u13.p43==1)&&(i7.u18.p57==1))) * (i1.u3.p12==1)) * ((EF(((i1.u3.p10==1)&&(i1.u3.p97==1))) + !(A(((i4.u22.p68==1)&&(i4.u34.p1...280
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,TRUE) * (!(EG(!(((i1.u13.p43==1)&&(i7.u18.p57==1))))) * (i1.u3.p12==1))),TRUE) * ((i1.u3.p10...828
Reverse transition relation is NOT exact ! Due to transitions t1, t43, t49, t50, t59, t64, t69, t74, t79, t93, t95, t96, t97, t98, t131, t140, t145, t158, ...677
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 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,24.889,538884,1,0,777486,4524,3192,3.1151e+06,396,27793,1808008
FORMULA FireWire-PT-03-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 295/295 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 109 transition count 289
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 107 transition count 285
Applied a total of 8 rules in 6 ms. Remains 107 /111 variables (removed 4) and now considering 285/295 (removed 10) transitions.
[2026-05-26 11:41:14] [INFO ] Flow matrix only has 259 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-2532506916747293130.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14989133185770089266.kers'
[2026-05-26 11:41:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2532506916747293130.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14989133185770089266.kers]
Normalized transition count is 258 out of 259 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 258 rows 107 cols 854 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-26 11:41:14] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14989133185770089266.kers
Total runtime 3 ms.
[2026-05-26 11:41:14] [INFO ] Implicit Places using invariants in 165 ms returned []
[2026-05-26 11:41:14] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2026-05-26 11:41:14] [INFO ] Invariant cache hit.
[2026-05-26 11:41:14] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-26 11:41:15] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2026-05-26 11:41:15] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2026-05-26 11:41:15] [INFO ] Invariant cache hit.
[2026-05-26 11:41:15] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/366 variables, and 163 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 284/446 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/366 variables, and 447 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60185ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 60187ms
Starting structural reductions in LTL mode, iteration 1 : 107/111 places, 285/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60721 ms. Remains : 107/111 places, 285/295 transitions.
[2026-05-26 11:42:15] [INFO ] Flatten gal took : 21 ms
[2026-05-26 11:42:15] [INFO ] Flatten gal took : 22 ms
[2026-05-26 11:42:15] [INFO ] Input system was already deterministic with 285 transitions.
[2026-05-26 11:42:15] [INFO ] Flatten gal took : 23 ms
[2026-05-26 11:42:15] [INFO ] Flatten gal took : 21 ms
[2026-05-26 11:42:15] [INFO ] Time to serialize gal into /tmp/CTLFireability9639330201144346732.gal : 6 ms
[2026-05-26 11:42:15] [INFO ] Time to serialize properties into /tmp/CTLFireability15958934941459242669.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/CTLFireability9639330201144346732.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15958934941459242669.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(((AG((EF((((p2==1)&&(p40==1))||((p10==1)&&(p39==1)))) * E(AG(((p22==1)&&(p35==1))) U EX(((p2==1)&&(p94==1)))))) + EX(((p7==1)&&(p55==1)...280
=> equivalent forward existential formula: [(FwdU(Init,((!(E(TRUE U !((E(TRUE U (((p2==1)&&(p40==1))||((p10==1)&&(p39==1)))) * E(!(E(TRUE U !(((p22==1)&&(p...374
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...578
Detected timeout of ITS tools.
[2026-05-26 11:42:45] [INFO ] Flatten gal took : 13 ms
[2026-05-26 11:42:45] [INFO ] Applying decomposition
[2026-05-26 11:42:45] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2673398736300039485.txt' '-o' '/tmp/graph2673398736300039485.bin' '-w' '/tmp/graph2673398736300039485.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2673398736300039485.bin' '-l' '-1' '-v' '-w' '/tmp/graph2673398736300039485.weights' '-q' '0' '-e' '0.001'
[2026-05-26 11:42:45] [INFO ] Decomposing Gal with order
[2026-05-26 11:42:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 11:42:45] [INFO ] Removed a total of 423 redundant transitions.
[2026-05-26 11:42:45] [INFO ] Flatten gal took : 29 ms
[2026-05-26 11:42:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 11 ms.
[2026-05-26 11:42:45] [INFO ] Time to serialize gal into /tmp/CTLFireability9608330461116568539.gal : 4 ms
[2026-05-26 11:42:45] [INFO ] Time to serialize properties into /tmp/CTLFireability10524163298826210707.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/CTLFireability9608330461116568539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10524163298826210707.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,5.45564e+06,24.8407,495312,2134,119,645327,6197,621,2.88744e+06,80,33106,0


Converting to forward existential form...Done !
original formula: E(((AG((EF((((i0.i0.u0.p2==1)&&(i0.i0.u13.p40==1))||((i0.i1.u3.p10==1)&&(i0.i0.u13.p39==1)))) * E(AG(((i2.u7.p22==1)&&(i1.u11.p35==1))) U...425
=> equivalent forward existential formula: [(FwdU(Init,((!(E(TRUE U !((E(TRUE U (((i0.i0.u0.p2==1)&&(i0.i0.u13.p40==1))||((i0.i1.u3.p10==1)&&(i0.i0.u13.p39...519
Reverse transition relation is NOT exact ! Due to transitions t47, t49, t53, t54, t62, t83, t86, t97, t99, t100, t101, t102, t139, t148, t153, t166, t168, ...835
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 295/295 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 109 transition count 289
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 107 transition count 285
Applied a total of 8 rules in 4 ms. Remains 107 /111 variables (removed 4) and now considering 285/295 (removed 10) transitions.
[2026-05-26 11:43:15] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2026-05-26 11:43:15] [INFO ] Invariant cache hit.
[2026-05-26 11:43:15] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-26 11:43:15] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2026-05-26 11:43:15] [INFO ] Invariant cache hit.
[2026-05-26 11:43:16] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-26 11:43:16] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 107/111 places, 285/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 393 ms. Remains : 107/111 places, 285/295 transitions.
[2026-05-26 11:43:16] [INFO ] Flatten gal took : 15 ms
[2026-05-26 11:43:16] [INFO ] Flatten gal took : 17 ms
[2026-05-26 11:43:16] [INFO ] Input system was already deterministic with 285 transitions.
[2026-05-26 11:43:16] [INFO ] Flatten gal took : 17 ms
[2026-05-26 11:43:16] [INFO ] Flatten gal took : 14 ms
[2026-05-26 11:43:16] [INFO ] Time to serialize gal into /tmp/CTLFireability706024501618093277.gal : 5 ms
[2026-05-26 11:43:16] [INFO ] Time to serialize properties into /tmp/CTLFireability5824876023929414934.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/CTLFireability706024501618093277.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5824876023929414934.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.45564e+06,3.08203,76908,2,4437,5,220184,6,0,710,221203,0


Converting to forward existential form...Done !
original formula: E(AX(AX(AX(((p7==1)&&(p55==1))))) U !((AX(FALSE) + ((((p3==1)&&(p68==1)) + !(EX(((p7==1)&&(p33==1))))) * !(EF((((p47==1)&&(p7==1))&&(p78=...165
=> equivalent forward existential formula: ([(EY(((FwdU(Init,!(EX(!(!(EX(!(!(EX(!(((p7==1)&&(p55==1)))))))))))) * !(!(EX(!(FALSE))))) * !(((p3==1)&&(p68==1...338
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...578
(forward)formula 0,1,9.28065,186032,1,0,522,719836,593,272,6130,733323,595
FORMULA FireWire-PT-03-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 295/295 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 110 transition count 293
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 109 transition count 293
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 107 transition count 287
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 107 transition count 287
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 105 transition count 283
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 105 transition count 283
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 0 with 2 rules applied. Total rules applied 12 place count 104 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 104 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 103 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 102 transition count 279
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 16 place count 102 transition count 278
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 18 place count 101 transition count 278
Applied a total of 18 rules in 36 ms. Remains 101 /111 variables (removed 10) and now considering 278/295 (removed 17) transitions.
[2026-05-26 11:43:25] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9351577657964617006.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12085689190050454574.kers'
[2026-05-26 11:43:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9351577657964617006.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12085689190050454574.kers]
Normalized transition count is 252 out of 253 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 252 rows 99 cols 826 entries
Finished phase 1 with 93 SingleSign rule and 0 generalized
[2026-05-26 11:43:25] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12085689190050454574.kers
Total runtime 1 ms.
[2026-05-26 11:43:25] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-26 11:43:25] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
[2026-05-26 11:43:25] [INFO ] Invariant cache hit.
[2026-05-26 11:43:25] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-26 11:43:26] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2026-05-26 11:43:26] [INFO ] Redundant transitions in 15 ms returned []
Running 275 sub problems to find dead transitions.
[2026-05-26 11:43:26] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
[2026-05-26 11:43:26] [INFO ] Invariant cache hit.
[2026-05-26 11:43:26] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/116 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 35/151 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 0/353 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/354 variables, and 151 constraints, problems are : Problem set: 0 solved, 275 unsolved in 23687 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/116 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 35/151 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 275/426 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/354 variables, and 426 constraints, problems are : Problem set: 0 solved, 275 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53761ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 53763ms
Starting structural reductions in SI_CTL mode, iteration 1 : 101/111 places, 278/295 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54182 ms. Remains : 101/111 places, 278/295 transitions.
[2026-05-26 11:44:19] [INFO ] Flatten gal took : 12 ms
[2026-05-26 11:44:19] [INFO ] Flatten gal took : 13 ms
[2026-05-26 11:44:19] [INFO ] Input system was already deterministic with 278 transitions.
[2026-05-26 11:44:19] [INFO ] Flatten gal took : 12 ms
[2026-05-26 11:44:19] [INFO ] Flatten gal took : 13 ms
[2026-05-26 11:44:19] [INFO ] Time to serialize gal into /tmp/CTLFireability3262832212695958867.gal : 4 ms
[2026-05-26 11:44:19] [INFO ] Time to serialize properties into /tmp/CTLFireability4475440590033183065.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/CTLFireability3262832212695958867.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4475440590033183065.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(EG(((p2==1)&&(p92==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p2==1)&&(p92==1)))] != FALSE
Hit Full ! (commute/partial/dont) 241/35/37
(forward)formula 0,0,2.1478,34432,1,0,8,137561,19,2,3952,95997,8
FORMULA FireWire-PT-03-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 295/295 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 109 transition count 289
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 107 transition count 285
Applied a total of 8 rules in 5 ms. Remains 107 /111 variables (removed 4) and now considering 285/295 (removed 10) transitions.
[2026-05-26 11:44:22] [INFO ] Flow matrix only has 259 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-3663861549466939981.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10001157258182913423.kers'
[2026-05-26 11:44:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3663861549466939981.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10001157258182913423.kers]
Normalized transition count is 258 out of 259 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 258 rows 107 cols 854 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-26 11:44:22] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10001157258182913423.kers
Total runtime 2 ms.
[2026-05-26 11:44:22] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-26 11:44:22] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2026-05-26 11:44:22] [INFO ] Invariant cache hit.
[2026-05-26 11:44:22] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-26 11:44:22] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2026-05-26 11:44:22] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2026-05-26 11:44:22] [INFO ] Invariant cache hit.
[2026-05-26 11:44:22] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/366 variables, and 163 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 284/446 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/366 variables, and 447 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Starting structural reductions in LTL mode, iteration 1 : 107/111 places, 285/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60471 ms. Remains : 107/111 places, 285/295 transitions.
[2026-05-26 11:45:22] [INFO ] Flatten gal took : 12 ms
[2026-05-26 11:45:22] [INFO ] Flatten gal took : 12 ms
[2026-05-26 11:45:22] [INFO ] Input system was already deterministic with 285 transitions.
[2026-05-26 11:45:22] [INFO ] Flatten gal took : 12 ms
[2026-05-26 11:45:22] [INFO ] Flatten gal took : 12 ms
[2026-05-26 11:45:22] [INFO ] Time to serialize gal into /tmp/CTLFireability3321313532246023164.gal : 4 ms
[2026-05-26 11:45:22] [INFO ] Time to serialize properties into /tmp/CTLFireability17403463618339717495.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/CTLFireability3321313532246023164.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17403463618339717495.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF((A((((EF(((p3==1)&&(p91==1))) + ((p74!=1)&&(p70==1))) + ((p7==1)&&(p46==1))) * A(((p3==1)&&(p89==1)) U ((p7==1)&&(p28==1)))) U A(AG(((...213
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !((E(!(!((E(!(((p5==1)&&(p51==1))) U (!(!(E(TRUE U !(((p5==1)&&(p46==1)))))) * !(((p5==1...700
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...578
Detected timeout of ITS tools.
[2026-05-26 11:45:52] [INFO ] Flatten gal took : 7 ms
[2026-05-26 11:45:52] [INFO ] Applying decomposition
[2026-05-26 11:45:52] [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/graph8998995696112276232.txt' '-o' '/tmp/graph8998995696112276232.bin' '-w' '/tmp/graph8998995696112276232.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8998995696112276232.bin' '-l' '-1' '-v' '-w' '/tmp/graph8998995696112276232.weights' '-q' '0' '-e' '0.001'
[2026-05-26 11:45:52] [INFO ] Decomposing Gal with order
[2026-05-26 11:45:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 11:45:52] [INFO ] Removed a total of 414 redundant transitions.
[2026-05-26 11:45:52] [INFO ] Flatten gal took : 22 ms
[2026-05-26 11:45:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 9 ms.
[2026-05-26 11:45:52] [INFO ] Time to serialize gal into /tmp/CTLFireability13170997600168237568.gal : 3 ms
[2026-05-26 11:45:52] [INFO ] Time to serialize properties into /tmp/CTLFireability2394349825810408325.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/CTLFireability13170997600168237568.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2394349825810408325.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,5.45564e+06,8.7553,186480,1528,205,227574,4055,601,1.0849e+06,89,31803,0


Converting to forward existential form...Done !
original formula: EF((A((((EF(((i1.i0.u1.p3==1)&&(i0.u30.p91==1))) + ((i5.u33.p74!=1)&&(i5.u23.p70==1))) + ((i3.u2.p7==1)&&(i3.u14.p46==1))) * A(((i1.i0.u1...316
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !((E(!(!((E(!(((i2.u7.p5==1)&&(i3.u16.p51==1))) U (!(!(E(TRUE U !(((i2.u7.p5==1)&&(i3.u1...957
Reverse transition relation is NOT exact ! Due to transitions t4, t47, t49, t53, t54, t62, t63, t68, t73, t78, t83, t97, t99, t100, t101, t102, t139, t148,...775
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 295/295 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 109 transition count 289
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 107 transition count 285
Applied a total of 8 rules in 3 ms. Remains 107 /111 variables (removed 4) and now considering 285/295 (removed 10) transitions.
[2026-05-26 11:46:22] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2026-05-26 11:46:22] [INFO ] Invariant cache hit.
[2026-05-26 11:46:23] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-26 11:46:23] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2026-05-26 11:46:23] [INFO ] Invariant cache hit.
[2026-05-26 11:46:23] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-26 11:46:23] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 107/111 places, 285/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 472 ms. Remains : 107/111 places, 285/295 transitions.
[2026-05-26 11:46:23] [INFO ] Flatten gal took : 9 ms
[2026-05-26 11:46:23] [INFO ] Flatten gal took : 9 ms
[2026-05-26 11:46:23] [INFO ] Input system was already deterministic with 285 transitions.
[2026-05-26 11:46:23] [INFO ] Flatten gal took : 9 ms
[2026-05-26 11:46:23] [INFO ] Flatten gal took : 9 ms
[2026-05-26 11:46:23] [INFO ] Time to serialize gal into /tmp/CTLFireability17252164500865054362.gal : 3 ms
[2026-05-26 11:46:23] [INFO ] Time to serialize properties into /tmp/CTLFireability1274085098602612711.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/CTLFireability17252164500865054362.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1274085098602612711.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (!(E(!((((((p11==1)&&(p100==1)) + ((AF(((p6==1)&&(p75==1))) * (p74==1)) * ((p5==1)&&(p50==1)))) * (p8==1)) * (p38==1))) U AG(!(((p7==1)&&...244
=> equivalent forward existential formula: ([(FwdU((Init * !(!(E(!((((((p11==1)&&(p100==1)) + ((!(EG(!(((p6==1)&&(p75==1))))) * (p74==1)) * ((p5==1)&&(p50=...605
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...578
Detected timeout of ITS tools.
[2026-05-26 11:46:53] [INFO ] Flatten gal took : 12 ms
[2026-05-26 11:46:53] [INFO ] Applying decomposition
[2026-05-26 11:46:53] [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/graph9722126673346232205.txt' '-o' '/tmp/graph9722126673346232205.bin' '-w' '/tmp/graph9722126673346232205.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9722126673346232205.bin' '-l' '-1' '-v' '-w' '/tmp/graph9722126673346232205.weights' '-q' '0' '-e' '0.001'
[2026-05-26 11:46:53] [INFO ] Decomposing Gal with order
[2026-05-26 11:46:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 11:46:53] [INFO ] Removed a total of 414 redundant transitions.
[2026-05-26 11:46:53] [INFO ] Flatten gal took : 18 ms
[2026-05-26 11:46:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 10 ms.
[2026-05-26 11:46:53] [INFO ] Time to serialize gal into /tmp/CTLFireability12625503531742194634.gal : 4 ms
[2026-05-26 11:46:53] [INFO ] Time to serialize properties into /tmp/CTLFireability12710520841917634618.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/CTLFireability12625503531742194634.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12710520841917634618.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,5.45564e+06,8.34418,235456,1350,188,254433,8711,607,1.90988e+06,89,73275,0


Converting to forward existential form...Done !
original formula: (!(E(!((((((i0.i1.u3.p11==1)&&(i0.i1.u3.p100==1)) + ((AF(((i2.u2.p6==1)&&(i5.u25.p75==1))) * (i5.u25.p74==1)) * ((i1.u7.p5==1)&&(i2.u17.p...366
=> equivalent forward existential formula: ([(FwdU((Init * !(!(E(!((((((i0.i1.u3.p11==1)&&(i0.i1.u3.p100==1)) + ((!(EG(!(((i2.u2.p6==1)&&(i5.u25.p75==1))))...836
Reverse transition relation is NOT exact ! Due to transitions t4, t47, t49, t53, t54, t62, t63, t68, t73, t78, t83, t97, t99, t100, t101, t102, t139, t148,...780
Using saturation style SCC detection
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 a local SCC at level 1
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 295/295 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 110 transition count 293
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 108 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 108 transition count 290
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 107 transition count 288
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 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 0 with 2 rules applied. Total rules applied 8 place count 106 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 106 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 105 transition count 284
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 104 transition count 284
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 12 place count 104 transition count 283
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 14 place count 103 transition count 283
Applied a total of 14 rules in 29 ms. Remains 103 /111 variables (removed 8) and now considering 283/295 (removed 12) transitions.
[2026-05-26 11:47:23] [INFO ] Flow matrix only has 258 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15100039653773091755.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10170401282811104578.kers'
[2026-05-26 11:47:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15100039653773091755.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10170401282811104578.kers]
Normalized transition count is 257 out of 258 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 257 rows 101 cols 844 entries
Finished phase 1 with 95 SingleSign rule and 0 generalized
[2026-05-26 11:47:23] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10170401282811104578.kers
Total runtime 2 ms.
[2026-05-26 11:47:23] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-26 11:47:23] [INFO ] Flow matrix only has 258 transitions (discarded 25 similar events)
[2026-05-26 11:47:23] [INFO ] Invariant cache hit.
[2026-05-26 11:47:23] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-26 11:47:24] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2026-05-26 11:47:24] [INFO ] Redundant transitions in 4 ms returned []
Running 280 sub problems to find dead transitions.
[2026-05-26 11:47:24] [INFO ] Flow matrix only has 258 transitions (discarded 25 similar events)
[2026-05-26 11:47:24] [INFO ] Invariant cache hit.
[2026-05-26 11:47:24] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (OVERLAPS) 257/360 variables, 103/121 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 36/157 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (OVERLAPS) 0/360 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/361 variables, and 158 constraints, problems are : Problem set: 0 solved, 280 unsolved in 28534 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 257/360 variables, 103/122 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 36/158 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 280/438 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 0/360 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/361 variables, and 438 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58622ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 58624ms
Starting structural reductions in SI_CTL mode, iteration 1 : 103/111 places, 283/295 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59021 ms. Remains : 103/111 places, 283/295 transitions.
[2026-05-26 11:48:22] [INFO ] Flatten gal took : 5 ms
[2026-05-26 11:48:22] [INFO ] Flatten gal took : 7 ms
[2026-05-26 11:48:22] [INFO ] Input system was already deterministic with 283 transitions.
[2026-05-26 11:48:22] [INFO ] Flatten gal took : 6 ms
[2026-05-26 11:48:22] [INFO ] Flatten gal took : 5 ms
[2026-05-26 11:48:22] [INFO ] Time to serialize gal into /tmp/CTLFireability3780931045111510882.gal : 2 ms
[2026-05-26 11:48:22] [INFO ] Time to serialize properties into /tmp/CTLFireability2610756793700478561.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/CTLFireability3780931045111510882.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2610756793700478561.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: A(!(((p10==1)&&(p97==1))) U !(A(((AF((((p2==1)&&(p92==1))||((p2==1)&&(p36==1)))) * (p7==1)) * (p47==1)) U !(EF((p87==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(!((E(!(!(E(TRUE U (p87==1)))) U (!(((!(EG(!((((p2==1)&&(p92==1))||((p2==1)&&(p36==1)))))) * (...658
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t14, t15, t16, t17, t18, t20, t22, t27, t28, t29, t30, t31, t33, t35,...554
Detected timeout of ITS tools.
[2026-05-26 11:48:52] [INFO ] Flatten gal took : 6 ms
[2026-05-26 11:48:52] [INFO ] Applying decomposition
[2026-05-26 11:48:52] [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/graph14948064481838206447.txt' '-o' '/tmp/graph14948064481838206447.bin' '-w' '/tmp/graph14948064481838206447.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14948064481838206447.bin' '-l' '-1' '-v' '-w' '/tmp/graph14948064481838206447.weights' '-q' '0' '-e' '0.001'
[2026-05-26 11:48:52] [INFO ] Decomposing Gal with order
[2026-05-26 11:48:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 11:48:52] [INFO ] Removed a total of 409 redundant transitions.
[2026-05-26 11:48:52] [INFO ] Flatten gal took : 18 ms
[2026-05-26 11:48:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 8 ms.
[2026-05-26 11:48:52] [INFO ] Time to serialize gal into /tmp/CTLFireability15730076166712716212.gal : 3 ms
[2026-05-26 11:48:52] [INFO ] Time to serialize properties into /tmp/CTLFireability9704232048158187448.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/CTLFireability15730076166712716212.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9704232048158187448.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,3.25068e+06,22.6963,527040,1866,160,409210,2585,566,5.05719e+06,94,25454,0


Converting to forward existential form...Done !
original formula: A(!(((i0.u3.p10==1)&&(i0.u3.p97==1))) U !(A(((AF((((i2.u0.p2==1)&&(i2.u30.p92==1))||((i2.u0.p2==1)&&(i3.u16.p36==1)))) * (i4.i1.u2.p7==1)...203
=> equivalent forward existential formula: [((Init * !(EG(!(!(!((E(!(!(E(TRUE U (i2.u28.p87==1)))) U (!(((!(EG(!((((i2.u0.p2==1)&&(i2.u30.p92==1))||((i2.u0...859
Reverse transition relation is NOT exact ! Due to transitions t1, t43, t49, t50, t59, t64, t69, t74, t79, t93, t95, t131, t140, t145, t147, t148, t149, t15...718
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 295/295 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 111 transition count 294
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 294
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 109 transition count 291
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 109 transition count 291
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 108 transition count 289
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 108 transition count 289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 106 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 106 transition count 285
Applied a total of 12 rules in 18 ms. Remains 106 /111 variables (removed 5) and now considering 285/295 (removed 10) transitions.
[2026-05-26 11:49:23] [INFO ] Flow matrix only has 260 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10057574796435048876.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-291528182546555149.kers'
[2026-05-26 11:49:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10057574796435048876.kers, --Pflows, --basisKERS=/tmp/petrispot-output-291528182546555149.kers]
Normalized transition count is 259 out of 260 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 259 rows 105 cols 863 entries
Finished phase 1 with 97 SingleSign rule and 0 generalized
[2026-05-26 11:49:23] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-291528182546555149.kers
Total runtime 3 ms.
[2026-05-26 11:49:23] [INFO ] Implicit Places using invariants in 120 ms returned [105]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 126 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 105/111 places, 285/295 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 105 transition count 284
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 104 transition count 284
Applied a total of 2 rules in 8 ms. Remains 104 /105 variables (removed 1) and now considering 284/285 (removed 1) transitions.
[2026-05-26 11:49:23] [INFO ] Flow matrix only has 259 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6398320074310357591.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16785464332538888140.kers'
[2026-05-26 11:49:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6398320074310357591.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16785464332538888140.kers]
Normalized transition count is 258 out of 259 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 258 rows 104 cols 861 entries
Finished phase 1 with 96 SingleSign rule and 0 generalized
[2026-05-26 11:49:23] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16785464332538888140.kers
Total runtime 2 ms.
[2026-05-26 11:49:23] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-26 11:49:23] [INFO ] Flow matrix only has 259 transitions (discarded 25 similar events)
[2026-05-26 11:49:23] [INFO ] Invariant cache hit.
[2026-05-26 11:49:23] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 11:49:23] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 104/111 places, 284/295 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 770 ms. Remains : 104/111 places, 284/295 transitions.
[2026-05-26 11:49:23] [INFO ] Flatten gal took : 6 ms
[2026-05-26 11:49:23] [INFO ] Flatten gal took : 7 ms
[2026-05-26 11:49:23] [INFO ] Input system was already deterministic with 284 transitions.
[2026-05-26 11:49:23] [INFO ] Flatten gal took : 13 ms
[2026-05-26 11:49:23] [INFO ] Flatten gal took : 6 ms
[2026-05-26 11:49:23] [INFO ] Time to serialize gal into /tmp/CTLFireability7888029283112735100.gal : 2 ms
[2026-05-26 11:49:23] [INFO ] Time to serialize properties into /tmp/CTLFireability17725804428405712633.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/CTLFireability7888029283112735100.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17725804428405712633.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(AG((((p10!=1)||(p99!=1)) + (!(E(((p2==1)&&(p29==1)) U ((p7==1)&&(p28==1)))) * ((p12!=1)||(p101!=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((((p10!=1)||(p99!=1)) + (!(E(((p2==1)&&(p29==1)) U ((p7==1)&&(p28==1)))) * ((p12!=1)||...181
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t14, t15, t16, t17, t18, t20, t22, t27, t28, t29, t30, t31, t33, t35,...554
(forward)formula 0,1,5.19009,72876,1,0,498,307544,596,261,5909,294791,581
FORMULA FireWire-PT-03-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 295/295 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 292
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 292
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 109 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 109 transition count 290
Applied a total of 4 rules in 3 ms. Remains 109 /111 variables (removed 2) and now considering 290/295 (removed 5) transitions.
[2026-05-26 11:49:29] [INFO ] Flow matrix only has 264 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-6950322686189470182.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-540955278330557552.kers'
[2026-05-26 11:49:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6950322686189470182.kers, --Pflows, --basisKERS=/tmp/petrispot-output-540955278330557552.kers]
Normalized transition count is 263 out of 264 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 263 rows 109 cols 872 entries
Finished phase 1 with 100 SingleSign rule and 0 generalized
[2026-05-26 11:49:29] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-540955278330557552.kers
Total runtime 2 ms.
[2026-05-26 11:49:29] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-26 11:49:29] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2026-05-26 11:49:29] [INFO ] Invariant cache hit.
[2026-05-26 11:49:29] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 11:49:29] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2026-05-26 11:49:29] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2026-05-26 11:49:29] [INFO ] Invariant cache hit.
[2026-05-26 11:49:29] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/372 variables, 109/126 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 1/373 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/166 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 Real declared 373/373 variables, and 166 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 8/8 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/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/372 variables, 109/126 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 289/454 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/373 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/373 variables, and 455 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 109/111 places, 290/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60475 ms. Remains : 109/111 places, 290/295 transitions.
[2026-05-26 11:50:29] [INFO ] Flatten gal took : 9 ms
[2026-05-26 11:50:29] [INFO ] Flatten gal took : 10 ms
[2026-05-26 11:50:29] [INFO ] Input system was already deterministic with 290 transitions.
[2026-05-26 11:50:29] [INFO ] Flatten gal took : 10 ms
[2026-05-26 11:50:29] [INFO ] Flatten gal took : 10 ms
[2026-05-26 11:50:29] [INFO ] Time to serialize gal into /tmp/CTLFireability7610538369808917306.gal : 2 ms
[2026-05-26 11:50:29] [INFO ] Time to serialize properties into /tmp/CTLFireability8177631605316997655.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/CTLFireability7610538369808917306.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8177631605316997655.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(AX(EG(((p2==0)||(p36==0)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EG(((p2==0)||(p36==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...590
Detected timeout of ITS tools.
[2026-05-26 11:50:59] [INFO ] Flatten gal took : 8 ms
[2026-05-26 11:50:59] [INFO ] Applying decomposition
[2026-05-26 11:50:59] [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/graph10359520641873417618.txt' '-o' '/tmp/graph10359520641873417618.bin' '-w' '/tmp/graph10359520641873417618.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10359520641873417618.bin' '-l' '-1' '-v' '-w' '/tmp/graph10359520641873417618.weights' '-q' '0' '-e' '0.001'
[2026-05-26 11:50:59] [INFO ] Decomposing Gal with order
[2026-05-26 11:50:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 11:50:59] [INFO ] Removed a total of 414 redundant transitions.
[2026-05-26 11:50:59] [INFO ] Flatten gal took : 27 ms
[2026-05-26 11:50:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 83 labels/synchronizations in 6 ms.
[2026-05-26 11:50:59] [INFO ] Time to serialize gal into /tmp/CTLFireability10974555679316160231.gal : 3 ms
[2026-05-26 11:50:59] [INFO ] Time to serialize properties into /tmp/CTLFireability8767036035622341463.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/CTLFireability10974555679316160231.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8767036035622341463.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,5.7602e+06,2.09816,58852,1515,171,89850,1847,603,289927,102,13000,0


Converting to forward existential form...Done !
original formula: AG(AX(EG(((i2.u0.p2==0)||(i3.u15.p36==0)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EG(((i2.u0.p2==0)||(i3.u15.p36==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t47, t49, t53, t54, t62, t63, t68, t73, t78, t83, t96, t99, t100, t101, t102, t138, t148,...754
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
(forward)formula 0,0,10.773,269508,1,0,424488,5668,2936,1.43581e+06,495,27740,578440
FORMULA FireWire-PT-03-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 SI_CTL mode, iteration 0 : 111/111 places, 295/295 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 110 transition count 293
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 109 transition count 293
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 107 transition count 287
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 107 transition count 287
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 105 transition count 283
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 105 transition count 283
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 0 with 2 rules applied. Total rules applied 12 place count 104 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 104 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 103 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 102 transition count 279
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 16 place count 102 transition count 278
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 18 place count 101 transition count 278
Applied a total of 18 rules in 44 ms. Remains 101 /111 variables (removed 10) and now considering 278/295 (removed 17) transitions.
[2026-05-26 11:51:10] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18382985783828375718.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17517645545927230975.kers'
[2026-05-26 11:51:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18382985783828375718.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17517645545927230975.kers]
Normalized transition count is 252 out of 253 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 252 rows 99 cols 826 entries
Finished phase 1 with 93 SingleSign rule and 0 generalized
[2026-05-26 11:51:10] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17517645545927230975.kers
Total runtime 3 ms.
[2026-05-26 11:51:10] [INFO ] Implicit Places using invariants in 147 ms returned []
[2026-05-26 11:51:10] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
[2026-05-26 11:51:10] [INFO ] Invariant cache hit.
[2026-05-26 11:51:11] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-26 11:51:11] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2026-05-26 11:51:11] [INFO ] Redundant transitions in 3 ms returned []
Running 275 sub problems to find dead transitions.
[2026-05-26 11:51:11] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
[2026-05-26 11:51:11] [INFO ] Invariant cache hit.
[2026-05-26 11:51:11] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/116 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 35/151 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 0/353 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/354 variables, and 151 constraints, problems are : Problem set: 0 solved, 275 unsolved in 24018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/116 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 35/151 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 275/426 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/354 variables, and 426 constraints, problems are : Problem set: 0 solved, 275 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54126ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 54127ms
Starting structural reductions in SI_CTL mode, iteration 1 : 101/111 places, 278/295 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54695 ms. Remains : 101/111 places, 278/295 transitions.
[2026-05-26 11:52:05] [INFO ] Flatten gal took : 9 ms
[2026-05-26 11:52:05] [INFO ] Flatten gal took : 9 ms
[2026-05-26 11:52:05] [INFO ] Input system was already deterministic with 278 transitions.
[2026-05-26 11:52:05] [INFO ] Flatten gal took : 9 ms
[2026-05-26 11:52:05] [INFO ] Flatten gal took : 10 ms
[2026-05-26 11:52:05] [INFO ] Time to serialize gal into /tmp/CTLFireability1026121077676644934.gal : 2 ms
[2026-05-26 11:52:05] [INFO ] Time to serialize properties into /tmp/CTLFireability16376595192119739051.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/CTLFireability1026121077676644934.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16376595192119739051.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(EF(EG(((p2==1)&&(p42==1)))) U AF(((p7==1)&&(p76==1))))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U EG(((p2==1)&&(p42==1))))) * !(EG(!(((p7==1)&&(p76==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t14, t15, t16, t17, t18, t20, t22, t27, t28, t29, t30, t31, t33, t35,...542
Detected timeout of ITS tools.
[2026-05-26 11:52:35] [INFO ] Flatten gal took : 5 ms
[2026-05-26 11:52:35] [INFO ] Applying decomposition
[2026-05-26 11:52:35] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph18206475250524711549.txt' '-o' '/tmp/graph18206475250524711549.bin' '-w' '/tmp/graph18206475250524711549.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18206475250524711549.bin' '-l' '-1' '-v' '-w' '/tmp/graph18206475250524711549.weights' '-q' '0' '-e' '0.001'
[2026-05-26 11:52:35] [INFO ] Decomposing Gal with order
[2026-05-26 11:52:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 11:52:35] [INFO ] Removed a total of 406 redundant transitions.
[2026-05-26 11:52:35] [INFO ] Flatten gal took : 16 ms
[2026-05-26 11:52:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 5 ms.
[2026-05-26 11:52:35] [INFO ] Time to serialize gal into /tmp/CTLFireability4735764623326535326.gal : 3 ms
[2026-05-26 11:52:35] [INFO ] Time to serialize properties into /tmp/CTLFireability8852316799296399952.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/CTLFireability4735764623326535326.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8852316799296399952.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 295/295 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 111 transition count 294
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 294
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 108 transition count 288
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 108 transition count 288
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 106 transition count 284
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 106 transition count 284
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 104 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 104 transition count 280
Applied a total of 16 rules in 19 ms. Remains 104 /111 variables (removed 7) and now considering 280/295 (removed 15) transitions.
[2026-05-26 11:53:05] [INFO ] Flow matrix only has 255 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8680654801555851798.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7298609796521126630.kers'
[2026-05-26 11:53:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8680654801555851798.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7298609796521126630.kers]
Normalized transition count is 254 out of 255 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 254 rows 103 cols 845 entries
Finished phase 1 with 95 SingleSign rule and 0 generalized
[2026-05-26 11:53:05] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7298609796521126630.kers
Total runtime 2 ms.
[2026-05-26 11:53:05] [INFO ] Implicit Places using invariants in 85 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 103/111 places, 280/295 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 103 transition count 279
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 102 transition count 279
Applied a total of 2 rules in 4 ms. Remains 102 /103 variables (removed 1) and now considering 279/280 (removed 1) transitions.
[2026-05-26 11:53:05] [INFO ] Flow matrix only has 254 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4989835159762131123.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8467686797274326267.kers'
[2026-05-26 11:53:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4989835159762131123.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8467686797274326267.kers]
Normalized transition count is 253 out of 254 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 253 rows 102 cols 843 entries
Finished phase 1 with 94 SingleSign rule and 0 generalized
[2026-05-26 11:53:05] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8467686797274326267.kers
Total runtime 1 ms.
[2026-05-26 11:53:05] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-26 11:53:05] [INFO ] Flow matrix only has 254 transitions (discarded 25 similar events)
[2026-05-26 11:53:05] [INFO ] Invariant cache hit.
[2026-05-26 11:53:05] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-26 11:53:06] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 102/111 places, 279/295 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 464 ms. Remains : 102/111 places, 279/295 transitions.
[2026-05-26 11:53:06] [INFO ] Flatten gal took : 6 ms
[2026-05-26 11:53:06] [INFO ] Flatten gal took : 7 ms
[2026-05-26 11:53:06] [INFO ] Input system was already deterministic with 279 transitions.
[2026-05-26 11:53:06] [INFO ] Flatten gal took : 7 ms
[2026-05-26 11:53:06] [INFO ] Flatten gal took : 7 ms
[2026-05-26 11:53:06] [INFO ] Time to serialize gal into /tmp/CTLFireability12050880206754032719.gal : 2 ms
[2026-05-26 11:53:06] [INFO ] Time to serialize properties into /tmp/CTLFireability6856935830942644273.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/CTLFireability12050880206754032719.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6856935830942644273.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(E(!((E(((p7==1)&&(p74==1)) U ((p8==1)&&(p61==1))) * (((p4==1)&&(p44==1))||((p11==1)&&(p21==1))))) U ((A(((p70==1)&&(p104==1)) U ((p7==...194
=> equivalent forward existential formula: [FwdG(Init,!(E(!((E(((p7==1)&&(p74==1)) U ((p8==1)&&(p61==1))) * (((p4==1)&&(p44==1))||((p11==1)&&(p21==1))))) U...306
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t14, t15, t16, t17, t18, t20, t22, t27, t28, t29, t30, t31, t33, t35,...542
Detected timeout of ITS tools.
[2026-05-26 11:53:36] [INFO ] Flatten gal took : 6 ms
[2026-05-26 11:53:36] [INFO ] Applying decomposition
[2026-05-26 11:53:36] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17177330335465000002.txt' '-o' '/tmp/graph17177330335465000002.bin' '-w' '/tmp/graph17177330335465000002.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17177330335465000002.bin' '-l' '-1' '-v' '-w' '/tmp/graph17177330335465000002.weights' '-q' '0' '-e' '0.001'
[2026-05-26 11:53:36] [INFO ] Decomposing Gal with order
[2026-05-26 11:53:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 11:53:36] [INFO ] Removed a total of 404 redundant transitions.
[2026-05-26 11:53:36] [INFO ] Flatten gal took : 17 ms
[2026-05-26 11:53:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 4 ms.
[2026-05-26 11:53:36] [INFO ] Time to serialize gal into /tmp/CTLFireability17316961146279962950.gal : 3 ms
[2026-05-26 11:53:36] [INFO ] Time to serialize properties into /tmp/CTLFireability10627526377090057133.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/CTLFireability17316961146279962950.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10627526377090057133.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,3.07891e+06,11.4669,291892,2138,144,297147,4368,511,2.34439e+06,90,46627,0


Converting to forward existential form...Done !
original formula: AF(E(!((E(((i6.u2.p7==1)&&(i5.u24.p74==1)) U ((i1.u3.p8==1)&&(i5.u24.p61==1))) * (((i1.u1.p4==1)&&(i1.u12.p44==1))||((i1.u3.p11==1)&&(i1....284
=> equivalent forward existential formula: [FwdG(Init,!(E(!((E(((i6.u2.p7==1)&&(i5.u24.p74==1)) U ((i1.u3.p8==1)&&(i5.u24.p61==1))) * (((i1.u1.p4==1)&&(i1....420
Reverse transition relation is NOT exact ! Due to transitions t1, t43, t49, t50, t59, t64, t69, t74, t79, t93, t95, t131, t140, t145, t147, t148, t149, t15...679
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 295/295 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 292
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 292
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 109 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 109 transition count 290
Applied a total of 4 rules in 2 ms. Remains 109 /111 variables (removed 2) and now considering 290/295 (removed 5) transitions.
[2026-05-26 11:54:06] [INFO ] Flow matrix only has 264 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-12867178105711912721.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-121108587706738830.kers'
[2026-05-26 11:54:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12867178105711912721.kers, --Pflows, --basisKERS=/tmp/petrispot-output-121108587706738830.kers]
Normalized transition count is 263 out of 264 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 263 rows 109 cols 872 entries
Finished phase 1 with 100 SingleSign rule and 0 generalized
[2026-05-26 11:54:06] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-121108587706738830.kers
Total runtime 1 ms.
[2026-05-26 11:54:06] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-26 11:54:06] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2026-05-26 11:54:06] [INFO ] Invariant cache hit.
[2026-05-26 11:54:06] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 11:54:06] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2026-05-26 11:54:06] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2026-05-26 11:54:06] [INFO ] Invariant cache hit.
[2026-05-26 11:54:06] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/372 variables, 109/126 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 1/373 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 373/373 variables, and 166 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 8/8 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/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/372 variables, 109/126 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 289/454 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/373 variables, 1/455 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 373/373 variables, and 455 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Starting structural reductions in LTL mode, iteration 1 : 109/111 places, 290/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60413 ms. Remains : 109/111 places, 290/295 transitions.
[2026-05-26 11:55:06] [INFO ] Flatten gal took : 7 ms
[2026-05-26 11:55:06] [INFO ] Flatten gal took : 9 ms
[2026-05-26 11:55:06] [INFO ] Input system was already deterministic with 290 transitions.
[2026-05-26 11:55:06] [INFO ] Flatten gal took : 8 ms
[2026-05-26 11:55:06] [INFO ] Flatten gal took : 9 ms
[2026-05-26 11:55:06] [INFO ] Time to serialize gal into /tmp/CTLFireability6986294526027132404.gal : 2 ms
[2026-05-26 11:55:06] [INFO ] Time to serialize properties into /tmp/CTLFireability5607112575106484394.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/CTLFireability6986294526027132404.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5607112575106484394.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (AX((((((p5==1)&&(p23==1)) + ((AX(((p70==0)||(p104==0))) * ((p3==0)||(p99==0))) * ((p2==0)||(p36==0)))) * (p7==1)) * (p24==1))) + EF(EG((...178
=> equivalent forward existential formula: (((([(EY((EY((Init * !(E(TRUE U EG(((p11==1)&&(p100==1))))))) * !(((p5==1)&&(p23==1))))) * !(((p70==0)||(p104==0...567
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...590
(forward)formula 0,0,4.00517,76800,1,0,558,302350,604,287,5937,314923,652
FORMULA FireWire-PT-03-CTLFireability-2024-13 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 : 111/111 places, 295/295 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 292
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 292
Applied a total of 2 rules in 3 ms. Remains 110 /111 variables (removed 1) and now considering 292/295 (removed 3) transitions.
[2026-05-26 11:55:10] [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-14499652554317397078.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7330152024728497581.kers'
[2026-05-26 11:55:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14499652554317397078.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7330152024728497581.kers]
Normalized transition count is 265 out of 266 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 265 rows 110 cols 880 entries
Finished phase 1 with 101 SingleSign rule and 0 generalized
[2026-05-26 11:55:10] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7330152024728497581.kers
Total runtime 1 ms.
[2026-05-26 11:55:10] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-26 11:55:10] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
[2026-05-26 11:55:10] [INFO ] Invariant cache hit.
[2026-05-26 11:55:11] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 11:55:11] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Running 291 sub problems to find dead transitions.
[2026-05-26 11:55:11] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
[2026-05-26 11:55:11] [INFO ] Invariant cache hit.
[2026-05-26 11:55:11] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (OVERLAPS) 265/375 variables, 110/127 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 39/166 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 1/376 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 376/376 variables, and 167 constraints, problems are : Problem set: 0 solved, 291 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 110/110 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 8/8 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/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (OVERLAPS) 265/375 variables, 110/127 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 39/166 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 291/457 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (OVERLAPS) 1/376 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 458 constraints, problems are : Problem set: 0 solved, 291 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 110/110 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 60132ms
Starting structural reductions in LTL mode, iteration 1 : 110/111 places, 292/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60691 ms. Remains : 110/111 places, 292/295 transitions.
[2026-05-26 11:56:11] [INFO ] Flatten gal took : 9 ms
[2026-05-26 11:56:11] [INFO ] Flatten gal took : 9 ms
[2026-05-26 11:56:11] [INFO ] Input system was already deterministic with 292 transitions.
[2026-05-26 11:56:11] [INFO ] Flatten gal took : 10 ms
[2026-05-26 11:56:11] [INFO ] Flatten gal took : 10 ms
[2026-05-26 11:56:11] [INFO ] Time to serialize gal into /tmp/CTLFireability14877934238571773934.gal : 3 ms
[2026-05-26 11:56:11] [INFO ] Time to serialize properties into /tmp/CTLFireability15597968863032377688.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/CTLFireability14877934238571773934.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15597968863032377688.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.91402e+06,3.14394,68188,2,4218,5,196449,6,0,729,191998,0


Converting to forward existential form...Done !
original formula: !(A((!(A(((((p7==1)&&(p101==1))&&((p7==1)&&(p47==1)))&&((p7==1)&&(p24==1))) U !(A(((p3==1)&&(p37==1)) U ((p2==1)&&(p38==1)))))) + AG(((EX...329
=> equivalent forward existential formula: ([((FwdU(Init,!(EX(!(EX(!((EG(((p12==1)&&(p26==1))) + (((p87==1)&&(p7==1))&&(p25==1))))))))) * !((!(!((E(!(!(!((...924
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...590
Detected timeout of ITS tools.
[2026-05-26 11:56:41] [INFO ] Flatten gal took : 6 ms
[2026-05-26 11:56:41] [INFO ] Applying decomposition
[2026-05-26 11:56:41] [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/graph7521698270140974365.txt' '-o' '/tmp/graph7521698270140974365.bin' '-w' '/tmp/graph7521698270140974365.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7521698270140974365.bin' '-l' '-1' '-v' '-w' '/tmp/graph7521698270140974365.weights' '-q' '0' '-e' '0.001'
[2026-05-26 11:56:41] [INFO ] Decomposing Gal with order
[2026-05-26 11:56:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 11:56:41] [INFO ] Removed a total of 427 redundant transitions.
[2026-05-26 11:56:41] [INFO ] Flatten gal took : 36 ms
[2026-05-26 11:56:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 3 ms.
[2026-05-26 11:56:41] [INFO ] Time to serialize gal into /tmp/CTLFireability12845945373553883121.gal : 3 ms
[2026-05-26 11:56:41] [INFO ] Time to serialize properties into /tmp/CTLFireability15696495639120641027.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/CTLFireability12845945373553883121.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15696495639120641027.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,5.91402e+06,4.9243,118244,1765,178,144283,2722,569,736823,93,31347,0


Converting to forward existential form...Done !
original formula: !(A((!(A(((((i3.u2.p7==1)&&(i6.u33.p101==1))&&((i3.u2.p7==1)&&(i3.u15.p47==1)))&&((i3.u2.p7==1)&&(i2.u7.p24==1))) U !(A(((i0.u1.p3==1)&&(...473
=> equivalent forward existential formula: ([((FwdU(Init,!(EX(!(EX(!((EG(((i4.u3.p12==1)&&(i2.u9.p26==1))) + (((i5.u28.p87==1)&&(i3.u2.p7==1))&&(i2.u7.p25=...1260
Reverse transition relation is NOT exact ! Due to transitions t47, t49, t50, t53, t54, t57, t59, t62, t63, t83, t86, t97, t99, t139, t148, t153, t155, t156...764
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 295/295 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 110 transition count 293
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 109 transition count 293
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 107 transition count 287
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 107 transition count 287
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 105 transition count 283
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 105 transition count 283
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 0 with 2 rules applied. Total rules applied 12 place count 104 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 104 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 103 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 102 transition count 279
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 16 place count 102 transition count 278
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 18 place count 101 transition count 278
Applied a total of 18 rules in 24 ms. Remains 101 /111 variables (removed 10) and now considering 278/295 (removed 17) transitions.
[2026-05-26 11:57:11] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-702241832675152239.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-253507509583552013.kers'
[2026-05-26 11:57:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-702241832675152239.kers, --Pflows, --basisKERS=/tmp/petrispot-output-253507509583552013.kers]
Normalized transition count is 252 out of 253 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 252 rows 99 cols 826 entries
Finished phase 1 with 93 SingleSign rule and 0 generalized
[2026-05-26 11:57:11] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-253507509583552013.kers
Total runtime 1 ms.
[2026-05-26 11:57:11] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-26 11:57:11] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
[2026-05-26 11:57:11] [INFO ] Invariant cache hit.
[2026-05-26 11:57:12] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-26 11:57:12] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2026-05-26 11:57:12] [INFO ] Redundant transitions in 2 ms returned []
Running 275 sub problems to find dead transitions.
[2026-05-26 11:57:12] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
[2026-05-26 11:57:12] [INFO ] Invariant cache hit.
[2026-05-26 11:57:12] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/116 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 35/151 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 0/353 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/354 variables, and 151 constraints, problems are : Problem set: 0 solved, 275 unsolved in 22943 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/116 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 35/151 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 275/426 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/354 variables, and 426 constraints, problems are : Problem set: 0 solved, 275 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53013ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 53014ms
Starting structural reductions in SI_CTL mode, iteration 1 : 101/111 places, 278/295 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53335 ms. Remains : 101/111 places, 278/295 transitions.
[2026-05-26 11:58:05] [INFO ] Flatten gal took : 9 ms
[2026-05-26 11:58:05] [INFO ] Flatten gal took : 9 ms
[2026-05-26 11:58:05] [INFO ] Input system was already deterministic with 278 transitions.
[2026-05-26 11:58:05] [INFO ] Flatten gal took : 9 ms
[2026-05-26 11:58:05] [INFO ] Flatten gal took : 14 ms
[2026-05-26 11:58:05] [INFO ] Time to serialize gal into /tmp/CTLFireability10664915454930827689.gal : 3 ms
[2026-05-26 11:58:05] [INFO ] Time to serialize properties into /tmp/CTLFireability2780835428087146270.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/CTLFireability10664915454930827689.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2780835428087146270.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (EF(AG((((!(E((p50==1) U ((p10==1)&&(p20==1)))) * (p11==1)) * (p21==1)) + !(E(((p9==1)&&(p100==1)) U ((p10==1)&&(p49==1))))))) + ((AF((!(...319
=> equivalent forward existential formula: (([FwdG((Init * !(E(TRUE U !(E(TRUE U !((((!(E((p50==1) U ((p10==1)&&(p20==1)))) * (p11==1)) * (p21==1)) + !(E((...859
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t14, t15, t16, t17, t18, t20, t22, t27, t28, t29, t30, t31, t33, t35,...542
Detected timeout of ITS tools.
[2026-05-26 11:58:35] [INFO ] Flatten gal took : 5 ms
[2026-05-26 11:58:35] [INFO ] Applying decomposition
[2026-05-26 11:58:35] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9660635551823765557.txt' '-o' '/tmp/graph9660635551823765557.bin' '-w' '/tmp/graph9660635551823765557.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9660635551823765557.bin' '-l' '-1' '-v' '-w' '/tmp/graph9660635551823765557.weights' '-q' '0' '-e' '0.001'
[2026-05-26 11:58:35] [INFO ] Decomposing Gal with order
[2026-05-26 11:58:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 11:58:35] [INFO ] Removed a total of 406 redundant transitions.
[2026-05-26 11:58:35] [INFO ] Flatten gal took : 18 ms
[2026-05-26 11:58:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 3 ms.
[2026-05-26 11:58:35] [INFO ] Time to serialize gal into /tmp/CTLFireability16012432307909758116.gal : 3 ms
[2026-05-26 11:58:35] [INFO ] Time to serialize properties into /tmp/CTLFireability17083840974996237646.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/CTLFireability16012432307909758116.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17083840974996237646.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,3.07891e+06,26.0165,411532,1362,117,524841,2563,566,2.38315e+06,85,35380,0


Converting to forward existential form...Done !
original formula: (EF(AG((((!(E((i4.u16.p50==1) U ((i2.i0.u3.p10==1)&&(i2.i0.u6.p20==1)))) * (i2.i0.u3.p11==1)) * (i2.i0.u6.p21==1)) + !(E(((i6.u25.p9==1)&...487
=> equivalent forward existential formula: (([FwdG((Init * !(E(TRUE U !(E(TRUE U !((((!(E((i4.u16.p50==1) U ((i2.i0.u3.p10==1)&&(i2.i0.u6.p20==1)))) * (i2....1227
Reverse transition relation is NOT exact ! Due to transitions t1, t43, t49, t50, t59, t64, t69, t74, t79, t93, t95, t131, t140, t145, t147, t148, t149, t15...710
Detected timeout of ITS tools.
[2026-05-26 11:59:05] [INFO ] Flatten gal took : 11 ms
[2026-05-26 11:59:05] [INFO ] Flatten gal took : 10 ms
[2026-05-26 11:59:05] [INFO ] Applying decomposition
[2026-05-26 11:59:05] [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/graph6560230358778815508.txt' '-o' '/tmp/graph6560230358778815508.bin' '-w' '/tmp/graph6560230358778815508.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6560230358778815508.bin' '-l' '-1' '-v' '-w' '/tmp/graph6560230358778815508.weights' '-q' '0' '-e' '0.001'
[2026-05-26 11:59:05] [INFO ] Decomposing Gal with order
[2026-05-26 11:59:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 11:59:05] [INFO ] Removed a total of 432 redundant transitions.
[2026-05-26 11:59:05] [INFO ] Flatten gal took : 26 ms
[2026-05-26 11:59:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 6 ms.
[2026-05-26 11:59:05] [INFO ] Time to serialize gal into /tmp/CTLFireability6651443793330619210.gal : 5 ms
[2026-05-26 11:59:05] [INFO ] Time to serialize properties into /tmp/CTLFireability12745219792510480180.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/CTLFireability6651443793330619210.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12745219792510480180.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 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.07872e+06,3.53414,77752,1544,202,118543,1700,568,299932,87,15874,0


Converting to forward existential form...Done !
original formula: E(((AG((EF((((i0.u0.p2==1)&&(i0.u12.p40==1))||((i5.u3.p10==1)&&(i0.u12.p39==1)))) * E(AG(((i2.u7.p22==1)&&(i1.u10.p35==1))) U EX(((i0.u0....403
=> equivalent forward existential formula: [(FwdU(Init,((!(E(TRUE U !((E(TRUE U (((i0.u0.p2==1)&&(i0.u12.p40==1))||((i5.u3.p10==1)&&(i0.u12.p39==1)))) * E(...497
Reverse transition relation is NOT exact ! Due to transitions t47, t49, t50, t53, t54, t62, t63, t83, t86, t97, t99, t139, t148, t153, t155, t156, t157, t1...775
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,1,45.3178,822892,1,0,1.22782e+06,6983,3066,3.73202e+06,405,51013,2573865
FORMULA FireWire-PT-03-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((A((((EF(((i0.u1.p3==1)&&(i0.u31.p91==1))) + ((i8.u25.p74!=1)&&(i8.u23.p70==1))) + ((i4.u2.p7==1)&&(i4.u14.p46==1))) * A(((i0.u1.p3==1...310
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !((E(!(!((E(!(((i2.u7.p5==1)&&(i4.u16.p51==1))) U (!(!(E(TRUE U !(((i2.u7.p5==1)&&(i4.u1...951
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
(forward)formula 1,0,73.3395,1357732,1,0,1.97303e+06,7847,3173,5.58091e+06,406,59787,4025167
FORMULA FireWire-PT-03-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (!(E(!((((((i5.u3.p11==1)&&(i5.u3.p100==1)) + ((AF(((i4.u2.p6==1)&&(i8.u25.p75==1))) * (i8.u25.p74==1)) * ((i2.u7.p5==1)&&(i4.u16.p50==1)...345
=> equivalent forward existential formula: ([(FwdU((Init * !(!(E(!((((((i5.u3.p11==1)&&(i5.u3.p100==1)) + ((!(EG(!(((i4.u2.p6==1)&&(i8.u25.p75==1))))) * (i...803
Fast SCC detection found an SCC at level 8
(forward)formula 2,0,87.3877,1645500,1,0,2.39365e+06,8570,3664,6.47283e+06,431,67319,5037508
FORMULA FireWire-PT-03-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(!(((i5.u3.p10==1)&&(i5.u3.p97==1))) U !(A(((AF((((i0.u0.p2==1)&&(i0.u31.p92==1))||((i0.u0.p2==1)&&(i4.u16.p36==1)))) * (i4.u2.p7==1)) *...200
=> equivalent forward existential formula: [((Init * !(EG(!(!(!((E(!(!(E(TRUE U (i7.u29.p87==1)))) U (!(((!(EG(!((((i0.u0.p2==1)&&(i0.u31.p92==1))||((i0.u0...850
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 2
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
Fast SCC detection found an SCC at level 8
(forward)formula 3,1,100.597,1918824,1,0,2.79947e+06,9034,3732,7.46222e+06,433,70051,5789781
FORMULA FireWire-PT-03-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(EF(EG(((i0.u0.p2==1)&&(i5.u13.p42==1)))) U AF(((i4.u2.p7==1)&&(i8.u25.p76==1))))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U EG(((i0.u0.p2==1)&&(i5.u13.p42==1))))) * !(EG(!(((i4.u2.p7==1)&&(i8.u25.p76==1))))))] != FA...158
(forward)formula 4,0,105.71,2037688,1,0,2.9811e+06,9140,3760,7.81503e+06,433,71016,6145648
FORMULA FireWire-PT-03-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(E(!((E(((i4.u2.p7==1)&&(i8.u25.p74==1)) U ((i5.u3.p8==1)&&(i8.u25.p61==1))) * (((i0.u1.p4==1)&&(i5.u13.p44==1))||((i5.u3.p11==1)&&(i1....287
=> equivalent forward existential formula: [FwdG(Init,!(E(!((E(((i4.u2.p7==1)&&(i8.u25.p74==1)) U ((i5.u3.p8==1)&&(i8.u25.p61==1))) * (((i0.u1.p4==1)&&(i5....423
(forward)formula 5,1,129.261,2201428,1,0,3.23413e+06,9357,1614,8.2611e+06,218,72658,210732
FORMULA FireWire-PT-03-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(A((!(A(((((i4.u2.p7==1)&&(i8.u25.p101==1))&&((i4.u2.p7==1)&&(i4.u15.p47==1)))&&((i4.u2.p7==1)&&(i2.u7.p24==1))) U !(A(((i0.u1.p3==1)&&(...473
=> equivalent forward existential formula: ([((FwdU(Init,!(EX(!(EX(!((EG(((i5.u3.p12==1)&&(i2.u9.p26==1))) + (((i7.u29.p87==1)&&(i4.u2.p7==1))&&(i2.u7.p25=...1260
(forward)formula 6,1,166.866,2201432,1,0,3.23413e+06,9357,2200,8.2611e+06,253,72658,3271761
FORMULA FireWire-PT-03-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EF(AG((((!(E((i4.u16.p50==1) U ((i5.u3.p10==1)&&(i1.u6.p20==1)))) * (i5.u3.p11==1)) * (i1.u6.p21==1)) + !(E(((i8.u25.p9==1)&&(i5.u3.p100...451
=> equivalent forward existential formula: (([FwdG((Init * !(E(TRUE U !(E(TRUE U !((((!(E((i4.u16.p50==1) U ((i5.u3.p10==1)&&(i1.u6.p20==1)))) * (i5.u3.p11...1143
(forward)formula 7,1,191.304,2201432,1,0,3.23413e+06,9357,2454,8.2611e+06,267,72658,4930571
FORMULA FireWire-PT-03-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

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

BK_STOP 1779796937656

--------------------
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-03"
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-03, 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-177955808900162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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