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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.9K Mar 7 05:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 7 05:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 7 05:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 7 05:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Mar 7 05:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Mar 7 05:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 7 05:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Mar 7 05:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:08 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 90K 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-15-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779830384176

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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-26 21:19:46] [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 21:19:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 21:19:47] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2026-05-26 21:19:47] [INFO ] Transformed 248 places.
[2026-05-26 21:19:47] [INFO ] Transformed 383 transitions.
[2026-05-26 21:19:47] [INFO ] Found NUPN structural information;
[2026-05-26 21:19:47] [INFO ] Parsed PT model containing 248 places and 383 transitions and 1144 arcs in 415 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 29 ms.
Support contains 100 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 383/383 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 243 transition count 383
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 43 place count 205 transition count 345
Iterating global reduction 1 with 38 rules applied. Total rules applied 81 place count 205 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 82 place count 205 transition count 344
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 87 place count 200 transition count 338
Iterating global reduction 2 with 5 rules applied. Total rules applied 92 place count 200 transition count 338
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 199 transition count 337
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 199 transition count 337
Applied a total of 94 rules in 123 ms. Remains 199 /248 variables (removed 49) and now considering 337/383 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3404991309650938830.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7447970044012415323.kers'
[2026-05-26 21:19:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3404991309650938830.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7447970044012415323.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 337 rows 199 cols 1039 entries
Finished phase 1 with 195 SingleSign rule and 0 generalized
[2026-05-26 21:19:47] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7447970044012415323.kers
Total runtime 4 ms.
[2026-05-26 21:19:48] [INFO ] Implicit Places using invariants in 630 ms returned []
[2026-05-26 21:19:48] [INFO ] Invariant cache hit.
[2026-05-26 21:19:49] [INFO ] Implicit Places using invariants and state equation in 670 ms returned []
Implicit Place search using SMT with State Equation took 1369 ms to find 0 implicit places.
Running 336 sub problems to find dead transitions.
[2026-05-26 21:19:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Problem TDEAD153 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD312 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 15/19 constraints. Problems are: Problem set: 18 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 3/22 constraints. Problems are: Problem set: 18 solved, 318 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/22 constraints. Problems are: Problem set: 18 solved, 318 unsolved
At refinement iteration 5 (OVERLAPS) 337/536 variables, 199/221 constraints. Problems are: Problem set: 18 solved, 318 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/536 variables, and 224 constraints, problems are : Problem set: 18 solved, 318 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 18 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 4/4 constraints. Problems are: Problem set: 18 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 21/25 constraints. Problems are: Problem set: 18 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 1/26 constraints. Problems are: Problem set: 18 solved, 318 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/26 constraints. Problems are: Problem set: 18 solved, 318 unsolved
At refinement iteration 5 (OVERLAPS) 337/536 variables, 199/225 constraints. Problems are: Problem set: 18 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 318/543 constraints. Problems are: Problem set: 18 solved, 318 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 536/536 variables, and 543 constraints, problems are : Problem set: 18 solved, 318 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 318/336 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60386ms problems are : Problem set: 18 solved, 318 unsolved
Search for dead transitions found 18 dead transitions in 60425ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 199/248 places, 319/383 transitions.
Applied a total of 0 rules in 10 ms. Remains 199 /199 variables (removed 0) and now considering 319/319 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62009 ms. Remains : 199/248 places, 319/383 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 319/319 transitions.
Applied a total of 0 rules in 10 ms. Remains 199 /199 variables (removed 0) and now considering 319/319 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10521306131698946232.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7880844517722932671.kers'
[2026-05-26 21:20:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10521306131698946232.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7880844517722932671.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 319 rows 199 cols 967 entries
Finished phase 1 with 195 SingleSign rule and 0 generalized
[2026-05-26 21:20:49] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7880844517722932671.kers
Total runtime 4 ms.
[2026-05-26 21:20:49] [INFO ] Implicit Places using invariants in 197 ms returned []
[2026-05-26 21:20:49] [INFO ] Invariant cache hit.
[2026-05-26 21:20:50] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
Running 318 sub problems to find dead transitions.
[2026-05-26 21:20:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 318 unsolved
Problem TDEAD154 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 20/24 constraints. Problems are: Problem set: 30 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 3/27 constraints. Problems are: Problem set: 30 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 6/33 constraints. Problems are: Problem set: 30 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 2/35 constraints. Problems are: Problem set: 30 solved, 288 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 199/518 variables, and 36 constraints, problems are : Problem set: 30 solved, 288 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/199 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 30 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 30 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 4/4 constraints. Problems are: Problem set: 30 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 32/36 constraints. Problems are: Problem set: 30 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 1/37 constraints. Problems are: Problem set: 30 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/37 constraints. Problems are: Problem set: 30 solved, 288 unsolved
At refinement iteration 5 (OVERLAPS) 319/518 variables, 199/236 constraints. Problems are: Problem set: 30 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 288/524 constraints. Problems are: Problem set: 30 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 2/526 constraints. Problems are: Problem set: 30 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/518 variables, and 526 constraints, problems are : Problem set: 30 solved, 288 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 288/318 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60121ms problems are : Problem set: 30 solved, 288 unsolved
Search for dead transitions found 30 dead transitions in 60128ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 199/199 places, 289/319 transitions.
Applied a total of 0 rules in 6 ms. Remains 199 /199 variables (removed 0) and now considering 289/289 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60724 ms. Remains : 199/199 places, 289/319 transitions.
Support contains 100 out of 199 places after structural reductions.
[2026-05-26 21:21:50] [INFO ] Flatten gal took : 72 ms
[2026-05-26 21:21:50] [INFO ] Flatten gal took : 43 ms
[2026-05-26 21:21:50] [INFO ] Input system was already deterministic with 289 transitions.
Support contains 99 out of 199 places (down from 100) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2369 ms. (16 steps per ms) remains 61/83 properties
BEST_FIRST walk for 4000 steps (9 resets) in 105 ms. (37 steps per ms) remains 60/61 properties
BEST_FIRST walk for 4000 steps (9 resets) in 81 ms. (48 steps per ms) remains 59/60 properties
BEST_FIRST walk for 4001 steps (10 resets) in 77 ms. (51 steps per ms) remains 55/59 properties
BEST_FIRST walk for 4002 steps (14 resets) in 46 ms. (85 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (9 resets) in 36 ms. (108 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (12 resets) in 37 ms. (105 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (8 resets) in 36 ms. (108 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (15 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (12 resets) in 36 ms. (108 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (11 resets) in 25 ms. (153 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (12 resets) in 41 ms. (95 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (9 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (10 resets) in 22 ms. (173 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (11 resets) in 40 ms. (97 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (10 resets) in 44 ms. (88 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (10 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (11 resets) in 40 ms. (97 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (13 resets) in 22 ms. (173 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (16 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (12 resets) in 30 ms. (129 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (12 resets) in 25 ms. (153 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (11 resets) in 25 ms. (153 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (11 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (12 resets) in 27 ms. (142 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (11 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (10 resets) in 27 ms. (142 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (11 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (12 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (10 resets) in 27 ms. (142 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (10 resets) in 32 ms. (121 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (9 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (12 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (11 resets) in 34 ms. (114 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (10 resets) in 33 ms. (117 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (9 resets) in 37 ms. (105 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (14 resets) in 35 ms. (111 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (8 resets) in 43 ms. (90 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (10 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (9 resets) in 41 ms. (95 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (11 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (15 resets) in 36 ms. (108 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (9 resets) in 51 ms. (76 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (10 resets) in 28 ms. (138 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (10 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (10 resets) in 28 ms. (137 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (10 resets) in 30 ms. (129 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (11 resets) in 41 ms. (95 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (10 resets) in 34 ms. (114 steps per ms) remains 55/55 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6200676778310283747.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12853974375058865765.kers'
[2026-05-26 21:21:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6200676778310283747.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12853974375058865765.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 289 rows 199 cols 847 entries
Finished phase 1 with 195 SingleSign rule and 0 generalized
[2026-05-26 21:21:52] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12853974375058865765.kers
Total runtime 2 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp77 is UNSAT
At refinement iteration 1 (OVERLAPS) 120/189 variables, 4/4 constraints. Problems are: Problem set: 5 solved, 50 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp80 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 5/9 constraints. Problems are: Problem set: 10 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 2/11 constraints. Problems are: Problem set: 10 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 1/12 constraints. Problems are: Problem set: 10 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/12 constraints. Problems are: Problem set: 10 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 281/470 variables, 189/201 constraints. Problems are: Problem set: 10 solved, 45 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/488 variables, and 201 constraints, problems are : Problem set: 10 solved, 45 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 189/199 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 131/189 variables, 4/4 constraints. Problems are: Problem set: 10 solved, 45 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 8/12 constraints. Problems are: Problem set: 12 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 1/13 constraints. Problems are: Problem set: 12 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 1/14 constraints. Problems are: Problem set: 12 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 1/15 constraints. Problems are: Problem set: 12 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/15 constraints. Problems are: Problem set: 12 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 281/470 variables, 189/204 constraints. Problems are: Problem set: 12 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 40/244 constraints. Problems are: Problem set: 12 solved, 43 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/488 variables, and 244 constraints, problems are : Problem set: 12 solved, 43 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 189/199 constraints, PredecessorRefiner: 40/55 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10047ms problems are : Problem set: 12 solved, 43 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 55 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 289/289 transitions.
Graph (trivial) has 88 edges and 199 vertex of which 12 / 199 are part of one of the 3 SCC in 11 ms
Free SCC test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 190 transition count 262
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 176 transition count 260
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 33 place count 175 transition count 259
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 34 place count 174 transition count 259
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 34 place count 174 transition count 253
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 46 place count 168 transition count 253
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 54 place count 160 transition count 245
Iterating global reduction 4 with 8 rules applied. Total rules applied 62 place count 160 transition count 245
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 62 place count 160 transition count 243
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 66 place count 158 transition count 243
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 94 place count 144 transition count 229
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 106 place count 138 transition count 268
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 107 place count 138 transition count 267
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 114 place count 138 transition count 260
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 121 place count 131 transition count 260
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 122 place count 130 transition count 259
Iterating global reduction 5 with 1 rules applied. Total rules applied 123 place count 130 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 124 place count 130 transition count 258
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 127 place count 130 transition count 258
Applied a total of 127 rules in 196 ms. Remains 130 /199 variables (removed 69) and now considering 258/289 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 130/199 places, 258/289 transitions.
RANDOM walk for 40000 steps (2894 resets) in 857 ms. (46 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (85 resets) in 25 ms. (153 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (83 resets) in 30 ms. (129 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (79 resets) in 29 ms. (133 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (83 resets) in 23 ms. (166 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (79 resets) in 24 ms. (160 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (84 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (83 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (81 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (84 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (81 resets) in 21 ms. (182 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (89 resets) in 34 ms. (114 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (80 resets) in 30 ms. (129 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (83 resets) in 29 ms. (133 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (80 resets) in 41 ms. (95 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (82 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (82 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (83 resets) in 27 ms. (142 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (78 resets) in 25 ms. (154 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (77 resets) in 23 ms. (166 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (84 resets) in 22 ms. (173 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (81 resets) in 29 ms. (133 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (82 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (85 resets) in 34 ms. (114 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (73 resets) in 23 ms. (166 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (83 resets) in 25 ms. (153 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (84 resets) in 21 ms. (181 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (88 resets) in 21 ms. (181 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (80 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (85 resets) in 29 ms. (133 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (85 resets) in 21 ms. (181 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (83 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (84 resets) in 22 ms. (174 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (82 resets) in 22 ms. (174 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (86 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (82 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (80 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (83 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (81 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (84 resets) in 27 ms. (142 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (79 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (84 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (88 resets) in 27 ms. (143 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (83 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
Probably explored full state space saw : 193307 states, properties seen :42
Probabilistic random walk after 930185 steps, saw 193307 distinct states, run finished after 2749 ms. (steps per millisecond=338 ) properties seen :42
Explored full state space saw : 193307 states, properties seen :0
Exhaustive walk after 930185 steps, saw 193307 distinct states, run finished after 1593 ms. (steps per millisecond=583 ) properties seen :0
Successfully simplified 13 atomic propositions for a total of 16 simplifications.
FORMULA FireWire-PT-15-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-26 21:22:07] [INFO ] Flatten gal took : 23 ms
[2026-05-26 21:22:07] [INFO ] Flatten gal took : 41 ms
[2026-05-26 21:22:07] [INFO ] Input system was already deterministic with 289 transitions.
Support contains 75 out of 199 places (down from 80) after GAL structural reductions.
Computed a total of 51 stabilizing places and 61 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 289/289 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 172 transition count 243
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 172 transition count 243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 172 transition count 242
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 62 place count 165 transition count 225
Iterating global reduction 1 with 7 rules applied. Total rules applied 69 place count 165 transition count 225
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 72 place count 162 transition count 221
Iterating global reduction 1 with 3 rules applied. Total rules applied 75 place count 162 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 162 transition count 220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 161 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 161 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 160 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 160 transition count 218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 159 transition count 217
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 159 transition count 217
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 158 transition count 216
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 158 transition count 216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 157 transition count 215
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 157 transition count 215
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 156 transition count 214
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 156 transition count 214
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 155 transition count 213
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 155 transition count 213
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 154 transition count 212
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 154 transition count 212
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 153 transition count 211
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 153 transition count 211
Applied a total of 94 rules in 61 ms. Remains 153 /199 variables (removed 46) and now considering 211/289 (removed 78) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12510046054358611142.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4834570121371772909.kers'
[2026-05-26 21:22:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12510046054358611142.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4834570121371772909.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 211 rows 153 cols 598 entries
Finished phase 1 with 149 SingleSign rule and 0 generalized
[2026-05-26 21:22:07] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4834570121371772909.kers
Total runtime 1 ms.
[2026-05-26 21:22:07] [INFO ] Implicit Places using invariants in 147 ms returned []
[2026-05-26 21:22:07] [INFO ] Invariant cache hit.
[2026-05-26 21:22:08] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2026-05-26 21:22:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Problem TDEAD125 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 6/18 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 4/22 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 6 (OVERLAPS) 211/364 variables, 153/175 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 8 (OVERLAPS) 0/364 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 175 constraints, problems are : Problem set: 1 solved, 209 unsolved in 24601 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 18/22 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/23 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 4/27 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 1/28 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 7 (OVERLAPS) 211/364 variables, 153/181 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 209/390 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 3/393 constraints. Problems are: Problem set: 1 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/364 variables, and 393 constraints, problems are : Problem set: 1 solved, 209 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 209/210 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54644ms problems are : Problem set: 1 solved, 209 unsolved
Search for dead transitions found 1 dead transitions in 54645ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 153/199 places, 210/289 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 152 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 152 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 151 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 151 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 150 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 150 transition count 207
Applied a total of 6 rules in 15 ms. Remains 150 /153 variables (removed 3) and now considering 207/210 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5362388673932770272.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3630272643243648618.kers'
[2026-05-26 21:23:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5362388673932770272.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3630272643243648618.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 207 rows 150 cols 584 entries
Finished phase 1 with 146 SingleSign rule and 0 generalized
[2026-05-26 21:23:02] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3630272643243648618.kers
Total runtime 2 ms.
[2026-05-26 21:23:03] [INFO ] Implicit Places using invariants in 227 ms returned []
[2026-05-26 21:23:03] [INFO ] Invariant cache hit.
[2026-05-26 21:23:03] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 150/199 places, 207/289 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55622 ms. Remains : 150/199 places, 207/289 transitions.
[2026-05-26 21:23:03] [INFO ] Flatten gal took : 24 ms
[2026-05-26 21:23:03] [INFO ] Flatten gal took : 20 ms
[2026-05-26 21:23:03] [INFO ] Input system was already deterministic with 207 transitions.
[2026-05-26 21:23:03] [INFO ] Flatten gal took : 17 ms
[2026-05-26 21:23:03] [INFO ] Flatten gal took : 17 ms
[2026-05-26 21:23:03] [INFO ] Time to serialize gal into /tmp/CTLFireability8597753830045107364.gal : 9 ms
[2026-05-26 21:23:03] [INFO ] Time to serialize properties into /tmp/CTLFireability7087869484131650997.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/CTLFireability8597753830045107364.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7087869484131650997.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,477446,1.58595,44316,2,5326,5,125329,6,0,808,183168,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,1.59537,44344,1,0,6,125329,7,1,1050,183168,1
FORMULA FireWire-PT-15-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 289/289 transitions.
Graph (trivial) has 138 edges and 199 vertex of which 12 / 199 are part of one of the 3 SCC in 1 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 189 transition count 256
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 47 place count 167 transition count 254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 166 transition count 254
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 48 place count 166 transition count 247
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 62 place count 159 transition count 247
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 81 place count 140 transition count 209
Iterating global reduction 3 with 19 rules applied. Total rules applied 100 place count 140 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 102 place count 140 transition count 207
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 102 place count 140 transition count 201
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 114 place count 134 transition count 201
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 120 place count 128 transition count 185
Iterating global reduction 4 with 6 rules applied. Total rules applied 126 place count 128 transition count 185
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 128 place count 126 transition count 183
Iterating global reduction 4 with 2 rules applied. Total rules applied 130 place count 126 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 132 place count 126 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 133 place count 125 transition count 181
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 134 place count 124 transition count 180
Iterating global reduction 6 with 1 rules applied. Total rules applied 135 place count 124 transition count 180
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 136 place count 123 transition count 179
Iterating global reduction 6 with 1 rules applied. Total rules applied 137 place count 123 transition count 179
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 138 place count 122 transition count 178
Iterating global reduction 6 with 1 rules applied. Total rules applied 139 place count 122 transition count 178
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 155 place count 114 transition count 170
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 156 place count 113 transition count 169
Applied a total of 156 rules in 60 ms. Remains 113 /199 variables (removed 86) and now considering 169/289 (removed 120) transitions.
[2026-05-26 21:23:05] [INFO ] Flow matrix only has 166 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16005019335013091913.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-20369170366510050.kers'
[2026-05-26 21:23:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16005019335013091913.kers, --Pflows, --basisKERS=/tmp/petrispot-output-20369170366510050.kers]
Normalized transition count is 165 out of 166 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 165 rows 113 cols 513 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-26 21:23:05] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-20369170366510050.kers
Total runtime 1 ms.
[2026-05-26 21:23:05] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-26 21:23:05] [INFO ] Flow matrix only has 166 transitions (discarded 3 similar events)
[2026-05-26 21:23:05] [INFO ] Invariant cache hit.
[2026-05-26 21:23:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-26 21:23:05] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2026-05-26 21:23:05] [INFO ] Redundant transitions in 9 ms returned []
Running 167 sub problems to find dead transitions.
[2026-05-26 21:23:05] [INFO ] Flow matrix only has 166 transitions (discarded 3 similar events)
[2026-05-26 21:23:05] [INFO ] Invariant cache hit.
[2026-05-26 21:23:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Problem TDEAD59 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 10/14 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 165/278 variables, 113/127 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 1/128 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/128 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 8 (OVERLAPS) 0/278 variables, 0/128 constraints. Problems are: Problem set: 1 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/279 variables, and 128 constraints, problems are : Problem set: 1 solved, 166 unsolved in 14291 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 113/113 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 9/10 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 3/13 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 165/278 variables, 113/128 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 1/129 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 166/295 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 0/295 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 11 (OVERLAPS) 0/278 variables, 0/295 constraints. Problems are: Problem set: 1 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 278/279 variables, and 295 constraints, problems are : Problem set: 1 solved, 166 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 113/113 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 166/167 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44335ms problems are : Problem set: 1 solved, 166 unsolved
Search for dead transitions found 1 dead transitions in 44337ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 113/199 places, 168/289 transitions.
Applied a total of 0 rules in 7 ms. Remains 113 /113 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2026-05-26 21:23:49] [INFO ] Redundant transitions in 6 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 44779 ms. Remains : 113/199 places, 168/289 transitions.
[2026-05-26 21:23:49] [INFO ] Flatten gal took : 9 ms
[2026-05-26 21:23:49] [INFO ] Flatten gal took : 10 ms
[2026-05-26 21:23:49] [INFO ] Input system was already deterministic with 168 transitions.
[2026-05-26 21:23:50] [INFO ] Flatten gal took : 10 ms
[2026-05-26 21:23:50] [INFO ] Flatten gal took : 9 ms
[2026-05-26 21:23:50] [INFO ] Time to serialize gal into /tmp/CTLFireability5320880723376050994.gal : 4 ms
[2026-05-26 21:23:50] [INFO ] Time to serialize properties into /tmp/CTLFireability9709764540444719024.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/CTLFireability5320880723376050994.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9709764540444719024.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,92789,0.411877,13096,2,1868,5,28102,6,0,618,35112,0


Converting to forward existential form...Done !
original formula: EF((E(AG(EF((p111==1))) U AG((E(((p37==1)&&(p223==1)) U ((p51==1)&&(p139==1))) + (p202!=1)))) * E((p217==1) U (p15==1))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * E(!(E(TRUE U !(E(TRUE U (p111==1))))) U !(E(TRUE U !((E(((p37==1)&&(p223==1)) U ((p51=...222
Reverse transition relation is NOT exact ! Due to transitions t33, t37, t42, t44, t45, t49, t57, t93, t94, t99, t105, t110, t120, t140, t145, t153, t154, t...284
Hit Full ! (commute/partial/dont) 165/0/3
(forward)formula 0,1,2.36782,64880,1,0,367,379092,371,189,4371,238431,448
FORMULA FireWire-PT-15-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 289/289 transitions.
Graph (trivial) has 145 edges and 199 vertex of which 12 / 199 are part of one of the 3 SCC in 1 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 189 transition count 256
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 47 place count 167 transition count 254
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 50 place count 166 transition count 252
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 164 transition count 252
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 52 place count 164 transition count 246
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 64 place count 158 transition count 246
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 81 place count 141 transition count 210
Iterating global reduction 4 with 17 rules applied. Total rules applied 98 place count 141 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 100 place count 141 transition count 208
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 100 place count 141 transition count 203
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 110 place count 136 transition count 203
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 116 place count 130 transition count 187
Iterating global reduction 5 with 6 rules applied. Total rules applied 122 place count 130 transition count 187
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 123 place count 130 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 124 place count 129 transition count 186
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 127 place count 126 transition count 182
Iterating global reduction 7 with 3 rules applied. Total rules applied 130 place count 126 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 132 place count 126 transition count 180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 133 place count 125 transition count 180
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 134 place count 124 transition count 179
Iterating global reduction 9 with 1 rules applied. Total rules applied 135 place count 124 transition count 179
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 136 place count 123 transition count 178
Iterating global reduction 9 with 1 rules applied. Total rules applied 137 place count 123 transition count 178
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 138 place count 122 transition count 177
Iterating global reduction 9 with 1 rules applied. Total rules applied 139 place count 122 transition count 177
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 140 place count 121 transition count 176
Iterating global reduction 9 with 1 rules applied. Total rules applied 141 place count 121 transition count 176
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 142 place count 120 transition count 175
Iterating global reduction 9 with 1 rules applied. Total rules applied 143 place count 120 transition count 175
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 144 place count 119 transition count 174
Iterating global reduction 9 with 1 rules applied. Total rules applied 145 place count 119 transition count 174
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 146 place count 118 transition count 173
Iterating global reduction 9 with 1 rules applied. Total rules applied 147 place count 118 transition count 173
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 148 place count 117 transition count 172
Iterating global reduction 9 with 1 rules applied. Total rules applied 149 place count 117 transition count 172
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 150 place count 116 transition count 171
Iterating global reduction 9 with 1 rules applied. Total rules applied 151 place count 116 transition count 171
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 20 rules applied. Total rules applied 171 place count 106 transition count 161
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 173 place count 104 transition count 159
Applied a total of 173 rules in 59 ms. Remains 104 /199 variables (removed 95) and now considering 159/289 (removed 130) transitions.
[2026-05-26 21:23:52] [INFO ] Flow matrix only has 156 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18327324469247887053.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6396164005667738910.kers'
[2026-05-26 21:23:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18327324469247887053.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6396164005667738910.kers]
Normalized transition count is 155 out of 156 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 155 rows 104 cols 478 entries
Finished phase 1 with 100 SingleSign rule and 0 generalized
[2026-05-26 21:23:52] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6396164005667738910.kers
Total runtime 1 ms.
[2026-05-26 21:23:52] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-26 21:23:52] [INFO ] Flow matrix only has 156 transitions (discarded 3 similar events)
[2026-05-26 21:23:52] [INFO ] Invariant cache hit.
[2026-05-26 21:23:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-26 21:23:52] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2026-05-26 21:23:52] [INFO ] Redundant transitions in 9 ms returned []
Running 154 sub problems to find dead transitions.
[2026-05-26 21:23:52] [INFO ] Flow matrix only has 156 transitions (discarded 3 similar events)
[2026-05-26 21:23:52] [INFO ] Invariant cache hit.
[2026-05-26 21:23:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Problem TDEAD56 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 9/13 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 155/258 variables, 103/117 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 1/118 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/118 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 1/259 variables, 1/119 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 1/120 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 10 (OVERLAPS) 0/259 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/260 variables, and 120 constraints, problems are : Problem set: 1 solved, 153 unsolved in 17289 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 11/15 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 155/258 variables, 103/118 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 1/119 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 153/272 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/272 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 1/259 variables, 1/273 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/273 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 9 (OVERLAPS) 0/259 variables, 0/273 constraints. Problems are: Problem set: 1 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/260 variables, and 273 constraints, problems are : Problem set: 1 solved, 153 unsolved in 24749 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 153/154 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42077ms problems are : Problem set: 1 solved, 153 unsolved
Search for dead transitions found 1 dead transitions in 42078ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 104/199 places, 158/289 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 102 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 102 transition count 156
Applied a total of 4 rules in 11 ms. Remains 102 /104 variables (removed 2) and now considering 156/158 (removed 2) transitions.
[2026-05-26 21:24:34] [INFO ] Flow matrix only has 153 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1291575732823782718.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11114315733752521505.kers'
[2026-05-26 21:24:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1291575732823782718.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11114315733752521505.kers]
Normalized transition count is 152 out of 153 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 152 rows 102 cols 466 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-26 21:24:34] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11114315733752521505.kers
Total runtime 1 ms.
[2026-05-26 21:24:35] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-26 21:24:35] [INFO ] Flow matrix only has 153 transitions (discarded 3 similar events)
[2026-05-26 21:24:35] [INFO ] Invariant cache hit.
[2026-05-26 21:24:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-26 21:24:35] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 102/199 places, 156/289 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 42884 ms. Remains : 102/199 places, 156/289 transitions.
[2026-05-26 21:24:35] [INFO ] Flatten gal took : 13 ms
[2026-05-26 21:24:35] [INFO ] Flatten gal took : 12 ms
[2026-05-26 21:24:35] [INFO ] Input system was already deterministic with 156 transitions.
[2026-05-26 21:24:35] [INFO ] Flatten gal took : 12 ms
[2026-05-26 21:24:35] [INFO ] Flatten gal took : 12 ms
[2026-05-26 21:24:35] [INFO ] Time to serialize gal into /tmp/CTLFireability10196961482858186708.gal : 4 ms
[2026-05-26 21:24:35] [INFO ] Time to serialize properties into /tmp/CTLFireability15031260913983443292.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/CTLFireability10196961482858186708.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15031260913983443292.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,82866,0.46158,13792,2,1821,5,33049,6,0,562,38408,0


Converting to forward existential form...Done !
original formula: EF(AG((!(E(((p5==1)&&(p241==1)) U (p54==1))) + EF((p189==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(E(((p5==1)&&(p241==1)) U (p54==1))) + E(TRUE U (p189==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t30, t38, t40, t43, t52, t87, t88, t91, t97, t101, t103, t107, t113, t114, t135, t142, t143, ...279
(forward)formula 0,1,1.22157,29280,1,0,281,131176,335,137,3917,92498,328
FORMULA FireWire-PT-15-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 289/289 transitions.
Graph (trivial) has 133 edges and 199 vertex of which 12 / 199 are part of one of the 3 SCC in 0 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 189 transition count 258
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 169 transition count 256
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 168 transition count 255
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 46 place count 167 transition count 255
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 46 place count 167 transition count 250
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 56 place count 162 transition count 250
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 74 place count 144 transition count 222
Iterating global reduction 4 with 18 rules applied. Total rules applied 92 place count 144 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 93 place count 144 transition count 221
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 93 place count 144 transition count 215
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 105 place count 138 transition count 215
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 111 place count 132 transition count 199
Iterating global reduction 5 with 6 rules applied. Total rules applied 117 place count 132 transition count 199
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 118 place count 132 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 119 place count 131 transition count 198
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 121 place count 129 transition count 195
Iterating global reduction 7 with 2 rules applied. Total rules applied 123 place count 129 transition count 195
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 124 place count 128 transition count 194
Iterating global reduction 7 with 1 rules applied. Total rules applied 125 place count 128 transition count 194
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 126 place count 127 transition count 193
Iterating global reduction 7 with 1 rules applied. Total rules applied 127 place count 127 transition count 193
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 128 place count 126 transition count 192
Iterating global reduction 7 with 1 rules applied. Total rules applied 129 place count 126 transition count 192
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 130 place count 125 transition count 191
Iterating global reduction 7 with 1 rules applied. Total rules applied 131 place count 125 transition count 191
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 132 place count 124 transition count 190
Iterating global reduction 7 with 1 rules applied. Total rules applied 133 place count 124 transition count 190
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 143 place count 119 transition count 185
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 144 place count 119 transition count 185
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 146 place count 117 transition count 183
Applied a total of 146 rules in 53 ms. Remains 117 /199 variables (removed 82) and now considering 183/289 (removed 106) transitions.
[2026-05-26 21:24:36] [INFO ] Flow matrix only has 180 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9423739531029098912.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-618693457347817378.kers'
[2026-05-26 21:24:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9423739531029098912.kers, --Pflows, --basisKERS=/tmp/petrispot-output-618693457347817378.kers]
Normalized transition count is 179 out of 180 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 179 rows 117 cols 558 entries
Finished phase 1 with 113 SingleSign rule and 0 generalized
[2026-05-26 21:24:36] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-618693457347817378.kers
Total runtime 1 ms.
[2026-05-26 21:24:36] [INFO ] Implicit Places using invariants in 163 ms returned []
[2026-05-26 21:24:36] [INFO ] Flow matrix only has 180 transitions (discarded 3 similar events)
[2026-05-26 21:24:36] [INFO ] Invariant cache hit.
[2026-05-26 21:24:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-26 21:24:37] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2026-05-26 21:24:37] [INFO ] Redundant transitions in 4 ms returned []
Running 179 sub problems to find dead transitions.
[2026-05-26 21:24:37] [INFO ] Flow matrix only has 180 transitions (discarded 3 similar events)
[2026-05-26 21:24:37] [INFO ] Invariant cache hit.
[2026-05-26 21:24:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Problem TDEAD63 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 1/117 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 4/15 constraints. Problems are: Problem set: 1 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 179/296 variables, 117/132 constraints. Problems are: Problem set: 1 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 1/133 constraints. Problems are: Problem set: 1 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 178 unsolved
At refinement iteration 10 (OVERLAPS) 0/296 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 296/297 variables, and 133 constraints, problems are : Problem set: 1 solved, 178 unsolved in 19490 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 117/117 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 11/13 constraints. Problems are: Problem set: 1 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 1/117 variables, 2/16 constraints. Problems are: Problem set: 1 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 178 unsolved
At refinement iteration 6 (OVERLAPS) 179/296 variables, 117/133 constraints. Problems are: Problem set: 1 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 1/134 constraints. Problems are: Problem set: 1 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 178/312 constraints. Problems are: Problem set: 1 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 1/313 constraints. Problems are: Problem set: 1 solved, 178 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/313 constraints. Problems are: Problem set: 1 solved, 178 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/297 variables, and 313 constraints, problems are : Problem set: 1 solved, 178 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 117/117 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 178/179 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49534ms problems are : Problem set: 1 solved, 178 unsolved
Search for dead transitions found 1 dead transitions in 49535ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 117/199 places, 182/289 transitions.
Applied a total of 0 rules in 6 ms. Remains 117 /117 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2026-05-26 21:25:26] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 50077 ms. Remains : 117/199 places, 182/289 transitions.
[2026-05-26 21:25:26] [INFO ] Flatten gal took : 12 ms
[2026-05-26 21:25:26] [INFO ] Flatten gal took : 11 ms
[2026-05-26 21:25:26] [INFO ] Input system was already deterministic with 182 transitions.
[2026-05-26 21:25:26] [INFO ] Flatten gal took : 10 ms
[2026-05-26 21:25:26] [INFO ] Flatten gal took : 9 ms
[2026-05-26 21:25:26] [INFO ] Time to serialize gal into /tmp/CTLFireability10632159342337756738.gal : 3 ms
[2026-05-26 21:25:26] [INFO ] Time to serialize properties into /tmp/CTLFireability4779150418606743338.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/CTLFireability10632159342337756738.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4779150418606743338.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,124854,0.387382,14324,2,2146,5,32066,6,0,648,40949,0


Converting to forward existential form...Done !
original formula: EF(((EG((AG((p85==0)) * !(E((p240==1) U (p177==1))))) * (p112==1)) * (((p161==1) + (!(E(((p51==1)&&(p141==1)) U (p172==1))) * EG(((p46==0...211
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * (EG((!(E(TRUE U !((p85==0)))) * !(E((p240==1) U (p177==1))))) * (p112==1))) * (p161==1))]...493
Reverse transition relation is NOT exact ! Due to transitions t35, t40, t47, t49, t50, t55, t60, t98, t99, t103, t108, t112, t118, t130, t158, t165, t170, ...285
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 167/0/15
(forward)formula 0,1,6.79162,189428,1,0,525,1.23313e+06,411,301,4951,982113,584
FORMULA FireWire-PT-15-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 289/289 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 182 transition count 263
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 182 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 182 transition count 262
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 179 transition count 250
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 179 transition count 250
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 178 transition count 249
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 178 transition count 249
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 178 transition count 248
Applied a total of 44 rules in 7 ms. Remains 178 /199 variables (removed 21) and now considering 248/289 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1923726541123943809.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1781524917001312798.kers'
[2026-05-26 21:25:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1923726541123943809.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1781524917001312798.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 178 cols 720 entries
Finished phase 1 with 174 SingleSign rule and 0 generalized
[2026-05-26 21:25:33] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1781524917001312798.kers
Total runtime 2 ms.
[2026-05-26 21:25:33] [INFO ] Implicit Places using invariants in 155 ms returned []
[2026-05-26 21:25:33] [INFO ] Invariant cache hit.
[2026-05-26 21:25:34] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2026-05-26 21:25:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Problem TDEAD138 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 14/18 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 3/21 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 5/26 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 1/27 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 3/30 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 8 (OVERLAPS) 248/426 variables, 178/208 constraints. Problems are: Problem set: 1 solved, 246 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/426 variables, and 209 constraints, problems are : Problem set: 1 solved, 246 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 246 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 27/31 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 1/32 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 1/33 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 6 (OVERLAPS) 248/426 variables, 178/211 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 246/457 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 2/459 constraints. Problems are: Problem set: 1 solved, 246 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 459 constraints, problems are : Problem set: 1 solved, 246 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 246/247 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60057ms problems are : Problem set: 1 solved, 246 unsolved
Search for dead transitions found 1 dead transitions in 60059ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 178/199 places, 247/289 transitions.
Applied a total of 0 rules in 3 ms. Remains 178 /178 variables (removed 0) and now considering 247/247 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60478 ms. Remains : 178/199 places, 247/289 transitions.
[2026-05-26 21:26:34] [INFO ] Flatten gal took : 18 ms
[2026-05-26 21:26:34] [INFO ] Flatten gal took : 16 ms
[2026-05-26 21:26:34] [INFO ] Input system was already deterministic with 247 transitions.
[2026-05-26 21:26:34] [INFO ] Flatten gal took : 16 ms
[2026-05-26 21:26:34] [INFO ] Flatten gal took : 16 ms
[2026-05-26 21:26:34] [INFO ] Time to serialize gal into /tmp/CTLFireability1191255953552730389.gal : 4 ms
[2026-05-26 21:26:34] [INFO ] Time to serialize properties into /tmp/CTLFireability2965278016321098970.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/CTLFireability1191255953552730389.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2965278016321098970.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,700087,3.38061,73368,2,6606,5,212926,6,0,960,278991,0


Converting to forward existential form...Done !
original formula: (A(A(((AG((p94==1)) + AG(((p43==1)&&(p212==1)))) * !(AG((p227==1)))) U E(((p15==1)&&(p213==1)) U ((p244==1)||(p21==1)))) U EF(EX(EG(((p55...299
=> equivalent forward existential formula: ([((Init * !(EG(!(E(TRUE U EX(EG(((p55==1)&&(p241==1))))))))) * !(E(!(E(TRUE U EX(EG(((p55==1)&&(p241==1)))))) U...694
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t17, t27, t31, t51, t58, t62, t66, t69, t70, t74, t78, t82, t83, t91, t95, t96, t111,...346
Detected timeout of ITS tools.
[2026-05-26 21:27:04] [INFO ] Flatten gal took : 11 ms
[2026-05-26 21:27:04] [INFO ] Applying decomposition
[2026-05-26 21:27:04] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph18433877720291366167.txt' '-o' '/tmp/graph18433877720291366167.bin' '-w' '/tmp/graph18433877720291366167.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18433877720291366167.bin' '-l' '-1' '-v' '-w' '/tmp/graph18433877720291366167.weights' '-q' '0' '-e' '0.001'
[2026-05-26 21:27:04] [INFO ] Decomposing Gal with order
[2026-05-26 21:27:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 21:27:04] [INFO ] Removed a total of 155 redundant transitions.
[2026-05-26 21:27:04] [INFO ] Flatten gal took : 101 ms
[2026-05-26 21:27:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 21 ms.
[2026-05-26 21:27:04] [INFO ] Time to serialize gal into /tmp/CTLFireability7400234158401975430.gal : 11 ms
[2026-05-26 21:27:04] [INFO ] Time to serialize properties into /tmp/CTLFireability9720553983050511241.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/CTLFireability7400234158401975430.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9720553983050511241.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,700087,0.708675,18760,466,298,19272,15372,592,31045,219,56600,0


Converting to forward existential form...Done !
original formula: (A(A(((AG((i1.u16.p94==1)) + AG(((i6.u7.p43==1)&&(i5.u40.p212==1)))) * !(AG((i8.i0.u44.p227==1)))) U E(((i0.u3.p15==1)&&(i5.u40.p213==1))...432
=> equivalent forward existential formula: ([((Init * !(EG(!(E(TRUE U EX(EG(((i9.u8.p55==1)&&(i9.u46.p241==1))))))))) * !(E(!(E(TRUE U EX(EG(((i9.u8.p55==1...919
Reverse transition relation is NOT exact ! Due to transitions t66, t111, t117, t128, t205, t230, t231, t232, t237, t239, i1.t234, i1.u14.t83, i1.u16.t82, i...495
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found 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
(forward)formula 0,0,3.88763,104548,1,0,178000,15372,3647,366313,1382,56600,334126
FORMULA FireWire-PT-15-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 289/289 transitions.
Graph (trivial) has 146 edges and 199 vertex of which 12 / 199 are part of one of the 3 SCC in 1 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 189 transition count 254
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 165 transition count 252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 164 transition count 252
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 52 place count 164 transition count 245
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 66 place count 157 transition count 245
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 84 place count 139 transition count 208
Iterating global reduction 3 with 18 rules applied. Total rules applied 102 place count 139 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 104 place count 139 transition count 206
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 104 place count 139 transition count 201
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 114 place count 134 transition count 201
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 120 place count 128 transition count 185
Iterating global reduction 4 with 6 rules applied. Total rules applied 126 place count 128 transition count 185
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 127 place count 128 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 128 place count 127 transition count 184
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 131 place count 124 transition count 180
Iterating global reduction 6 with 3 rules applied. Total rules applied 134 place count 124 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 136 place count 124 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 137 place count 123 transition count 178
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 138 place count 122 transition count 177
Iterating global reduction 8 with 1 rules applied. Total rules applied 139 place count 122 transition count 177
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 140 place count 121 transition count 176
Iterating global reduction 8 with 1 rules applied. Total rules applied 141 place count 121 transition count 176
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 142 place count 120 transition count 175
Iterating global reduction 8 with 1 rules applied. Total rules applied 143 place count 120 transition count 175
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 144 place count 119 transition count 174
Iterating global reduction 8 with 1 rules applied. Total rules applied 145 place count 119 transition count 174
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 146 place count 118 transition count 173
Iterating global reduction 8 with 1 rules applied. Total rules applied 147 place count 118 transition count 173
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 148 place count 117 transition count 172
Iterating global reduction 8 with 1 rules applied. Total rules applied 149 place count 117 transition count 172
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 150 place count 116 transition count 171
Iterating global reduction 8 with 1 rules applied. Total rules applied 151 place count 116 transition count 171
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 152 place count 115 transition count 170
Iterating global reduction 8 with 1 rules applied. Total rules applied 153 place count 115 transition count 170
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 154 place count 114 transition count 169
Iterating global reduction 8 with 1 rules applied. Total rules applied 155 place count 114 transition count 169
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 171 place count 106 transition count 161
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 173 place count 104 transition count 159
Applied a total of 173 rules in 49 ms. Remains 104 /199 variables (removed 95) and now considering 159/289 (removed 130) transitions.
[2026-05-26 21:27:08] [INFO ] Flow matrix only has 156 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8902353561720536515.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-841930703910764150.kers'
[2026-05-26 21:27:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8902353561720536515.kers, --Pflows, --basisKERS=/tmp/petrispot-output-841930703910764150.kers]
Normalized transition count is 155 out of 156 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 155 rows 104 cols 478 entries
Finished phase 1 with 100 SingleSign rule and 0 generalized
[2026-05-26 21:27:08] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-841930703910764150.kers
Total runtime 2 ms.
[2026-05-26 21:27:08] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-26 21:27:08] [INFO ] Flow matrix only has 156 transitions (discarded 3 similar events)
[2026-05-26 21:27:08] [INFO ] Invariant cache hit.
[2026-05-26 21:27:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-26 21:27:09] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2026-05-26 21:27:09] [INFO ] Redundant transitions in 1 ms returned []
Running 154 sub problems to find dead transitions.
[2026-05-26 21:27:09] [INFO ] Flow matrix only has 156 transitions (discarded 3 similar events)
[2026-05-26 21:27:09] [INFO ] Invariant cache hit.
[2026-05-26 21:27:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Problem TDEAD55 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 155/258 variables, 103/116 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 1/117 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 1/259 variables, 1/118 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/118 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 9 (OVERLAPS) 0/259 variables, 0/118 constraints. Problems are: Problem set: 1 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/260 variables, and 118 constraints, problems are : Problem set: 1 solved, 153 unsolved in 16529 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 9/13 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 155/258 variables, 103/117 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 1/118 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 153/271 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/271 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 8 (OVERLAPS) 1/259 variables, 1/272 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 0/272 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 10 (OVERLAPS) 0/259 variables, 0/272 constraints. Problems are: Problem set: 1 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/260 variables, and 272 constraints, problems are : Problem set: 1 solved, 153 unsolved in 24216 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 153/154 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40760ms problems are : Problem set: 1 solved, 153 unsolved
Search for dead transitions found 1 dead transitions in 40760ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 104/199 places, 158/289 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 102 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 102 transition count 156
Applied a total of 4 rules in 7 ms. Remains 102 /104 variables (removed 2) and now considering 156/158 (removed 2) transitions.
[2026-05-26 21:27:49] [INFO ] Flow matrix only has 153 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2415633222483536325.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2844379466810925386.kers'
[2026-05-26 21:27:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2415633222483536325.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2844379466810925386.kers]
Normalized transition count is 152 out of 153 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 152 rows 102 cols 466 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-26 21:27:49] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2844379466810925386.kers
Total runtime 1 ms.
[2026-05-26 21:27:49] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-26 21:27:49] [INFO ] Flow matrix only has 153 transitions (discarded 3 similar events)
[2026-05-26 21:27:49] [INFO ] Invariant cache hit.
[2026-05-26 21:27:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-26 21:27:50] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 102/199 places, 156/289 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 41459 ms. Remains : 102/199 places, 156/289 transitions.
[2026-05-26 21:27:50] [INFO ] Flatten gal took : 10 ms
[2026-05-26 21:27:50] [INFO ] Flatten gal took : 6 ms
[2026-05-26 21:27:50] [INFO ] Input system was already deterministic with 156 transitions.
[2026-05-26 21:27:50] [INFO ] Flatten gal took : 6 ms
[2026-05-26 21:27:50] [INFO ] Flatten gal took : 6 ms
[2026-05-26 21:27:50] [INFO ] Time to serialize gal into /tmp/CTLFireability16336607302419048214.gal : 2 ms
[2026-05-26 21:27:50] [INFO ] Time to serialize properties into /tmp/CTLFireability17698550741840875718.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/CTLFireability16336607302419048214.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17698550741840875718.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,86338,0.503837,13532,2,1722,5,31639,6,0,562,38072,0


Converting to forward existential form...Done !
original formula: EF((EG((p177==0)) * EG(((p52==1)&&(p162==1)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * EG((p177==0))),((p52==1)&&(p162==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t32, t36, t41, t43, t48, t53, t88, t89, t96, t101, t107, t112, t116, t138, t145, t146, t150, ...273
Hit Full ! (commute/partial/dont) 140/15/16
(forward)formula 0,0,5.62109,129072,1,0,444,801236,339,217,4019,658629,516
FORMULA FireWire-PT-15-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 289/289 transitions.
Graph (trivial) has 145 edges and 199 vertex of which 12 / 199 are part of one of the 3 SCC in 0 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 189 transition count 256
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 47 place count 167 transition count 254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 166 transition count 254
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 48 place count 166 transition count 247
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 62 place count 159 transition count 247
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 78 place count 143 transition count 221
Iterating global reduction 3 with 16 rules applied. Total rules applied 94 place count 143 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 143 transition count 220
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 95 place count 143 transition count 215
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 105 place count 138 transition count 215
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 110 place count 133 transition count 200
Iterating global reduction 4 with 5 rules applied. Total rules applied 115 place count 133 transition count 200
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 116 place count 133 transition count 199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 117 place count 132 transition count 199
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 119 place count 130 transition count 196
Iterating global reduction 6 with 2 rules applied. Total rules applied 121 place count 130 transition count 196
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 122 place count 129 transition count 195
Iterating global reduction 6 with 1 rules applied. Total rules applied 123 place count 129 transition count 195
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 124 place count 128 transition count 194
Iterating global reduction 6 with 1 rules applied. Total rules applied 125 place count 128 transition count 194
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 126 place count 127 transition count 193
Iterating global reduction 6 with 1 rules applied. Total rules applied 127 place count 127 transition count 193
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 128 place count 126 transition count 192
Iterating global reduction 6 with 1 rules applied. Total rules applied 129 place count 126 transition count 192
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 130 place count 125 transition count 191
Iterating global reduction 6 with 1 rules applied. Total rules applied 131 place count 125 transition count 191
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 132 place count 124 transition count 190
Iterating global reduction 6 with 1 rules applied. Total rules applied 133 place count 124 transition count 190
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 134 place count 123 transition count 189
Iterating global reduction 6 with 1 rules applied. Total rules applied 135 place count 123 transition count 189
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 136 place count 122 transition count 188
Iterating global reduction 6 with 1 rules applied. Total rules applied 137 place count 122 transition count 188
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 138 place count 121 transition count 187
Iterating global reduction 6 with 1 rules applied. Total rules applied 139 place count 121 transition count 187
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 159 place count 111 transition count 177
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 161 place count 109 transition count 175
Applied a total of 161 rules in 70 ms. Remains 109 /199 variables (removed 90) and now considering 175/289 (removed 114) transitions.
[2026-05-26 21:27:55] [INFO ] Flow matrix only has 172 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6154702535447116568.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10219325102646754299.kers'
[2026-05-26 21:27:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6154702535447116568.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10219325102646754299.kers]
Normalized transition count is 171 out of 172 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 171 rows 109 cols 534 entries
Finished phase 1 with 105 SingleSign rule and 0 generalized
[2026-05-26 21:27:55] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10219325102646754299.kers
Total runtime 3 ms.
[2026-05-26 21:27:55] [INFO ] Implicit Places using invariants in 138 ms returned []
[2026-05-26 21:27:55] [INFO ] Flow matrix only has 172 transitions (discarded 3 similar events)
[2026-05-26 21:27:55] [INFO ] Invariant cache hit.
[2026-05-26 21:27:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-26 21:27:56] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2026-05-26 21:27:56] [INFO ] Redundant transitions in 1 ms returned []
Running 170 sub problems to find dead transitions.
[2026-05-26 21:27:56] [INFO ] Flow matrix only has 172 transitions (discarded 3 similar events)
[2026-05-26 21:27:56] [INFO ] Invariant cache hit.
[2026-05-26 21:27:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Problem TDEAD59 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 169 unsolved
At refinement iteration 3 (OVERLAPS) 171/279 variables, 108/120 constraints. Problems are: Problem set: 1 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 1/121 constraints. Problems are: Problem set: 1 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 169 unsolved
At refinement iteration 6 (OVERLAPS) 1/280 variables, 1/122 constraints. Problems are: Problem set: 1 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/122 constraints. Problems are: Problem set: 1 solved, 169 unsolved
At refinement iteration 8 (OVERLAPS) 0/280 variables, 0/122 constraints. Problems are: Problem set: 1 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/281 variables, and 122 constraints, problems are : Problem set: 1 solved, 169 unsolved in 16656 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 109/109 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 169 unsolved
At refinement iteration 3 (OVERLAPS) 171/279 variables, 108/120 constraints. Problems are: Problem set: 1 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 1/121 constraints. Problems are: Problem set: 1 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 169/290 constraints. Problems are: Problem set: 1 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/290 constraints. Problems are: Problem set: 1 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 1/280 variables, 1/291 constraints. Problems are: Problem set: 1 solved, 169 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/291 constraints. Problems are: Problem set: 1 solved, 169 unsolved
At refinement iteration 9 (OVERLAPS) 0/280 variables, 0/291 constraints. Problems are: Problem set: 1 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/281 variables, and 291 constraints, problems are : Problem set: 1 solved, 169 unsolved in 26427 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 109/109 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 169/170 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43108ms problems are : Problem set: 1 solved, 169 unsolved
Search for dead transitions found 1 dead transitions in 43109ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 109/199 places, 174/289 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 108 transition count 173
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 107 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 107 transition count 172
Applied a total of 4 rules in 7 ms. Remains 107 /109 variables (removed 2) and now considering 172/174 (removed 2) transitions.
[2026-05-26 21:28:39] [INFO ] Flow matrix only has 169 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9560104338795337298.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3996423638202168479.kers'
[2026-05-26 21:28:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9560104338795337298.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3996423638202168479.kers]
Normalized transition count is 168 out of 169 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 168 rows 107 cols 522 entries
Finished phase 1 with 103 SingleSign rule and 0 generalized
[2026-05-26 21:28:39] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3996423638202168479.kers
Total runtime 2 ms.
[2026-05-26 21:28:39] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-26 21:28:39] [INFO ] Flow matrix only has 169 transitions (discarded 3 similar events)
[2026-05-26 21:28:39] [INFO ] Invariant cache hit.
[2026-05-26 21:28:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-26 21:28:39] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 107/199 places, 172/289 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 43939 ms. Remains : 107/199 places, 172/289 transitions.
[2026-05-26 21:28:39] [INFO ] Flatten gal took : 9 ms
[2026-05-26 21:28:39] [INFO ] Flatten gal took : 9 ms
[2026-05-26 21:28:39] [INFO ] Input system was already deterministic with 172 transitions.
[2026-05-26 21:28:39] [INFO ] Flatten gal took : 9 ms
[2026-05-26 21:28:39] [INFO ] Flatten gal took : 9 ms
[2026-05-26 21:28:39] [INFO ] Time to serialize gal into /tmp/CTLFireability366481471486034100.gal : 3 ms
[2026-05-26 21:28:39] [INFO ] Time to serialize properties into /tmp/CTLFireability2102147319029278422.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/CTLFireability366481471486034100.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2102147319029278422.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,97194,0.610198,15116,2,1760,5,35415,6,0,598,48089,0


Converting to forward existential form...Done !
original formula: EF(AG(((AG((p188==0)) + (p163==1)) + ((p46==1)&&(p181==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((!(E(TRUE U !((p188==0)))) + (p163==1)) + ((p46==1)&&(p181==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t24, t35, t39, t44, t46, t52, t57, t90, t91, t99, t104, t109, t113, t118, t148, t155, t156, t...278
(forward)formula 0,1,2.36419,54020,1,0,332,297075,365,172,4145,173549,402
FORMULA FireWire-PT-15-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 : 199/199 places, 289/289 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 174 transition count 245
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 174 transition count 245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 174 transition count 244
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 168 transition count 229
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 168 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 166 transition count 226
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 166 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 166 transition count 225
Applied a total of 68 rules in 7 ms. Remains 166 /199 variables (removed 33) and now considering 225/289 (removed 64) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3186825370425441869.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-678614403021883931.kers'
[2026-05-26 21:28:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3186825370425441869.kers, --Pflows, --basisKERS=/tmp/petrispot-output-678614403021883931.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 225 rows 166 cols 648 entries
Finished phase 1 with 162 SingleSign rule and 0 generalized
[2026-05-26 21:28:42] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-678614403021883931.kers
Total runtime 2 ms.
[2026-05-26 21:28:42] [INFO ] Implicit Places using invariants in 143 ms returned []
[2026-05-26 21:28:42] [INFO ] Invariant cache hit.
[2026-05-26 21:28:42] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2026-05-26 21:28:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Problem TDEAD128 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 14/18 constraints. Problems are: Problem set: 1 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 1/19 constraints. Problems are: Problem set: 1 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 1/20 constraints. Problems are: Problem set: 1 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 225/391 variables, 166/186 constraints. Problems are: Problem set: 1 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 0/391 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 186 constraints, problems are : Problem set: 1 solved, 223 unsolved in 29698 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 16/20 constraints. Problems are: Problem set: 1 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 225/391 variables, 166/186 constraints. Problems are: Problem set: 1 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 223/409 constraints. Problems are: Problem set: 1 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 1/410 constraints. Problems are: Problem set: 1 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/391 variables, and 410 constraints, problems are : Problem set: 1 solved, 223 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 223/224 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 59744ms problems are : Problem set: 1 solved, 223 unsolved
Search for dead transitions found 1 dead transitions in 59746ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 166/199 places, 224/289 transitions.
Applied a total of 0 rules in 2 ms. Remains 166 /166 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60142 ms. Remains : 166/199 places, 224/289 transitions.
[2026-05-26 21:29:42] [INFO ] Flatten gal took : 12 ms
[2026-05-26 21:29:42] [INFO ] Flatten gal took : 11 ms
[2026-05-26 21:29:42] [INFO ] Input system was already deterministic with 224 transitions.
[2026-05-26 21:29:42] [INFO ] Flatten gal took : 10 ms
[2026-05-26 21:29:42] [INFO ] Flatten gal took : 10 ms
[2026-05-26 21:29:42] [INFO ] Time to serialize gal into /tmp/CTLFireability7328057173079232709.gal : 2 ms
[2026-05-26 21:29:42] [INFO ] Time to serialize properties into /tmp/CTLFireability4682917722721426245.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/CTLFireability7328057173079232709.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4682917722721426245.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,487998,1.80078,45188,2,5528,5,130626,6,0,889,171115,0


Converting to forward existential form...Done !
original formula: EF(AX(((p244==1) + !(E(((p105==1)&&(p133==1)) U EF(((p14==1)&&(p206==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((p244==1) + !(E(((p105==1)&&(p133==1)) U E(TRUE U ((p14==1)&&(p206==1))))))))))] != ...160
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t44, t51, t55, t59, t62, t66, t74, t82, t86, t87, t102, t105, t107, t116, t118, t185,...304
(forward)formula 0,1,15.7349,363536,1,0,442,2.47886e+06,474,236,5797,1.1623e+06,542
FORMULA FireWire-PT-15-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 289/289 transitions.
Graph (trivial) has 139 edges and 199 vertex of which 12 / 199 are part of one of the 3 SCC in 0 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 189 transition count 255
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 166 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 165 transition count 253
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 50 place count 165 transition count 246
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 64 place count 158 transition count 246
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 82 place count 140 transition count 218
Iterating global reduction 3 with 18 rules applied. Total rules applied 100 place count 140 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 101 place count 140 transition count 217
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 101 place count 140 transition count 211
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 113 place count 134 transition count 211
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 119 place count 128 transition count 195
Iterating global reduction 4 with 6 rules applied. Total rules applied 125 place count 128 transition count 195
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 126 place count 128 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 127 place count 127 transition count 194
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 130 place count 124 transition count 190
Iterating global reduction 6 with 3 rules applied. Total rules applied 133 place count 124 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 135 place count 124 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 136 place count 123 transition count 188
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 137 place count 122 transition count 187
Iterating global reduction 8 with 1 rules applied. Total rules applied 138 place count 122 transition count 187
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 139 place count 121 transition count 186
Iterating global reduction 8 with 1 rules applied. Total rules applied 140 place count 121 transition count 186
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 141 place count 120 transition count 185
Iterating global reduction 8 with 1 rules applied. Total rules applied 142 place count 120 transition count 185
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 143 place count 119 transition count 184
Iterating global reduction 8 with 1 rules applied. Total rules applied 144 place count 119 transition count 184
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 145 place count 118 transition count 183
Iterating global reduction 8 with 1 rules applied. Total rules applied 146 place count 118 transition count 183
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 147 place count 117 transition count 182
Iterating global reduction 8 with 1 rules applied. Total rules applied 148 place count 117 transition count 182
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 149 place count 116 transition count 181
Iterating global reduction 8 with 1 rules applied. Total rules applied 150 place count 116 transition count 181
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 151 place count 115 transition count 180
Iterating global reduction 8 with 1 rules applied. Total rules applied 152 place count 115 transition count 180
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 153 place count 114 transition count 179
Iterating global reduction 8 with 1 rules applied. Total rules applied 154 place count 114 transition count 179
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 170 place count 106 transition count 171
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 172 place count 104 transition count 169
Applied a total of 172 rules in 33 ms. Remains 104 /199 variables (removed 95) and now considering 169/289 (removed 120) transitions.
[2026-05-26 21:29:58] [INFO ] Flow matrix only has 166 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15868222426811650208.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7078642279649453662.kers'
[2026-05-26 21:29:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15868222426811650208.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7078642279649453662.kers]
Normalized transition count is 165 out of 166 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 165 rows 104 cols 518 entries
Finished phase 1 with 100 SingleSign rule and 0 generalized
[2026-05-26 21:29:58] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7078642279649453662.kers
Total runtime 1 ms.
[2026-05-26 21:29:58] [INFO ] Implicit Places using invariants in 223 ms returned []
[2026-05-26 21:29:58] [INFO ] Flow matrix only has 166 transitions (discarded 3 similar events)
[2026-05-26 21:29:58] [INFO ] Invariant cache hit.
[2026-05-26 21:29:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-26 21:29:58] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2026-05-26 21:29:58] [INFO ] Redundant transitions in 0 ms returned []
Running 164 sub problems to find dead transitions.
[2026-05-26 21:29:58] [INFO ] Flow matrix only has 166 transitions (discarded 3 similar events)
[2026-05-26 21:29:58] [INFO ] Invariant cache hit.
[2026-05-26 21:29:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Problem TDEAD55 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 3/15 constraints. Problems are: Problem set: 1 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/16 constraints. Problems are: Problem set: 1 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 165/268 variables, 103/119 constraints. Problems are: Problem set: 1 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 1/120 constraints. Problems are: Problem set: 1 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 163 unsolved
At refinement iteration 8 (OVERLAPS) 1/269 variables, 1/121 constraints. Problems are: Problem set: 1 solved, 163 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 163 unsolved
At refinement iteration 10 (OVERLAPS) 0/269 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/270 variables, and 121 constraints, problems are : Problem set: 1 solved, 163 unsolved in 16749 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 12/16 constraints. Problems are: Problem set: 1 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 1/17 constraints. Problems are: Problem set: 1 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 165/268 variables, 103/120 constraints. Problems are: Problem set: 1 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 1/121 constraints. Problems are: Problem set: 1 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 163/284 constraints. Problems are: Problem set: 1 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/284 constraints. Problems are: Problem set: 1 solved, 163 unsolved
At refinement iteration 8 (OVERLAPS) 1/269 variables, 1/285 constraints. Problems are: Problem set: 1 solved, 163 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/285 constraints. Problems are: Problem set: 1 solved, 163 unsolved
At refinement iteration 10 (OVERLAPS) 0/269 variables, 0/285 constraints. Problems are: Problem set: 1 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/270 variables, and 285 constraints, problems are : Problem set: 1 solved, 163 unsolved in 24497 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 163/164 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41273ms problems are : Problem set: 1 solved, 163 unsolved
Search for dead transitions found 1 dead transitions in 41274ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 104/199 places, 168/289 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 102 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 102 transition count 166
Applied a total of 4 rules in 10 ms. Remains 102 /104 variables (removed 2) and now considering 166/168 (removed 2) transitions.
[2026-05-26 21:30:39] [INFO ] Flow matrix only has 163 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15078308509346969702.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3235851325575749614.kers'
[2026-05-26 21:30:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15078308509346969702.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3235851325575749614.kers]
Normalized transition count is 162 out of 163 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 102 cols 506 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-26 21:30:40] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3235851325575749614.kers
Total runtime 1 ms.
[2026-05-26 21:30:40] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-26 21:30:40] [INFO ] Flow matrix only has 163 transitions (discarded 3 similar events)
[2026-05-26 21:30:40] [INFO ] Invariant cache hit.
[2026-05-26 21:30:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-26 21:30:40] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 102/199 places, 166/289 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 42131 ms. Remains : 102/199 places, 166/289 transitions.
[2026-05-26 21:30:40] [INFO ] Flatten gal took : 8 ms
[2026-05-26 21:30:40] [INFO ] Flatten gal took : 9 ms
[2026-05-26 21:30:40] [INFO ] Input system was already deterministic with 166 transitions.
[2026-05-26 21:30:40] [INFO ] Flatten gal took : 8 ms
[2026-05-26 21:30:40] [INFO ] Flatten gal took : 8 ms
[2026-05-26 21:30:40] [INFO ] Time to serialize gal into /tmp/CTLFireability5379979231911588060.gal : 2 ms
[2026-05-26 21:30:40] [INFO ] Time to serialize properties into /tmp/CTLFireability16497878651118591415.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/CTLFireability5379979231911588060.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16497878651118591415.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,89944,0.461975,12512,2,1785,5,28915,6,0,572,33270,0


Converting to forward existential form...Done !
original formula: A(AG((AG(!(EG((p179==1)))) * ((p70!=1)||((p20==1)&&(p208==1))))) U EF(((p46==1)&&(p176==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U ((p46==1)&&(p176==1))))))) * !(E(!(E(TRUE U ((p46==1)&&(p176==1)))) U (!(!(E(TRUE U !(...280
Reverse transition relation is NOT exact ! Due to transitions t30, t35, t40, t42, t48, t53, t87, t88, t96, t100, t107, t110, t116, t148, t155, t156, t160, ...273
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,8.20589,211332,1,0,568,1.397e+06,364,322,4269,1.06149e+06,666
FORMULA FireWire-PT-15-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 289/289 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 173 transition count 244
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 173 transition count 244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 173 transition count 243
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 60 place count 166 transition count 226
Iterating global reduction 1 with 7 rules applied. Total rules applied 67 place count 166 transition count 226
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 70 place count 163 transition count 222
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 163 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 163 transition count 221
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 162 transition count 220
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 162 transition count 220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 161 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 161 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 160 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 160 transition count 218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 159 transition count 217
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 159 transition count 217
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 158 transition count 216
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 158 transition count 216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 157 transition count 215
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 157 transition count 215
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 156 transition count 214
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 156 transition count 214
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 155 transition count 213
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 155 transition count 213
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 154 transition count 212
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 154 transition count 212
Applied a total of 92 rules in 21 ms. Remains 154 /199 variables (removed 45) and now considering 212/289 (removed 77) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14706923249140734753.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4111640833922956119.kers'
[2026-05-26 21:30:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14706923249140734753.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4111640833922956119.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 212 rows 154 cols 600 entries
Finished phase 1 with 150 SingleSign rule and 0 generalized
[2026-05-26 21:30:48] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4111640833922956119.kers
Total runtime 2 ms.
[2026-05-26 21:30:48] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-26 21:30:48] [INFO ] Invariant cache hit.
[2026-05-26 21:30:49] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2026-05-26 21:30:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Problem TDEAD126 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 7/11 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 8/19 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 3/22 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 212/366 variables, 154/176 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 2/178 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 210 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 178 constraints, problems are : Problem set: 1 solved, 210 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 20/24 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 5 (OVERLAPS) 212/366 variables, 154/179 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 210/389 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 1/390 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 1/391 constraints. Problems are: Problem set: 1 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/366 variables, and 391 constraints, problems are : Problem set: 1 solved, 210 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 210/211 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60052ms problems are : Problem set: 1 solved, 210 unsolved
Search for dead transitions found 1 dead transitions in 60053ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 154/199 places, 211/289 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 152 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 152 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 151 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 151 transition count 208
Applied a total of 6 rules in 7 ms. Remains 151 /154 variables (removed 3) and now considering 208/211 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4068590651679999341.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-269487379516847747.kers'
[2026-05-26 21:31:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4068590651679999341.kers, --Pflows, --basisKERS=/tmp/petrispot-output-269487379516847747.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 208 rows 151 cols 586 entries
Finished phase 1 with 147 SingleSign rule and 0 generalized
[2026-05-26 21:31:49] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-269487379516847747.kers
Total runtime 2 ms.
[2026-05-26 21:31:49] [INFO ] Implicit Places using invariants in 186 ms returned []
[2026-05-26 21:31:49] [INFO ] Invariant cache hit.
[2026-05-26 21:31:49] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 151/199 places, 208/289 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60989 ms. Remains : 151/199 places, 208/289 transitions.
[2026-05-26 21:31:49] [INFO ] Flatten gal took : 13 ms
[2026-05-26 21:31:49] [INFO ] Flatten gal took : 8 ms
[2026-05-26 21:31:49] [INFO ] Input system was already deterministic with 208 transitions.
[2026-05-26 21:31:49] [INFO ] Flatten gal took : 10 ms
[2026-05-26 21:31:49] [INFO ] Flatten gal took : 7 ms
[2026-05-26 21:31:49] [INFO ] Time to serialize gal into /tmp/CTLFireability15337873810488332365.gal : 2 ms
[2026-05-26 21:31:49] [INFO ] Time to serialize properties into /tmp/CTLFireability7135509315267602031.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/CTLFireability15337873810488332365.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7135509315267602031.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,495324,1.92258,45188,2,5317,5,128079,6,0,813,172910,0


Converting to forward existential form...Done !
original formula: AG(AX(E(!(EX((p56==1))) U AX((p17!=1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(!(EX((p56==1))) U !(EX(!((p17!=1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t47, t51, t55, t58, t62, t70, t78, t82, t83, t98, t101, t103, t113, t115, t170, t192, t19...294
(forward)formula 0,1,5.337,107952,1,0,356,540437,437,192,5068,418998,439
FORMULA FireWire-PT-15-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 289/289 transitions.
Graph (trivial) has 136 edges and 199 vertex of which 9 / 199 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 192 transition count 260
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 47 place count 170 transition count 258
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 169 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 168 transition count 257
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 50 place count 168 transition count 250
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 64 place count 161 transition count 250
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 82 place count 143 transition count 222
Iterating global reduction 4 with 18 rules applied. Total rules applied 100 place count 143 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 101 place count 143 transition count 221
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 101 place count 143 transition count 215
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 113 place count 137 transition count 215
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 119 place count 131 transition count 199
Iterating global reduction 5 with 6 rules applied. Total rules applied 125 place count 131 transition count 199
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 126 place count 131 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 127 place count 130 transition count 198
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 129 place count 128 transition count 196
Iterating global reduction 7 with 2 rules applied. Total rules applied 131 place count 128 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 133 place count 128 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 134 place count 127 transition count 194
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 135 place count 126 transition count 193
Iterating global reduction 9 with 1 rules applied. Total rules applied 136 place count 126 transition count 193
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 137 place count 125 transition count 192
Iterating global reduction 9 with 1 rules applied. Total rules applied 138 place count 125 transition count 192
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 139 place count 124 transition count 191
Iterating global reduction 9 with 1 rules applied. Total rules applied 140 place count 124 transition count 191
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 141 place count 123 transition count 190
Iterating global reduction 9 with 1 rules applied. Total rules applied 142 place count 123 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 154 place count 117 transition count 184
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 156 place count 115 transition count 182
Applied a total of 156 rules in 39 ms. Remains 115 /199 variables (removed 84) and now considering 182/289 (removed 107) transitions.
[2026-05-26 21:31:55] [INFO ] Flow matrix only has 180 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11796789568211477705.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2677631245988429321.kers'
[2026-05-26 21:31:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11796789568211477705.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2677631245988429321.kers]
Normalized transition count is 179 out of 180 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 179 rows 115 cols 560 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-26 21:31:55] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2677631245988429321.kers
Total runtime 2 ms.
[2026-05-26 21:31:55] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-26 21:31:55] [INFO ] Flow matrix only has 180 transitions (discarded 2 similar events)
[2026-05-26 21:31:55] [INFO ] Invariant cache hit.
[2026-05-26 21:31:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-26 21:31:55] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2026-05-26 21:31:55] [INFO ] Redundant transitions in 1 ms returned []
Running 178 sub problems to find dead transitions.
[2026-05-26 21:31:55] [INFO ] Flow matrix only has 180 transitions (discarded 2 similar events)
[2026-05-26 21:31:55] [INFO ] Invariant cache hit.
[2026-05-26 21:31:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Problem TDEAD62 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 4/6 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 1/115 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 5/15 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 1/16 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 179/294 variables, 115/131 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 1/132 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/294 variables, 0/132 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 12 (OVERLAPS) 0/294 variables, 0/132 constraints. Problems are: Problem set: 1 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/295 variables, and 132 constraints, problems are : Problem set: 1 solved, 177 unsolved in 22366 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 115/115 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 12/14 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 3 (OVERLAPS) 1/115 variables, 2/16 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 179/294 variables, 115/131 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 1/132 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 177/309 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 1/310 constraints. Problems are: Problem set: 1 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 294/295 variables, and 310 constraints, problems are : Problem set: 1 solved, 177 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 115/115 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 177/178 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 52402ms problems are : Problem set: 1 solved, 177 unsolved
Search for dead transitions found 1 dead transitions in 52403ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 115/199 places, 181/289 transitions.
Applied a total of 0 rules in 5 ms. Remains 115 /115 variables (removed 0) and now considering 181/181 (removed 0) transitions.
[2026-05-26 21:32:48] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 52840 ms. Remains : 115/199 places, 181/289 transitions.
[2026-05-26 21:32:48] [INFO ] Flatten gal took : 5 ms
[2026-05-26 21:32:48] [INFO ] Flatten gal took : 5 ms
[2026-05-26 21:32:48] [INFO ] Input system was already deterministic with 181 transitions.
[2026-05-26 21:32:48] [INFO ] Flatten gal took : 6 ms
[2026-05-26 21:32:48] [INFO ] Flatten gal took : 5 ms
[2026-05-26 21:32:48] [INFO ] Time to serialize gal into /tmp/CTLFireability9746483497279736346.gal : 2 ms
[2026-05-26 21:32:48] [INFO ] Time to serialize properties into /tmp/CTLFireability6365670283717336984.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/CTLFireability9746483497279736346.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6365670283717336984.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,111342,0.377759,13432,2,1733,5,29436,6,0,639,37847,0


Converting to forward existential form...Done !
original formula: !(E((((p41==1)&&(p176==1))||(!(((p38==1)&&(!((p20==1)&&(p208==1))))&&((p199==1)||(!((p19==1)&&(p140==1))))))) U !(A(AF((p29==1)) U AF((p8...165
=> equivalent forward existential formula: ([FwdG((FwdU(FwdU(Init,(((p41==1)&&(p176==1))||(!(((p38==1)&&(!((p20==1)&&(p208==1))))&&((p199==1)||(!((p19==1)&...400
Hit Full ! (commute/partial/dont) 152/0/29
Reverse transition relation is NOT exact ! Due to transitions t32, t37, t43, t45, t46, t55, t60, t90, t97, t98, t105, t111, t117, t127, t162, t166, t170, t...284
(forward)formula 0,0,5.81284,147876,1,0,477,918494,393,241,4592,744287,569
FORMULA FireWire-PT-15-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 289/289 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 174 transition count 245
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 174 transition count 245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 174 transition count 244
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 168 transition count 228
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 168 transition count 228
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 165 transition count 224
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 165 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 165 transition count 223
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 164 transition count 222
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 164 transition count 222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 163 transition count 221
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 163 transition count 221
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 162 transition count 220
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 162 transition count 220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 161 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 161 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 160 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 160 transition count 218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 159 transition count 217
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 159 transition count 217
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 158 transition count 216
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 158 transition count 216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 157 transition count 215
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 157 transition count 215
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 156 transition count 214
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 156 transition count 214
Applied a total of 88 rules in 21 ms. Remains 156 /199 variables (removed 43) and now considering 214/289 (removed 75) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16280197128257886691.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7320635188639085062.kers'
[2026-05-26 21:32:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16280197128257886691.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7320635188639085062.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 214 rows 156 cols 606 entries
Finished phase 1 with 152 SingleSign rule and 0 generalized
[2026-05-26 21:32:53] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7320635188639085062.kers
Total runtime 3 ms.
[2026-05-26 21:32:54] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-26 21:32:54] [INFO ] Invariant cache hit.
[2026-05-26 21:32:54] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2026-05-26 21:32:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Problem TDEAD127 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 13/17 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 2/19 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/20 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 1/21 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 8 (OVERLAPS) 214/370 variables, 156/179 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 212 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/370 variables, and 179 constraints, problems are : Problem set: 1 solved, 212 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 19/23 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 214/370 variables, 156/179 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 212/391 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 1/392 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 2/394 constraints. Problems are: Problem set: 1 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 394 constraints, problems are : Problem set: 1 solved, 212 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 212/213 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60057ms problems are : Problem set: 1 solved, 212 unsolved
Search for dead transitions found 1 dead transitions in 60060ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 156/199 places, 213/289 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 155 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 155 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 154 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 154 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 153 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 153 transition count 210
Applied a total of 6 rules in 6 ms. Remains 153 /156 variables (removed 3) and now considering 210/213 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9561913364452061922.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4433265841141916971.kers'
[2026-05-26 21:33:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9561913364452061922.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4433265841141916971.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 210 rows 153 cols 592 entries
Finished phase 1 with 149 SingleSign rule and 0 generalized
[2026-05-26 21:33:54] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4433265841141916971.kers
Total runtime 2 ms.
[2026-05-26 21:33:54] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-05-26 21:33:54] [INFO ] Invariant cache hit.
[2026-05-26 21:33:54] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 153/199 places, 210/289 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60951 ms. Remains : 153/199 places, 210/289 transitions.
[2026-05-26 21:33:54] [INFO ] Flatten gal took : 7 ms
[2026-05-26 21:33:54] [INFO ] Flatten gal took : 7 ms
[2026-05-26 21:33:54] [INFO ] Input system was already deterministic with 210 transitions.
[2026-05-26 21:33:54] [INFO ] Flatten gal took : 7 ms
[2026-05-26 21:33:54] [INFO ] Flatten gal took : 7 ms
[2026-05-26 21:33:54] [INFO ] Time to serialize gal into /tmp/CTLFireability421417100299852353.gal : 2 ms
[2026-05-26 21:33:54] [INFO ] Time to serialize properties into /tmp/CTLFireability18160810513362280778.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/CTLFireability421417100299852353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18160810513362280778.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,553364,1.92025,49240,2,5817,5,138703,6,0,823,194340,0


Converting to forward existential form...Done !
original formula: (E(A(EG(EF((p106==1))) U AX((((p51==1)&&(p149==1))&&(p93!=1)))) U !(((p33==1) + AX(((p25==1)&&(p170==1)))))) * EX(EF((EF(AX((p218==1))) +...184
=> equivalent forward existential formula: ([(FwdU(FwdU(EY((Init * E(!((E(!(!(EX(!((((p51==1)&&(p149==1))&&(p93!=1)))))) U (!(EG(E(TRUE U (p106==1)))) * !(...674
Reverse transition relation is NOT exact ! Due to transitions t3, t47, t51, t55, t58, t62, t67, t71, t79, t83, t84, t100, t103, t105, t114, t116, t171, t19...300
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-05-26 21:34:24] [INFO ] Flatten gal took : 5 ms
[2026-05-26 21:34:24] [INFO ] Applying decomposition
[2026-05-26 21:34:24] [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/graph11329250829819266516.txt' '-o' '/tmp/graph11329250829819266516.bin' '-w' '/tmp/graph11329250829819266516.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11329250829819266516.bin' '-l' '-1' '-v' '-w' '/tmp/graph11329250829819266516.weights' '-q' '0' '-e' '0.001'
[2026-05-26 21:34:25] [INFO ] Decomposing Gal with order
[2026-05-26 21:34:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 21:34:25] [INFO ] Removed a total of 137 redundant transitions.
[2026-05-26 21:34:25] [INFO ] Flatten gal took : 15 ms
[2026-05-26 21:34:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2026-05-26 21:34:25] [INFO ] Time to serialize gal into /tmp/CTLFireability12465016419928051370.gal : 3 ms
[2026-05-26 21:34:25] [INFO ] Time to serialize properties into /tmp/CTLFireability18307354094366662567.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/CTLFireability12465016419928051370.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18307354094366662567.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,553364,0.308312,10436,391,133,10296,2865,560,19970,152,9486,0


Converting to forward existential form...Done !
original formula: (E(A(EG(EF((i4.i1.u18.p106==1))) U AX((((i2.u6.p51==1)&&(i2.u27.p149==1))&&(i5.i1.u14.p93!=1)))) U !(((i0.u5.p33==1) + AX(((i3.u3.p25==1)...259
=> equivalent forward existential formula: ([(FwdU(FwdU(EY((Init * E(!((E(!(!(EX(!((((i2.u6.p51==1)&&(i2.u27.p149==1))&&(i5.i1.u14.p93!=1)))))) U (!(EG(E(T...893
Reverse transition relation is NOT exact ! Due to transitions t47, t55, t62, t105, t116, t171, t194, t195, t196, t199, t200, t202, i0.t100, i3.t103, i3.u3....391
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 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
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,2.19732,65444,1,0,98028,6235,3786,262003,973,20542,231202
FORMULA FireWire-PT-15-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 289/289 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 174 transition count 254
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 174 transition count 254
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 57 place count 167 transition count 237
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 167 transition count 237
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 164 transition count 233
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 164 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 71 place count 164 transition count 232
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 163 transition count 231
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 163 transition count 231
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 162 transition count 230
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 162 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 161 transition count 229
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 161 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 160 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 160 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 159 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 159 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 158 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 158 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 157 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 157 transition count 225
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 156 transition count 224
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 156 transition count 224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 155 transition count 223
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 155 transition count 223
Applied a total of 89 rules in 19 ms. Remains 155 /199 variables (removed 44) and now considering 223/289 (removed 66) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5076954213776062206.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3264206275455157142.kers'
[2026-05-26 21:34:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5076954213776062206.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3264206275455157142.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 223 rows 155 cols 642 entries
Finished phase 1 with 151 SingleSign rule and 0 generalized
[2026-05-26 21:34:27] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3264206275455157142.kers
Total runtime 2 ms.
[2026-05-26 21:34:27] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-26 21:34:27] [INFO ] Invariant cache hit.
[2026-05-26 21:34:27] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2026-05-26 21:34:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Problem TDEAD127 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 10/20 constraints. Problems are: Problem set: 1 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 2/22 constraints. Problems are: Problem set: 1 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 2/24 constraints. Problems are: Problem set: 1 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 223/378 variables, 155/179 constraints. Problems are: Problem set: 1 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/378 variables, 1/180 constraints. Problems are: Problem set: 1 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/378 variables, and 180 constraints, problems are : Problem set: 1 solved, 221 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 21/25 constraints. Problems are: Problem set: 1 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 223/378 variables, 155/180 constraints. Problems are: Problem set: 1 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 221/401 constraints. Problems are: Problem set: 1 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 2/403 constraints. Problems are: Problem set: 1 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/403 constraints. Problems are: Problem set: 1 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/378 variables, and 403 constraints, problems are : Problem set: 1 solved, 221 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 221/222 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 1 solved, 221 unsolved
Search for dead transitions found 1 dead transitions in 60063ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 155/199 places, 222/289 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 154 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 154 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 153 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 153 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 152 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 152 transition count 219
Applied a total of 6 rules in 6 ms. Remains 152 /155 variables (removed 3) and now considering 219/222 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4489267688291782909.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5296717892848447726.kers'
[2026-05-26 21:35:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4489267688291782909.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5296717892848447726.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 219 rows 152 cols 628 entries
Finished phase 1 with 148 SingleSign rule and 0 generalized
[2026-05-26 21:35:27] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5296717892848447726.kers
Total runtime 3 ms.
[2026-05-26 21:35:27] [INFO ] Implicit Places using invariants in 136 ms returned []
[2026-05-26 21:35:27] [INFO ] Invariant cache hit.
[2026-05-26 21:35:28] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 152/199 places, 219/289 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60821 ms. Remains : 152/199 places, 219/289 transitions.
[2026-05-26 21:35:28] [INFO ] Flatten gal took : 8 ms
[2026-05-26 21:35:28] [INFO ] Flatten gal took : 8 ms
[2026-05-26 21:35:28] [INFO ] Input system was already deterministic with 219 transitions.
[2026-05-26 21:35:28] [INFO ] Flatten gal took : 7 ms
[2026-05-26 21:35:28] [INFO ] Flatten gal took : 8 ms
[2026-05-26 21:35:28] [INFO ] Time to serialize gal into /tmp/CTLFireability10507944849474232136.gal : 2 ms
[2026-05-26 21:35:28] [INFO ] Time to serialize properties into /tmp/CTLFireability8699354831183247887.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/CTLFireability10507944849474232136.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8699354831183247887.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,501682,2.30404,51144,2,5511,5,144781,6,0,828,199250,0


Converting to forward existential form...Done !
original formula: EX(!(E((p205!=1) U ((p46==1)&&(p212==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E((p205!=1) U ((p46==1)&&(p212==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t12, t48, t52, t56, t59, t60, t63, t71, t79, t83, t84, t100, t103, t105, t114, t116, t181...305
(forward)formula 0,0,18.3605,420976,1,0,841,2.96567e+06,458,485,5335,1.89421e+06,1037
FORMULA FireWire-PT-15-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 289/289 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 176 transition count 248
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 176 transition count 248
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 176 transition count 247
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 52 place count 171 transition count 232
Iterating global reduction 1 with 5 rules applied. Total rules applied 57 place count 171 transition count 232
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 169 transition count 229
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 169 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 168 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 168 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 167 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 167 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 166 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 166 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 165 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 165 transition count 225
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 164 transition count 224
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 164 transition count 224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 163 transition count 223
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 163 transition count 223
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 162 transition count 222
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 162 transition count 222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 161 transition count 221
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 161 transition count 221
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 160 transition count 220
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 160 transition count 220
Applied a total of 79 rules in 32 ms. Remains 160 /199 variables (removed 39) and now considering 220/289 (removed 69) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13071826163825407794.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-970262902080445302.kers'
[2026-05-26 21:35:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13071826163825407794.kers, --Pflows, --basisKERS=/tmp/petrispot-output-970262902080445302.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 220 rows 160 cols 622 entries
Finished phase 1 with 156 SingleSign rule and 0 generalized
[2026-05-26 21:35:46] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-970262902080445302.kers
Total runtime 3 ms.
[2026-05-26 21:35:46] [INFO ] Implicit Places using invariants in 207 ms returned []
[2026-05-26 21:35:46] [INFO ] Invariant cache hit.
[2026-05-26 21:35:47] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2026-05-26 21:35:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Problem TDEAD131 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 13/17 constraints. Problems are: Problem set: 1 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 4/21 constraints. Problems are: Problem set: 1 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 1/24 constraints. Problems are: Problem set: 1 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 220/380 variables, 160/185 constraints. Problems are: Problem set: 1 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/186 constraints. Problems are: Problem set: 1 solved, 218 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 186 constraints, problems are : Problem set: 1 solved, 218 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 22/26 constraints. Problems are: Problem set: 1 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 220/380 variables, 160/186 constraints. Problems are: Problem set: 1 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 218/404 constraints. Problems are: Problem set: 1 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 0/404 constraints. Problems are: Problem set: 1 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 405 constraints, problems are : Problem set: 1 solved, 218 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 218/219 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60050ms problems are : Problem set: 1 solved, 218 unsolved
Search for dead transitions found 1 dead transitions in 60052ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 160/199 places, 219/289 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 159 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 159 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 158 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 158 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 157 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 157 transition count 216
Applied a total of 6 rules in 6 ms. Remains 157 /160 variables (removed 3) and now considering 216/219 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-396182457265366833.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16773617464496539455.kers'
[2026-05-26 21:36:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-396182457265366833.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16773617464496539455.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 216 rows 157 cols 608 entries
Finished phase 1 with 153 SingleSign rule and 0 generalized
[2026-05-26 21:36:47] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16773617464496539455.kers
Total runtime 1 ms.
[2026-05-26 21:36:47] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-26 21:36:47] [INFO ] Invariant cache hit.
[2026-05-26 21:36:47] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 157/199 places, 216/289 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61078 ms. Remains : 157/199 places, 216/289 transitions.
[2026-05-26 21:36:47] [INFO ] Flatten gal took : 9 ms
[2026-05-26 21:36:47] [INFO ] Flatten gal took : 7 ms
[2026-05-26 21:36:47] [INFO ] Input system was already deterministic with 216 transitions.
[2026-05-26 21:36:47] [INFO ] Flatten gal took : 7 ms
[2026-05-26 21:36:47] [INFO ] Flatten gal took : 7 ms
[2026-05-26 21:36:47] [INFO ] Time to serialize gal into /tmp/CTLFireability14089849285506040721.gal : 1 ms
[2026-05-26 21:36:47] [INFO ] Time to serialize properties into /tmp/CTLFireability12856984853912143547.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/CTLFireability14089849285506040721.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12856984853912143547.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,616924,2.17031,52960,2,5804,5,148352,6,0,845,234453,0


Converting to forward existential form...Done !
original formula: E(!(AG((p185!=1))) U (((p177==1) + EX(E(EG((p218==1)) U EX(((p71==1)&&(p110==1)))))) + (!(EX((((p52==1)&&(p207==1))||(p179==1)))) * A(!(E...183
=> equivalent forward existential formula: (([(FwdU(Init,!(!(E(TRUE U !((p185!=1)))))) * (p177==1))] != FALSE + [(EY(FwdU(EY(FwdU(Init,!(!(E(TRUE U !((p185...400
Reverse transition relation is NOT exact ! Due to transitions t3, t23, t38, t52, t57, t60, t63, t67, t75, t78, t84, t88, t89, t104, t107, t109, t118, t120,...316
(forward)formula 0,1,27.0333,654420,1,0,1114,3.11657e+06,459,694,5474,4.22829e+06,1223
FORMULA FireWire-PT-15-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 289/289 transitions.
Graph (trivial) has 148 edges and 199 vertex of which 12 / 199 are part of one of the 3 SCC in 1 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 189 transition count 255
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 166 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 165 transition count 253
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 50 place count 165 transition count 246
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 64 place count 158 transition count 246
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 82 place count 140 transition count 209
Iterating global reduction 3 with 18 rules applied. Total rules applied 100 place count 140 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 102 place count 140 transition count 207
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 102 place count 140 transition count 201
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 114 place count 134 transition count 201
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 120 place count 128 transition count 185
Iterating global reduction 4 with 6 rules applied. Total rules applied 126 place count 128 transition count 185
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 127 place count 128 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 128 place count 127 transition count 184
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 131 place count 124 transition count 180
Iterating global reduction 6 with 3 rules applied. Total rules applied 134 place count 124 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 136 place count 124 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 137 place count 123 transition count 178
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 138 place count 122 transition count 177
Iterating global reduction 8 with 1 rules applied. Total rules applied 139 place count 122 transition count 177
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 140 place count 121 transition count 176
Iterating global reduction 8 with 1 rules applied. Total rules applied 141 place count 121 transition count 176
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 142 place count 120 transition count 175
Iterating global reduction 8 with 1 rules applied. Total rules applied 143 place count 120 transition count 175
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 144 place count 119 transition count 174
Iterating global reduction 8 with 1 rules applied. Total rules applied 145 place count 119 transition count 174
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 146 place count 118 transition count 173
Iterating global reduction 8 with 1 rules applied. Total rules applied 147 place count 118 transition count 173
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 148 place count 117 transition count 172
Iterating global reduction 8 with 1 rules applied. Total rules applied 149 place count 117 transition count 172
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 150 place count 116 transition count 171
Iterating global reduction 8 with 1 rules applied. Total rules applied 151 place count 116 transition count 171
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 152 place count 115 transition count 170
Iterating global reduction 8 with 1 rules applied. Total rules applied 153 place count 115 transition count 170
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 154 place count 114 transition count 169
Iterating global reduction 8 with 1 rules applied. Total rules applied 155 place count 114 transition count 169
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 173 place count 105 transition count 160
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 174 place count 104 transition count 159
Applied a total of 174 rules in 35 ms. Remains 104 /199 variables (removed 95) and now considering 159/289 (removed 130) transitions.
[2026-05-26 21:37:15] [INFO ] Flow matrix only has 156 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1148345439581139184.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14944550340293097906.kers'
[2026-05-26 21:37:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1148345439581139184.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14944550340293097906.kers]
Normalized transition count is 155 out of 156 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 155 rows 104 cols 478 entries
Finished phase 1 with 100 SingleSign rule and 0 generalized
[2026-05-26 21:37:15] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14944550340293097906.kers
Total runtime 1 ms.
[2026-05-26 21:37:15] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-26 21:37:15] [INFO ] Flow matrix only has 156 transitions (discarded 3 similar events)
[2026-05-26 21:37:15] [INFO ] Invariant cache hit.
[2026-05-26 21:37:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-26 21:37:15] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2026-05-26 21:37:15] [INFO ] Redundant transitions in 1 ms returned []
Running 154 sub problems to find dead transitions.
[2026-05-26 21:37:15] [INFO ] Flow matrix only has 156 transitions (discarded 3 similar events)
[2026-05-26 21:37:15] [INFO ] Invariant cache hit.
[2026-05-26 21:37:15] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 1/103 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Problem TDEAD55 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 6/12 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 155/258 variables, 103/115 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 1/116 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/116 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 9 (OVERLAPS) 1/259 variables, 1/117 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 11 (OVERLAPS) 1/260 variables, 1/118 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/260 variables, 1/119 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/260 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 14 (OVERLAPS) 0/260 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 119 constraints, problems are : Problem set: 1 solved, 153 unsolved in 19806 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 1/103 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 2/13 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 155/258 variables, 103/118 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 1/119 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 153/272 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 1/273 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/273 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 12 (OVERLAPS) 1/259 variables, 1/274 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/259 variables, 1/275 constraints. Problems are: Problem set: 1 solved, 153 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 259/260 variables, and 275 constraints, problems are : Problem set: 1 solved, 153 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 1/2 constraints, PredecessorRefiner: 153/154 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49831ms problems are : Problem set: 1 solved, 153 unsolved
Search for dead transitions found 1 dead transitions in 49832ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 104/199 places, 158/289 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 102 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 102 transition count 156
Applied a total of 4 rules in 7 ms. Remains 102 /104 variables (removed 2) and now considering 156/158 (removed 2) transitions.
[2026-05-26 21:38:05] [INFO ] Flow matrix only has 153 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14148911877554045118.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-773214634193013730.kers'
[2026-05-26 21:38:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14148911877554045118.kers, --Pflows, --basisKERS=/tmp/petrispot-output-773214634193013730.kers]
Normalized transition count is 152 out of 153 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 152 rows 102 cols 466 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-26 21:38:05] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-773214634193013730.kers
Total runtime 2 ms.
[2026-05-26 21:38:05] [INFO ] Implicit Places using invariants in 162 ms returned []
[2026-05-26 21:38:05] [INFO ] Flow matrix only has 153 transitions (discarded 3 similar events)
[2026-05-26 21:38:05] [INFO ] Invariant cache hit.
[2026-05-26 21:38:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-26 21:38:05] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 102/199 places, 156/289 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 50599 ms. Remains : 102/199 places, 156/289 transitions.
[2026-05-26 21:38:05] [INFO ] Flatten gal took : 5 ms
[2026-05-26 21:38:05] [INFO ] Flatten gal took : 5 ms
[2026-05-26 21:38:05] [INFO ] Input system was already deterministic with 156 transitions.
[2026-05-26 21:38:05] [INFO ] Flatten gal took : 5 ms
[2026-05-26 21:38:05] [INFO ] Flatten gal took : 4 ms
[2026-05-26 21:38:05] [INFO ] Time to serialize gal into /tmp/CTLFireability12719660419376283968.gal : 2 ms
[2026-05-26 21:38:05] [INFO ] Time to serialize properties into /tmp/CTLFireability8522591028267480862.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/CTLFireability12719660419376283968.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8522591028267480862.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,82291,0.500467,13912,2,1843,5,32151,6,0,561,37719,0


Converting to forward existential form...Done !
original formula: EF(EG((p59==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p59==1))] != FALSE
Hit Full ! (commute/partial/dont) 154/0/2
(forward)formula 0,0,0.929622,17880,1,0,17,69085,19,2,2920,37719,17
FORMULA FireWire-PT-15-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-26 21:38:06] [INFO ] Flatten gal took : 5 ms
[2026-05-26 21:38:06] [INFO ] Flatten gal took : 6 ms
Total runtime 1099751 ms.

BK_STOP 1779831486719

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

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