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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 8.6K Mar 7 05:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 7 05:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 7 05:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 7 05:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 10:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 19K Mar 15 10:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 05:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Mar 7 05:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Mar 7 05:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Mar 7 05:19 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 84K 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-16-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779832245192

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-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-26 21:50:47] [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:50:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 21:50:48] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2026-05-26 21:50:48] [INFO ] Transformed 254 places.
[2026-05-26 21:50:48] [INFO ] Transformed 368 transitions.
[2026-05-26 21:50:48] [INFO ] Found NUPN structural information;
[2026-05-26 21:50:48] [INFO ] Parsed PT model containing 254 places and 368 transitions and 1032 arcs in 414 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Support contains 120 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 368/368 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 251 transition count 368
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 31 place count 223 transition count 340
Iterating global reduction 1 with 28 rules applied. Total rules applied 59 place count 223 transition count 340
Applied a total of 59 rules in 88 ms. Remains 223 /254 variables (removed 31) and now considering 340/368 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12923705216821643481.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18345955742868579987.kers'
[2026-05-26 21:50:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12923705216821643481.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18345955742868579987.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 340 rows 223 cols 972 entries
Finished phase 1 with 219 SingleSign rule and 0 generalized
[2026-05-26 21:50:48] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-18345955742868579987.kers
Total runtime 6 ms.
[2026-05-26 21:50:49] [INFO ] Implicit Places using invariants in 597 ms returned []
[2026-05-26 21:50:49] [INFO ] Invariant cache hit.
[2026-05-26 21:50:49] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 1250 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2026-05-26 21:50:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Problem TDEAD194 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD319 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 19/23 constraints. Problems are: Problem set: 11 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 1/24 constraints. Problems are: Problem set: 11 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 2/26 constraints. Problems are: Problem set: 11 solved, 328 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 223/563 variables, and 26 constraints, problems are : Problem set: 11 solved, 328 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/223 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 328 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 4/4 constraints. Problems are: Problem set: 11 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 22/26 constraints. Problems are: Problem set: 11 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 4/30 constraints. Problems are: Problem set: 11 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/30 constraints. Problems are: Problem set: 11 solved, 328 unsolved
At refinement iteration 5 (OVERLAPS) 340/563 variables, 223/253 constraints. Problems are: Problem set: 11 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 328/581 constraints. Problems are: Problem set: 11 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 1/582 constraints. Problems are: Problem set: 11 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/563 variables, and 582 constraints, problems are : Problem set: 11 solved, 328 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 328/339 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60356ms problems are : Problem set: 11 solved, 328 unsolved
Search for dead transitions found 11 dead transitions in 60391ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in LTL mode, iteration 1 : 223/254 places, 329/368 transitions.
Applied a total of 0 rules in 11 ms. Remains 223 /223 variables (removed 0) and now considering 329/329 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61858 ms. Remains : 223/254 places, 329/368 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 329/329 transitions.
Applied a total of 0 rules in 10 ms. Remains 223 /223 variables (removed 0) and now considering 329/329 (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-16474011988446901585.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12472849909964657921.kers'
[2026-05-26 21:51:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16474011988446901585.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12472849909964657921.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 329 rows 223 cols 928 entries
Finished phase 1 with 219 SingleSign rule and 0 generalized
[2026-05-26 21:51:50] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12472849909964657921.kers
Total runtime 4 ms.
[2026-05-26 21:51:50] [INFO ] Implicit Places using invariants in 160 ms returned []
[2026-05-26 21:51:50] [INFO ] Invariant cache hit.
[2026-05-26 21:51:50] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2026-05-26 21:51:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Problem TDEAD192 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD307 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 12/16 constraints. Problems are: Problem set: 19 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 4/20 constraints. Problems are: Problem set: 19 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 3/23 constraints. Problems are: Problem set: 19 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 1/24 constraints. Problems are: Problem set: 19 solved, 309 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 223/552 variables, and 25 constraints, problems are : Problem set: 19 solved, 309 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/223 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 19 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 19 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 4/4 constraints. Problems are: Problem set: 19 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 21/25 constraints. Problems are: Problem set: 19 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 8/33 constraints. Problems are: Problem set: 19 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/33 constraints. Problems are: Problem set: 19 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 329/552 variables, 223/256 constraints. Problems are: Problem set: 19 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 309/565 constraints. Problems are: Problem set: 19 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/552 variables, and 566 constraints, problems are : Problem set: 19 solved, 309 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 309/328 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60140ms problems are : Problem set: 19 solved, 309 unsolved
Search for dead transitions found 19 dead transitions in 60146ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in LTL mode, iteration 1 : 223/223 places, 310/329 transitions.
Applied a total of 0 rules in 10 ms. Remains 223 /223 variables (removed 0) and now considering 310/310 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60723 ms. Remains : 223/223 places, 310/329 transitions.
Support contains 120 out of 223 places after structural reductions.
[2026-05-26 21:52:51] [INFO ] Flatten gal took : 117 ms
[2026-05-26 21:52:51] [INFO ] Flatten gal took : 47 ms
[2026-05-26 21:52:51] [INFO ] Input system was already deterministic with 310 transitions.
RANDOM walk for 40000 steps (8 resets) in 2553 ms. (15 steps per ms) remains 76/102 properties
BEST_FIRST walk for 4002 steps (10 resets) in 89 ms. (44 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4000 steps (8 resets) in 72 ms. (54 steps per ms) remains 75/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4000 steps (8 resets) in 83 ms. (47 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (11 resets) in 63 ms. (62 steps per ms) remains 72/75 properties
BEST_FIRST walk for 4001 steps (9 resets) in 55 ms. (71 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4000 steps (8 resets) in 58 ms. (67 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4001 steps (10 resets) in 57 ms. (68 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4000 steps (8 resets) in 63 ms. (62 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4001 steps (11 resets) in 37 ms. (105 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (12 resets) in 42 ms. (93 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4001 steps (9 resets) in 41 ms. (95 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (13 resets) in 28 ms. (138 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4001 steps (9 resets) in 44 ms. (88 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4001 steps (8 resets) in 53 ms. (74 steps per ms) remains 69/72 properties
BEST_FIRST walk for 4000 steps (8 resets) in 55 ms. (71 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4000 steps (9 resets) in 58 ms. (67 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4001 steps (10 resets) in 44 ms. (88 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4001 steps (11 resets) in 51 ms. (76 steps per ms) remains 68/69 properties
BEST_FIRST walk for 4000 steps (9 resets) in 53 ms. (74 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (10 resets) in 34 ms. (114 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (10 resets) in 54 ms. (72 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (9 resets) in 39 ms. (100 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (11 resets) in 33 ms. (117 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (11 resets) in 54 ms. (72 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (9 resets) in 56 ms. (70 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (11 resets) in 34 ms. (114 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (11 resets) in 47 ms. (83 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (11 resets) in 70 ms. (56 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (11 resets) in 42 ms. (93 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (10 resets) in 44 ms. (88 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (9 resets) in 58 ms. (67 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (8 resets) in 40 ms. (97 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (10 resets) in 34 ms. (114 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (9 resets) in 42 ms. (93 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (10 resets) in 34 ms. (114 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (9 resets) in 43 ms. (90 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (10 resets) in 35 ms. (111 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (8 resets) in 48 ms. (81 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (9 resets) in 33 ms. (117 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (10 resets) in 37 ms. (105 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (8 resets) in 33 ms. (117 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (8 resets) in 36 ms. (108 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (11 resets) in 28 ms. (137 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (12 resets) in 46 ms. (85 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (10 resets) in 30 ms. (129 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (10 resets) in 32 ms. (121 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (10 resets) in 33 ms. (117 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (10 resets) in 37 ms. (105 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (9 resets) in 32 ms. (121 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (11 resets) in 49 ms. (80 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (9 resets) in 39 ms. (100 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (10 resets) in 43 ms. (90 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (10 resets) in 40 ms. (97 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (11 resets) in 39 ms. (100 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (9 resets) in 35 ms. (111 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (9 resets) in 34 ms. (114 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (9 resets) in 46 ms. (85 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (9 resets) in 33 ms. (117 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (9 resets) in 31 ms. (125 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (10 resets) in 22 ms. (174 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (10 resets) in 41 ms. (95 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (8 resets) in 44 ms. (88 steps per ms) remains 68/68 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10197257844418294968.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11549043452868067774.kers'
[2026-05-26 21:52:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10197257844418294968.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11549043452868067774.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 310 rows 223 cols 852 entries
Finished phase 1 with 219 SingleSign rule and 0 generalized
[2026-05-26 21:52:53] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11549043452868067774.kers
Total runtime 3 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp75 is UNSAT
At refinement iteration 1 (OVERLAPS) 113/203 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 64 unsolved
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp98 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 11/15 constraints. Problems are: Problem set: 10 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 1/16 constraints. Problems are: Problem set: 10 solved, 58 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 203/533 variables, and 18 constraints, problems are : Problem set: 10 solved, 58 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/223 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 58 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 130/203 variables, 4/4 constraints. Problems are: Problem set: 11 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 14/18 constraints. Problems are: Problem set: 11 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 1/19 constraints. Problems are: Problem set: 11 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 1/20 constraints. Problems are: Problem set: 11 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/20 constraints. Problems are: Problem set: 11 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 291/494 variables, 203/223 constraints. Problems are: Problem set: 11 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/494 variables, 55/278 constraints. Problems are: Problem set: 11 solved, 57 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/533 variables, and 278 constraints, problems are : Problem set: 11 solved, 57 unsolved in 5024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 203/223 constraints, PredecessorRefiner: 55/68 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10069ms problems are : Problem set: 11 solved, 57 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 72 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 310/310 transitions.
Graph (trivial) has 95 edges and 223 vertex of which 15 / 223 are part of one of the 3 SCC in 12 ms
Free SCC test removed 12 places
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 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 211 transition count 271
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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 50 place count 188 transition count 268
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 7 rules applied. Total rules applied 57 place count 186 transition count 263
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 62 place count 181 transition count 263
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 62 place count 181 transition count 254
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 80 place count 172 transition count 254
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 86 place count 166 transition count 248
Iterating global reduction 4 with 6 rules applied. Total rules applied 92 place count 166 transition count 248
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 92 place count 166 transition count 247
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 94 place count 165 transition count 247
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 126 place count 149 transition count 231
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 134 place count 145 transition count 235
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 140 place count 145 transition count 229
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 146 place count 139 transition count 229
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 150 place count 139 transition count 229
Applied a total of 150 rules in 144 ms. Remains 139 /223 variables (removed 84) and now considering 229/310 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 139/223 places, 229/310 transitions.
RANDOM walk for 40000 steps (2434 resets) in 759 ms. (52 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (76 resets) in 42 ms. (93 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (81 resets) in 32 ms. (121 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (62 resets) in 60 ms. (65 steps per ms) remains 53/57 properties
BEST_FIRST walk for 4003 steps (77 resets) in 32 ms. (121 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (71 resets) in 26 ms. (148 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (84 resets) in 24 ms. (160 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (79 resets) in 26 ms. (148 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (87 resets) in 29 ms. (133 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (82 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (80 resets) in 32 ms. (121 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (83 resets) in 31 ms. (125 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (81 resets) in 30 ms. (129 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (75 resets) in 29 ms. (133 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (85 resets) in 29 ms. (133 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (84 resets) in 30 ms. (129 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (76 resets) in 27 ms. (142 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (86 resets) in 37 ms. (105 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (73 resets) in 34 ms. (114 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (80 resets) in 38 ms. (102 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (81 resets) in 36 ms. (108 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (80 resets) in 30 ms. (129 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (85 resets) in 33 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (83 resets) in 27 ms. (142 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (79 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (62 resets) in 21 ms. (181 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (82 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (83 resets) in 29 ms. (133 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (78 resets) in 35 ms. (111 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (68 resets) in 52 ms. (75 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (80 resets) in 39 ms. (100 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (84 resets) in 34 ms. (114 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (78 resets) in 33 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (83 resets) in 30 ms. (129 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (74 resets) in 32 ms. (121 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (84 resets) in 30 ms. (129 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (84 resets) in 35 ms. (111 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (81 resets) in 39 ms. (100 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (83 resets) in 39 ms. (100 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (86 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (80 resets) in 24 ms. (160 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (80 resets) in 23 ms. (166 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (82 resets) in 44 ms. (88 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (85 resets) in 27 ms. (142 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (77 resets) in 23 ms. (166 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (77 resets) in 23 ms. (166 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (83 resets) in 46 ms. (85 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (77 resets) in 21 ms. (181 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (81 resets) in 27 ms. (142 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (80 resets) in 24 ms. (160 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (88 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (83 resets) in 36 ms. (108 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (80 resets) in 35 ms. (111 steps per ms) remains 53/53 properties
Probably explored full state space saw : 53432 states, properties seen :52
Probabilistic random walk after 218484 steps, saw 53432 distinct states, run finished after 1362 ms. (steps per millisecond=160 ) properties seen :52
Explored full state space saw : 53432 states, properties seen :0
Exhaustive walk after 218484 steps, saw 53432 distinct states, run finished after 412 ms. (steps per millisecond=530 ) properties seen :0
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
FORMULA FireWire-PT-16-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-26 21:53:06] [INFO ] Flatten gal took : 22 ms
[2026-05-26 21:53:06] [INFO ] Flatten gal took : 23 ms
[2026-05-26 21:53:06] [INFO ] Input system was already deterministic with 310 transitions.
Support contains 84 out of 223 places (down from 93) after GAL structural reductions.
FORMULA FireWire-PT-16-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 32 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 310/310 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 187 transition count 265
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 187 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 73 place count 187 transition count 264
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 80 place count 180 transition count 257
Iterating global reduction 1 with 7 rules applied. Total rules applied 87 place count 180 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 88 place count 180 transition count 256
Applied a total of 88 rules in 13 ms. Remains 180 /223 variables (removed 43) and now considering 256/310 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18339170244369322624.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15996984071740452765.kers'
[2026-05-26 21:53:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18339170244369322624.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15996984071740452765.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 256 rows 180 cols 718 entries
Finished phase 1 with 176 SingleSign rule and 0 generalized
[2026-05-26 21:53:06] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15996984071740452765.kers
Total runtime 6 ms.
[2026-05-26 21:53:06] [INFO ] Implicit Places using invariants in 167 ms returned []
[2026-05-26 21:53:06] [INFO ] Invariant cache hit.
[2026-05-26 21:53:07] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2026-05-26 21:53:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Problem TDEAD237 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 4/8 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 2/16 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 256/436 variables, 180/196 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 1/197 constraints. Problems are: Problem set: 1 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 436/436 variables, and 197 constraints, problems are : Problem set: 1 solved, 254 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 13/17 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 256/436 variables, 180/197 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 254/451 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 1/452 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 0/452 constraints. Problems are: Problem set: 1 solved, 254 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/436 variables, and 453 constraints, problems are : Problem set: 1 solved, 254 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 254/255 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60087ms problems are : Problem set: 1 solved, 254 unsolved
Search for dead transitions found 1 dead transitions in 60088ms
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 : 180/223 places, 255/310 transitions.
Applied a total of 0 rules in 6 ms. Remains 180 /180 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60545 ms. Remains : 180/223 places, 255/310 transitions.
[2026-05-26 21:54:07] [INFO ] Flatten gal took : 27 ms
[2026-05-26 21:54:07] [INFO ] Flatten gal took : 27 ms
[2026-05-26 21:54:07] [INFO ] Input system was already deterministic with 255 transitions.
[2026-05-26 21:54:07] [INFO ] Flatten gal took : 23 ms
[2026-05-26 21:54:07] [INFO ] Flatten gal took : 23 ms
[2026-05-26 21:54:07] [INFO ] Time to serialize gal into /tmp/CTLFireability14913677351163408176.gal : 13 ms
[2026-05-26 21:54:07] [INFO ] Time to serialize properties into /tmp/CTLFireability1123725590836127526.ctl : 8 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/CTLFireability14913677351163408176.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1123725590836127526.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(EX((EF((p209==1)) + !((E((p16==1) U (p246==1)) + (AX(((p71==1)&&(p102==1))) * AG(((p57==1)&&(p169==1)))))))) U (((p159==1)&&(p75==1))&&...166
=> equivalent forward existential formula: [(FwdU(Init,EX((E(TRUE U (p209==1)) + !((E((p16==1) U (p246==1)) + (!(EX(!(((p71==1)&&(p102==1))))) * !(E(TRUE U...236
(forward)formula 0,0,0.421085,10552,1,0,5,18625,8,0,985,24126,0
FORMULA FireWire-PT-16-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 310/310 transitions.
Graph (trivial) has 186 edges and 223 vertex of which 18 / 223 are part of one of the 3 SCC in 2 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 207 transition count 241
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 55 rules applied. Total rules applied 108 place count 155 transition count 238
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 111 place count 153 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 152 transition count 237
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 112 place count 152 transition count 230
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 126 place count 145 transition count 230
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 142 place count 129 transition count 214
Iterating global reduction 4 with 16 rules applied. Total rules applied 158 place count 129 transition count 214
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 158 place count 129 transition count 209
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 168 place count 124 transition count 209
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 169 place count 123 transition count 208
Iterating global reduction 4 with 1 rules applied. Total rules applied 170 place count 123 transition count 208
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 198 place count 109 transition count 194
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 200 place count 107 transition count 182
Iterating global reduction 4 with 2 rules applied. Total rules applied 202 place count 107 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 203 place count 107 transition count 181
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 205 place count 105 transition count 179
Applied a total of 205 rules in 90 ms. Remains 105 /223 variables (removed 118) and now considering 179/310 (removed 131) transitions.
[2026-05-26 21:54:07] [INFO ] Flow matrix only has 176 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-4661124866082581402.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13466002068464404222.kers'
[2026-05-26 21:54:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4661124866082581402.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13466002068464404222.kers]
Normalized transition count is 175 out of 176 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 175 rows 105 cols 530 entries
Finished phase 1 with 101 SingleSign rule and 0 generalized
[2026-05-26 21:54:07] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13466002068464404222.kers
Total runtime 2 ms.
[2026-05-26 21:54:08] [INFO ] Implicit Places using invariants in 161 ms returned []
[2026-05-26 21:54:08] [INFO ] Flow matrix only has 176 transitions (discarded 3 similar events)
[2026-05-26 21:54:08] [INFO ] Invariant cache hit.
[2026-05-26 21:54:08] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-26 21:54:08] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2026-05-26 21:54:08] [INFO ] Redundant transitions in 8 ms returned []
Running 173 sub problems to find dead transitions.
[2026-05-26 21:54:08] [INFO ] Flow matrix only has 176 transitions (discarded 3 similar events)
[2026-05-26 21:54:08] [INFO ] Invariant cache hit.
[2026-05-26 21:54:08] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Problem TDEAD103 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 172 unsolved
At refinement iteration 3 (OVERLAPS) 175/279 variables, 104/114 constraints. Problems are: Problem set: 1 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 11/125 constraints. Problems are: Problem set: 1 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 1/126 constraints. Problems are: Problem set: 1 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 1/280 variables, 1/127 constraints. Problems are: Problem set: 1 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 172 unsolved
At refinement iteration 9 (OVERLAPS) 0/280 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/281 variables, and 127 constraints, problems are : Problem set: 1 solved, 172 unsolved in 20809 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 105/105 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 7/11 constraints. Problems are: Problem set: 1 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 175/279 variables, 104/116 constraints. Problems are: Problem set: 1 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 11/127 constraints. Problems are: Problem set: 1 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 172/299 constraints. Problems are: Problem set: 1 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/299 constraints. Problems are: Problem set: 1 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 1/280 variables, 1/300 constraints. Problems are: Problem set: 1 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 2/302 constraints. Problems are: Problem set: 1 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/302 constraints. Problems are: Problem set: 1 solved, 172 unsolved
At refinement iteration 11 (OVERLAPS) 0/280 variables, 0/302 constraints. Problems are: Problem set: 1 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/281 variables, and 302 constraints, problems are : Problem set: 1 solved, 172 unsolved in 26731 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 105/105 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 172/173 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47583ms problems are : Problem set: 1 solved, 172 unsolved
Search for dead transitions found 1 dead transitions in 47584ms
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 : 105/223 places, 178/310 transitions.
Applied a total of 0 rules in 8 ms. Remains 105 /105 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2026-05-26 21:54:55] [INFO ] Redundant transitions in 11 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 48141 ms. Remains : 105/223 places, 178/310 transitions.
[2026-05-26 21:54:56] [INFO ] Flatten gal took : 15 ms
[2026-05-26 21:54:56] [INFO ] Flatten gal took : 14 ms
[2026-05-26 21:54:56] [INFO ] Input system was already deterministic with 178 transitions.
[2026-05-26 21:54:56] [INFO ] Flatten gal took : 15 ms
[2026-05-26 21:54:56] [INFO ] Flatten gal took : 15 ms
[2026-05-26 21:54:56] [INFO ] Time to serialize gal into /tmp/CTLFireability15284816147314655378.gal : 7 ms
[2026-05-26 21:54:56] [INFO ] Time to serialize properties into /tmp/CTLFireability14198932545587661712.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/CTLFireability15284816147314655378.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14198932545587661712.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,84395,0.183757,7332,2,945,5,8631,6,0,596,11782,0


Converting to forward existential form...Done !
original formula: E((p112==1) U EG(((p248==1) + EG(EF(((p49==1)&&(p122==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,(p112==1)),((p248==1) + EG(E(TRUE U ((p49==1)&&(p122==1))))))] != FALSE
Hit Full ! (commute/partial/dont) 176/0/2
Reverse transition relation is NOT exact ! Due to transitions t7, t13, t23, t25, t39, t43, t49, t115, t117, t120, t121, t126, t132, t133, t154, t155, t156,...274
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,5.49528,131892,1,0,538,675608,394,388,4460,668407,637
FORMULA FireWire-PT-16-CTLFireability-2024-02 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 : 223/223 places, 310/310 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 186 transition count 273
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 186 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 75 place count 186 transition count 272
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 85 place count 176 transition count 261
Iterating global reduction 1 with 10 rules applied. Total rules applied 95 place count 176 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 96 place count 176 transition count 260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 175 transition count 259
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 175 transition count 259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 174 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 174 transition count 258
Applied a total of 100 rules in 16 ms. Remains 174 /223 variables (removed 49) and now considering 258/310 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7066776473857271039.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16863394895048193257.kers'
[2026-05-26 21:55:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7066776473857271039.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16863394895048193257.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 258 rows 174 cols 742 entries
Finished phase 1 with 170 SingleSign rule and 0 generalized
[2026-05-26 21:55:01] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16863394895048193257.kers
Total runtime 2 ms.
[2026-05-26 21:55:01] [INFO ] Implicit Places using invariants in 174 ms returned []
[2026-05-26 21:55:01] [INFO ] Invariant cache hit.
[2026-05-26 21:55:02] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2026-05-26 21:55:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Problem TDEAD239 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 4/8 constraints. Problems are: Problem set: 1 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 258/432 variables, 174/182 constraints. Problems are: Problem set: 1 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 2/184 constraints. Problems are: Problem set: 1 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 256 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 432/432 variables, and 184 constraints, problems are : Problem set: 1 solved, 256 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 2/12 constraints. Problems are: Problem set: 1 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 258/432 variables, 174/186 constraints. Problems are: Problem set: 1 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 256/442 constraints. Problems are: Problem set: 1 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 1/443 constraints. Problems are: Problem set: 1 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 0/443 constraints. Problems are: Problem set: 1 solved, 256 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 432/432 variables, and 443 constraints, problems are : Problem set: 1 solved, 256 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 256/257 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60085ms problems are : Problem set: 1 solved, 256 unsolved
Search for dead transitions found 1 dead transitions in 60088ms
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 : 174/223 places, 257/310 transitions.
Applied a total of 0 rules in 3 ms. Remains 174 /174 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60613 ms. Remains : 174/223 places, 257/310 transitions.
[2026-05-26 21:56:02] [INFO ] Flatten gal took : 22 ms
[2026-05-26 21:56:02] [INFO ] Flatten gal took : 22 ms
[2026-05-26 21:56:02] [INFO ] Input system was already deterministic with 257 transitions.
[2026-05-26 21:56:02] [INFO ] Flatten gal took : 20 ms
[2026-05-26 21:56:02] [INFO ] Flatten gal took : 17 ms
[2026-05-26 21:56:02] [INFO ] Time to serialize gal into /tmp/CTLFireability16952909863807566834.gal : 4 ms
[2026-05-26 21:56:02] [INFO ] Time to serialize properties into /tmp/CTLFireability17000043727948138961.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/CTLFireability16952909863807566834.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17000043727948138961.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX(AG(((p62==0)||(p192==0))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(((p62==0)||(p192==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t37, t42, t46, t50, t63, t66, t79, t88, t92, t94, t110, t118, t123, ...297
(forward)formula 0,0,7.86637,186360,1,0,454,1.15763e+06,536,264,6272,718956,599
FORMULA FireWire-PT-16-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 310/310 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 200 transition count 287
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 200 transition count 287
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 200 transition count 286
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 52 place count 195 transition count 280
Iterating global reduction 1 with 5 rules applied. Total rules applied 57 place count 195 transition count 280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 195 transition count 279
Applied a total of 58 rules in 8 ms. Remains 195 /223 variables (removed 28) and now considering 279/310 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-767027962114410623.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14394281638357729360.kers'
[2026-05-26 21:56:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-767027962114410623.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14394281638357729360.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 279 rows 195 cols 786 entries
Finished phase 1 with 191 SingleSign rule and 0 generalized
[2026-05-26 21:56:10] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14394281638357729360.kers
Total runtime 2 ms.
[2026-05-26 21:56:10] [INFO ] Implicit Places using invariants in 151 ms returned []
[2026-05-26 21:56:10] [INFO ] Invariant cache hit.
[2026-05-26 21:56:10] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2026-05-26 21:56:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Problem TDEAD259 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 11/15 constraints. Problems are: Problem set: 1 solved, 277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 4/19 constraints. Problems are: Problem set: 1 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 3/22 constraints. Problems are: Problem set: 1 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 277 unsolved
At refinement iteration 6 (OVERLAPS) 279/474 variables, 195/217 constraints. Problems are: Problem set: 1 solved, 277 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 474/474 variables, and 217 constraints, problems are : Problem set: 1 solved, 277 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 277 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 277 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 18/22 constraints. Problems are: Problem set: 1 solved, 277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 1/23 constraints. Problems are: Problem set: 1 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 1/24 constraints. Problems are: Problem set: 1 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 277 unsolved
At refinement iteration 6 (OVERLAPS) 279/474 variables, 195/219 constraints. Problems are: Problem set: 1 solved, 277 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 277/496 constraints. Problems are: Problem set: 1 solved, 277 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 1/497 constraints. Problems are: Problem set: 1 solved, 277 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 474/474 variables, and 498 constraints, problems are : Problem set: 1 solved, 277 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 277/278 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60065ms problems are : Problem set: 1 solved, 277 unsolved
Search for dead transitions found 1 dead transitions in 60067ms
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 : 195/223 places, 278/310 transitions.
Applied a total of 0 rules in 3 ms. Remains 195 /195 variables (removed 0) and now considering 278/278 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60562 ms. Remains : 195/223 places, 278/310 transitions.
[2026-05-26 21:57:10] [INFO ] Flatten gal took : 19 ms
[2026-05-26 21:57:10] [INFO ] Flatten gal took : 18 ms
[2026-05-26 21:57:10] [INFO ] Input system was already deterministic with 278 transitions.
[2026-05-26 21:57:11] [INFO ] Flatten gal took : 18 ms
[2026-05-26 21:57:11] [INFO ] Flatten gal took : 17 ms
[2026-05-26 21:57:11] [INFO ] Time to serialize gal into /tmp/CTLFireability12251557023942127372.gal : 4 ms
[2026-05-26 21:57:11] [INFO ] Time to serialize properties into /tmp/CTLFireability11745518366504060552.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/CTLFireability12251557023942127372.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11745518366504060552.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(E((((p134==1) * AG((p116==1))) * ((p170==1) + A((p189==1) U ((p71==1)&&(p175==1))))) U !(((p209==1) * E(EF((p253==1)) U (((p71==1)&&(p1...453
=> equivalent forward existential formula: [((((FwdU(Init,E((((p134==1) * !(E(TRUE U !((p116==1))))) * ((p170==1) + !((E(!(((p71==1)&&(p175==1))) U (!((p18...618
Reverse transition relation is NOT exact ! Due to transitions t20, t24, t28, t30, t36, t40, t41, t46, t49, t51, t53, t55, t59, t72, t76, t81, t90, t94, t95...335
Detected timeout of ITS tools.
[2026-05-26 21:57:41] [INFO ] Flatten gal took : 11 ms
[2026-05-26 21:57:41] [INFO ] Applying decomposition
[2026-05-26 21:57:41] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4964966042436856928.txt' '-o' '/tmp/graph4964966042436856928.bin' '-w' '/tmp/graph4964966042436856928.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4964966042436856928.bin' '-l' '-1' '-v' '-w' '/tmp/graph4964966042436856928.weights' '-q' '0' '-e' '0.001'
[2026-05-26 21:57:41] [INFO ] Decomposing Gal with order
[2026-05-26 21:57:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 21:57:41] [INFO ] Removed a total of 193 redundant transitions.
[2026-05-26 21:57:41] [INFO ] Flatten gal took : 96 ms
[2026-05-26 21:57:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 13 ms.
[2026-05-26 21:57:41] [INFO ] Time to serialize gal into /tmp/CTLFireability12933268695756624360.gal : 8 ms
[2026-05-26 21:57:41] [INFO ] Time to serialize properties into /tmp/CTLFireability6106525806682720201.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/CTLFireability12933268695756624360.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6106525806682720201.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.89156e+06,0.213886,10440,498,184,10380,2150,651,17054,145,8015,0


Converting to forward existential form...Done !
original formula: E(E((((i5.u35.p134==1) * AG((i4.u31.p116==1))) * ((i6.i1.u43.p170==1) + A((i7.u45.p189==1) U ((i2.u19.p71==1)&&(i2.u19.p175==1))))) U !((...702
=> equivalent forward existential formula: [((((FwdU(Init,E((((i5.u35.p134==1) * !(E(TRUE U !((i4.u31.p116==1))))) * ((i6.i1.u43.p170==1) + !((E(!(((i2.u19...895
Reverse transition relation is NOT exact ! Due to transitions t59, t76, t90, t122, t134, t158, t167, t275, i0.t140, i0.i1.t138, i2.t127, i3.i1.t104, i3.i1....514
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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,1,6.85391,176020,1,0,279464,5737,3834,504169,814,22163,694599
FORMULA FireWire-PT-16-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 310/310 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 185 transition count 263
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 185 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 77 place count 185 transition count 262
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 87 place count 175 transition count 251
Iterating global reduction 1 with 10 rules applied. Total rules applied 97 place count 175 transition count 251
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 98 place count 175 transition count 250
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 174 transition count 249
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 174 transition count 249
Applied a total of 100 rules in 8 ms. Remains 174 /223 variables (removed 49) and now considering 249/310 (removed 61) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18410986770093698135.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14006384637836610842.kers'
[2026-05-26 21:57:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18410986770093698135.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14006384637836610842.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 249 rows 174 cols 704 entries
Finished phase 1 with 170 SingleSign rule and 0 generalized
[2026-05-26 21:57:48] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14006384637836610842.kers
Total runtime 2 ms.
[2026-05-26 21:57:48] [INFO ] Implicit Places using invariants in 162 ms returned []
[2026-05-26 21:57:48] [INFO ] Invariant cache hit.
[2026-05-26 21:57:48] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2026-05-26 21:57:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Problem TDEAD230 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 4/8 constraints. Problems are: Problem set: 1 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 247 unsolved
At refinement iteration 5 (OVERLAPS) 249/423 variables, 174/184 constraints. Problems are: Problem set: 1 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 2/186 constraints. Problems are: Problem set: 1 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 247 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 423/423 variables, and 186 constraints, problems are : Problem set: 1 solved, 247 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 247 unsolved
At refinement iteration 6 (OVERLAPS) 249/423 variables, 174/192 constraints. Problems are: Problem set: 1 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 247/439 constraints. Problems are: Problem set: 1 solved, 247 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 1/440 constraints. Problems are: Problem set: 1 solved, 247 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 440 constraints, problems are : Problem set: 1 solved, 247 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 247/248 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60049ms problems are : Problem set: 1 solved, 247 unsolved
Search for dead transitions found 1 dead transitions in 60050ms
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 : 174/223 places, 248/310 transitions.
Applied a total of 0 rules in 3 ms. Remains 174 /174 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60476 ms. Remains : 174/223 places, 248/310 transitions.
[2026-05-26 21:58:48] [INFO ] Flatten gal took : 14 ms
[2026-05-26 21:58:48] [INFO ] Flatten gal took : 14 ms
[2026-05-26 21:58:48] [INFO ] Input system was already deterministic with 248 transitions.
[2026-05-26 21:58:48] [INFO ] Flatten gal took : 14 ms
[2026-05-26 21:58:48] [INFO ] Flatten gal took : 14 ms
[2026-05-26 21:58:48] [INFO ] Time to serialize gal into /tmp/CTLFireability17877440860475723150.gal : 3 ms
[2026-05-26 21:58:48] [INFO ] Time to serialize properties into /tmp/CTLFireability6267260327421017707.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/CTLFireability17877440860475723150.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6267260327421017707.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(EX(EF(((EG(((p54==1)&&(p149==1))) * (p243==0)) * ((p54==0)||(p128==0))))))
=> equivalent forward existential formula: [FwdG(((FwdU(EY(FwdU(Init,TRUE)),TRUE) * ((p54==0)||(p128==0))) * (p243==0)),((p54==1)&&(p149==1)))] != FALSE
Hit Full ! (commute/partial/dont) 231/16/17
(forward)formula 0,0,1.19235,27464,1,0,14,116786,22,5,4876,46291,14
FORMULA FireWire-PT-16-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 310/310 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 186 transition count 264
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 186 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 75 place count 186 transition count 263
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 83 place count 178 transition count 254
Iterating global reduction 1 with 8 rules applied. Total rules applied 91 place count 178 transition count 254
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 177 transition count 253
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 177 transition count 253
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 176 transition count 252
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 176 transition count 252
Applied a total of 95 rules in 8 ms. Remains 176 /223 variables (removed 47) and now considering 252/310 (removed 58) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3414197544373819008.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8143515633146483652.kers'
[2026-05-26 21:58:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3414197544373819008.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8143515633146483652.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 252 rows 176 cols 712 entries
Finished phase 1 with 172 SingleSign rule and 0 generalized
[2026-05-26 21:58:50] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8143515633146483652.kers
Total runtime 3 ms.
[2026-05-26 21:58:50] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-26 21:58:50] [INFO ] Invariant cache hit.
[2026-05-26 21:58:50] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2026-05-26 21:58:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Problem TDEAD232 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 2/12 constraints. Problems are: Problem set: 1 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 250 unsolved
At refinement iteration 6 (OVERLAPS) 252/428 variables, 176/189 constraints. Problems are: Problem set: 1 solved, 250 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 0/189 constraints. Problems are: Problem set: 1 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/428 variables, and 189 constraints, problems are : Problem set: 1 solved, 250 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 250 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 9/13 constraints. Problems are: Problem set: 1 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 252/428 variables, 176/190 constraints. Problems are: Problem set: 1 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 250/440 constraints. Problems are: Problem set: 1 solved, 250 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 2/442 constraints. Problems are: Problem set: 1 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 2/444 constraints. Problems are: Problem set: 1 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/428 variables, and 444 constraints, problems are : Problem set: 1 solved, 250 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 250/251 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60061ms problems are : Problem set: 1 solved, 250 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 : 176/223 places, 251/310 transitions.
Applied a total of 0 rules in 2 ms. Remains 176 /176 variables (removed 0) and now considering 251/251 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60480 ms. Remains : 176/223 places, 251/310 transitions.
[2026-05-26 21:59:50] [INFO ] Flatten gal took : 8 ms
[2026-05-26 21:59:50] [INFO ] Flatten gal took : 10 ms
[2026-05-26 21:59:50] [INFO ] Input system was already deterministic with 251 transitions.
[2026-05-26 21:59:50] [INFO ] Flatten gal took : 8 ms
[2026-05-26 21:59:50] [INFO ] Flatten gal took : 7 ms
[2026-05-26 21:59:50] [INFO ] Time to serialize gal into /tmp/CTLFireability16438819257164967887.gal : 2 ms
[2026-05-26 21:59:50] [INFO ] Time to serialize properties into /tmp/CTLFireability10963974857157511326.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/CTLFireability16438819257164967887.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10963974857157511326.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(AG(AF(!(((p190==1) * EF((p87==1)))))) U E(EF(((AX((p135==1)) * (p10==1)) * (p108==1))) U ((p70==1)&&(p98==1))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!(E(TRUE U !(!(EG(!(!(((p190==1) * E(TRUE U (p87==1))))))))))),E(TRUE U ((!(EX(!((p135==1)))) *...214
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t37, t42, t44, t51, t64, t67, t80, t91, t95, t97, t113, t121, t126, ...291
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,9.51932,235184,1,0,586,1.4694e+06,545,331,6627,975092,734
FORMULA FireWire-PT-16-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 310/310 transitions.
Graph (trivial) has 181 edges and 223 vertex of which 13 / 223 are part of one of the 2 SCC in 1 ms
Free SCC test removed 11 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 211 transition count 248
Reduce places removed 49 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 52 rules applied. Total rules applied 102 place count 162 transition count 245
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 107 place count 159 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 108 place count 158 transition count 243
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 108 place count 158 transition count 235
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 124 place count 150 transition count 235
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 142 place count 132 transition count 208
Iterating global reduction 4 with 18 rules applied. Total rules applied 160 place count 132 transition count 208
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 160 place count 132 transition count 203
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 170 place count 127 transition count 203
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 172 place count 125 transition count 201
Iterating global reduction 4 with 2 rules applied. Total rules applied 174 place count 125 transition count 201
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 176 place count 125 transition count 199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 177 place count 124 transition count 199
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 203 place count 111 transition count 186
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 204 place count 110 transition count 176
Iterating global reduction 6 with 1 rules applied. Total rules applied 205 place count 110 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 206 place count 110 transition count 175
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 208 place count 108 transition count 173
Applied a total of 208 rules in 42 ms. Remains 108 /223 variables (removed 115) and now considering 173/310 (removed 137) transitions.
[2026-05-26 22:00:00] [INFO ] Flow matrix only has 171 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-908051150969326251.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3630896301941539055.kers'
[2026-05-26 22:00:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-908051150969326251.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3630896301941539055.kers]
Normalized transition count is 170 out of 171 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 170 rows 108 cols 498 entries
Finished phase 1 with 104 SingleSign rule and 0 generalized
[2026-05-26 22:00:00] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3630896301941539055.kers
Total runtime 1 ms.
[2026-05-26 22:00:00] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-26 22:00:00] [INFO ] Flow matrix only has 171 transitions (discarded 2 similar events)
[2026-05-26 22:00:00] [INFO ] Invariant cache hit.
[2026-05-26 22:00:00] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-26 22:00:00] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2026-05-26 22:00:00] [INFO ] Redundant transitions in 2 ms returned []
Running 167 sub problems to find dead transitions.
[2026-05-26 22:00:00] [INFO ] Flow matrix only has 171 transitions (discarded 2 similar events)
[2026-05-26 22:00:00] [INFO ] Invariant cache hit.
[2026-05-26 22:00:00] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Problem TDEAD106 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 170/277 variables, 107/118 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 11/129 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/129 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 1/278 variables, 1/130 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/130 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 9 (OVERLAPS) 0/278 variables, 0/130 constraints. Problems are: Problem set: 1 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/279 variables, and 130 constraints, problems are : Problem set: 1 solved, 166 unsolved in 19044 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 108/108 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 7/7 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/107 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 7/11 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 170/277 variables, 107/118 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 11/129 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 166/295 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/295 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 1/278 variables, 1/296 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/296 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 9 (OVERLAPS) 0/278 variables, 0/296 constraints. Problems are: Problem set: 1 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 278/279 variables, and 296 constraints, problems are : Problem set: 1 solved, 166 unsolved in 21731 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 108/108 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 166/167 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40796ms problems are : Problem set: 1 solved, 166 unsolved
Search for dead transitions found 1 dead transitions in 40797ms
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 : 108/223 places, 172/310 transitions.
Applied a total of 0 rules in 7 ms. Remains 108 /108 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2026-05-26 22:00:41] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 41155 ms. Remains : 108/223 places, 172/310 transitions.
[2026-05-26 22:00:41] [INFO ] Flatten gal took : 4 ms
[2026-05-26 22:00:41] [INFO ] Flatten gal took : 6 ms
[2026-05-26 22:00:41] [INFO ] Input system was already deterministic with 172 transitions.
[2026-05-26 22:00:41] [INFO ] Flatten gal took : 7 ms
[2026-05-26 22:00:41] [INFO ] Flatten gal took : 7 ms
[2026-05-26 22:00:41] [INFO ] Time to serialize gal into /tmp/CTLFireability15382823615673602432.gal : 2 ms
[2026-05-26 22:00:41] [INFO ] Time to serialize properties into /tmp/CTLFireability7876587484656960009.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/CTLFireability15382823615673602432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7876587484656960009.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,106501,0.212449,7496,2,978,5,9703,6,0,603,13088,0


Converting to forward existential form...Done !
original formula: AF((!(A((p20!=1) U EF((p157==1)))) * AF(((p42==0)||(p240==0)))))
=> equivalent forward existential formula: [FwdG(Init,!((!(!((E(!(E(TRUE U (p157==1))) U (!((p20!=1)) * !(E(TRUE U (p157==1))))) + EG(!(E(TRUE U (p157==1))...206
Reverse transition relation is NOT exact ! Due to transitions t8, t16, t17, t27, t29, t40, t53, t114, t120, t122, t125, t127, t128, t137, t138, t149, t150,...280
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,12.2639,260192,1,0,820,1.52834e+06,383,593,4392,1.70314e+06,900
FORMULA FireWire-PT-16-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 310/310 transitions.
Graph (trivial) has 177 edges and 223 vertex of which 15 / 223 are part of one of the 3 SCC in 1 ms
Free SCC test removed 12 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 210 transition count 248
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 53 rules applied. Total rules applied 103 place count 161 transition count 244
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 107 place count 159 transition count 242
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 109 place count 157 transition count 242
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 109 place count 157 transition count 232
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 129 place count 147 transition count 232
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 146 place count 130 transition count 206
Iterating global reduction 4 with 17 rules applied. Total rules applied 163 place count 130 transition count 206
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 163 place count 130 transition count 202
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 171 place count 126 transition count 202
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 172 place count 125 transition count 201
Iterating global reduction 4 with 1 rules applied. Total rules applied 173 place count 125 transition count 201
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 175 place count 125 transition count 199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 176 place count 124 transition count 199
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 198 place count 113 transition count 188
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 199 place count 112 transition count 178
Iterating global reduction 6 with 1 rules applied. Total rules applied 200 place count 112 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 201 place count 112 transition count 177
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 203 place count 112 transition count 177
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 205 place count 110 transition count 175
Applied a total of 205 rules in 72 ms. Remains 110 /223 variables (removed 113) and now considering 175/310 (removed 135) transitions.
[2026-05-26 22:00:53] [INFO ] Flow matrix only has 173 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-1532968173660926535.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14213887491213285505.kers'
[2026-05-26 22:00:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1532968173660926535.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14213887491213285505.kers]
Normalized transition count is 172 out of 173 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 172 rows 110 cols 531 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-26 22:00:53] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14213887491213285505.kers
Total runtime 2 ms.
[2026-05-26 22:00:54] [INFO ] Implicit Places using invariants in 154 ms returned []
[2026-05-26 22:00:54] [INFO ] Flow matrix only has 173 transitions (discarded 2 similar events)
[2026-05-26 22:00:54] [INFO ] Invariant cache hit.
[2026-05-26 22:00:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-26 22:00:54] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
[2026-05-26 22:00:54] [INFO ] Redundant transitions in 1 ms returned []
Running 169 sub problems to find dead transitions.
[2026-05-26 22:00:54] [INFO ] Flow matrix only has 173 transitions (discarded 2 similar events)
[2026-05-26 22:00:54] [INFO ] Invariant cache hit.
[2026-05-26 22:00:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Problem TDEAD104 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 4/6 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 172/281 variables, 109/118 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 1/119 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 9 (OVERLAPS) 1/282 variables, 1/120 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 11 (OVERLAPS) 0/282 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/283 variables, and 120 constraints, problems are : Problem set: 1 solved, 168 unsolved in 20744 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 110/110 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 1/109 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 172/281 variables, 109/120 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 1/121 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 168/289 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 0/289 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 11 (OVERLAPS) 1/282 variables, 1/290 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/290 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 13 (OVERLAPS) 0/282 variables, 0/290 constraints. Problems are: Problem set: 1 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/283 variables, and 290 constraints, problems are : Problem set: 1 solved, 168 unsolved in 28032 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 110/110 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 168/169 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48802ms problems are : Problem set: 1 solved, 168 unsolved
Search for dead transitions found 1 dead transitions in 48803ms
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 : 110/223 places, 174/310 transitions.
Applied a total of 0 rules in 6 ms. Remains 110 /110 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2026-05-26 22:01:43] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 49366 ms. Remains : 110/223 places, 174/310 transitions.
[2026-05-26 22:01:43] [INFO ] Flatten gal took : 4 ms
[2026-05-26 22:01:43] [INFO ] Flatten gal took : 4 ms
[2026-05-26 22:01:43] [INFO ] Input system was already deterministic with 174 transitions.
[2026-05-26 22:01:43] [INFO ] Flatten gal took : 4 ms
[2026-05-26 22:01:43] [INFO ] Flatten gal took : 4 ms
[2026-05-26 22:01:43] [INFO ] Time to serialize gal into /tmp/CTLFireability14665156677310394944.gal : 2 ms
[2026-05-26 22:01:43] [INFO ] Time to serialize properties into /tmp/CTLFireability10162651845557205534.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/CTLFireability14665156677310394944.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10162651845557205534.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,117906,0.136065,7764,2,1276,5,10307,6,0,611,14752,0


Converting to forward existential form...Done !
original formula: E(AG(!(EG(((p70==1)&&(p96==1))))) U (((p146==1)&&(!((p22==1)&&(p181==1)))) * ((p196==1) * (!((((p54==1)&&(p140==1))||(p31==1))) + ((p15==...178
=> equivalent forward existential formula: ([(((FwdU(Init,!(E(TRUE U !(!(EG(((p70==1)&&(p96==1)))))))) * ((p146==1)&&(!((p22==1)&&(p181==1))))) * (p196==1)...374
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t13, t16, t23, t27, t29, t39, t46, t47, t115, t120, t122, t124, t126, t128, t135, t13...306
(forward)formula 0,1,0.987927,24612,1,0,327,74363,375,165,4356,76749,386
FORMULA FireWire-PT-16-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 310/310 transitions.
Graph (trivial) has 183 edges and 223 vertex of which 15 / 223 are part of one of the 3 SCC in 0 ms
Free SCC test removed 12 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 210 transition count 242
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 59 rules applied. Total rules applied 115 place count 155 transition count 238
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 118 place count 153 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 119 place count 152 transition count 237
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 119 place count 152 transition count 229
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 135 place count 144 transition count 229
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 152 place count 127 transition count 212
Iterating global reduction 4 with 17 rules applied. Total rules applied 169 place count 127 transition count 212
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 169 place count 127 transition count 207
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 179 place count 122 transition count 207
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 181 place count 120 transition count 205
Iterating global reduction 4 with 2 rules applied. Total rules applied 183 place count 120 transition count 205
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 185 place count 120 transition count 203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 186 place count 119 transition count 203
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 212 place count 106 transition count 190
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 214 place count 104 transition count 178
Iterating global reduction 6 with 2 rules applied. Total rules applied 216 place count 104 transition count 178
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 217 place count 104 transition count 178
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 219 place count 102 transition count 176
Applied a total of 219 rules in 35 ms. Remains 102 /223 variables (removed 121) and now considering 176/310 (removed 134) transitions.
[2026-05-26 22:01:44] [INFO ] Flow matrix only has 174 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-11047241881094580887.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-120263060172338390.kers'
[2026-05-26 22:01:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11047241881094580887.kers, --Pflows, --basisKERS=/tmp/petrispot-output-120263060172338390.kers]
Normalized transition count is 173 out of 174 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 173 rows 102 cols 546 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-26 22:01:44] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-120263060172338390.kers
Total runtime 3 ms.
[2026-05-26 22:01:44] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-26 22:01:44] [INFO ] Flow matrix only has 174 transitions (discarded 2 similar events)
[2026-05-26 22:01:44] [INFO ] Invariant cache hit.
[2026-05-26 22:01:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-26 22:01:44] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2026-05-26 22:01:44] [INFO ] Redundant transitions in 0 ms returned []
Running 171 sub problems to find dead transitions.
[2026-05-26 22:01:44] [INFO ] Flow matrix only has 174 transitions (discarded 2 similar events)
[2026-05-26 22:01:44] [INFO ] Invariant cache hit.
[2026-05-26 22:01:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Problem TDEAD111 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 173/274 variables, 101/112 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 1/113 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 1/114 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 1/275 variables, 1/115 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 10 (OVERLAPS) 0/275 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/276 variables, and 115 constraints, problems are : Problem set: 1 solved, 170 unsolved in 20002 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 2/14 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 173/274 variables, 101/115 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 1/116 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 170/286 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 1/287 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/287 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 9 (OVERLAPS) 1/275 variables, 1/288 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 0/288 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 11 (OVERLAPS) 0/275 variables, 0/288 constraints. Problems are: Problem set: 1 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/276 variables, and 288 constraints, problems are : Problem set: 1 solved, 170 unsolved in 25001 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 170/171 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45021ms problems are : Problem set: 1 solved, 170 unsolved
Search for dead transitions found 1 dead transitions in 45021ms
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 : 102/223 places, 175/310 transitions.
Applied a total of 0 rules in 9 ms. Remains 102 /102 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2026-05-26 22:02:29] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 45443 ms. Remains : 102/223 places, 175/310 transitions.
[2026-05-26 22:02:29] [INFO ] Flatten gal took : 4 ms
[2026-05-26 22:02:29] [INFO ] Flatten gal took : 3 ms
[2026-05-26 22:02:29] [INFO ] Input system was already deterministic with 175 transitions.
[2026-05-26 22:02:29] [INFO ] Flatten gal took : 3 ms
[2026-05-26 22:02:29] [INFO ] Flatten gal took : 3 ms
[2026-05-26 22:02:29] [INFO ] Time to serialize gal into /tmp/CTLFireability16099703610670029033.gal : 2 ms
[2026-05-26 22:02:29] [INFO ] Time to serialize properties into /tmp/CTLFireability16757306459885327707.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/CTLFireability16099703610670029033.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16757306459885327707.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,90511,0.114505,7216,2,902,5,8309,6,0,581,11501,0


Converting to forward existential form...Done !
original formula: AG(EF((((p62==1)&&(p122==1))||((p63==1)&&(p130==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((p62==1)&&(p122==1))||((p63==1)&&(p130==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t22, t24, t42, t48, t123, t125, t127, t128, t133, t139, t140, t151, t152, t153, t157, t16...270
(forward)formula 0,0,4.17256,96708,1,0,329,575308,368,178,4103,323457,415
FORMULA FireWire-PT-16-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 310/310 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 185 transition count 263
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 185 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 77 place count 185 transition count 262
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 87 place count 175 transition count 251
Iterating global reduction 1 with 10 rules applied. Total rules applied 97 place count 175 transition count 251
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 98 place count 175 transition count 250
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 174 transition count 249
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 174 transition count 249
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 173 transition count 248
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 173 transition count 248
Applied a total of 102 rules in 8 ms. Remains 173 /223 variables (removed 50) and now considering 248/310 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10364200507932158388.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16266857589913014318.kers'
[2026-05-26 22:02:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10364200507932158388.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16266857589913014318.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 173 cols 702 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-26 22:02:33] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16266857589913014318.kers
Total runtime 3 ms.
[2026-05-26 22:02:34] [INFO ] Implicit Places using invariants in 182 ms returned []
[2026-05-26 22:02:34] [INFO ] Invariant cache hit.
[2026-05-26 22:02:34] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2026-05-26 22:02:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Problem TDEAD229 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 4/8 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 5 (OVERLAPS) 248/421 variables, 173/183 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 2/185 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 0/185 constraints. Problems are: Problem set: 1 solved, 246 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/421 variables, and 185 constraints, problems are : Problem set: 1 solved, 246 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 8/8 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/172 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 4 (OVERLAPS) 248/421 variables, 173/185 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 246/431 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 3/434 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 1/435 constraints. Problems are: Problem set: 1 solved, 246 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/421 variables, and 435 constraints, problems are : Problem set: 1 solved, 246 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 246/247 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60047ms problems are : Problem set: 1 solved, 246 unsolved
Search for dead transitions found 1 dead transitions in 60049ms
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 : 173/223 places, 247/310 transitions.
Applied a total of 0 rules in 2 ms. Remains 173 /173 variables (removed 0) and now considering 247/247 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60583 ms. Remains : 173/223 places, 247/310 transitions.
[2026-05-26 22:03:34] [INFO ] Flatten gal took : 8 ms
[2026-05-26 22:03:34] [INFO ] Flatten gal took : 7 ms
[2026-05-26 22:03:34] [INFO ] Input system was already deterministic with 247 transitions.
[2026-05-26 22:03:34] [INFO ] Flatten gal took : 8 ms
[2026-05-26 22:03:34] [INFO ] Flatten gal took : 11 ms
[2026-05-26 22:03:34] [INFO ] Time to serialize gal into /tmp/CTLFireability2404336976907604250.gal : 3 ms
[2026-05-26 22:03:34] [INFO ] Time to serialize properties into /tmp/CTLFireability7890289972636216659.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/CTLFireability2404336976907604250.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7890289972636216659.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX(EF(((p50==1)&&(p192==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((p50==1)&&(p192==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t37, t42, t50, t63, t66, t79, t88, t92, t94, t110, t118, t123, t124,...292
(forward)formula 0,1,7.95006,186100,1,0,441,1.1535e+06,515,253,6124,720418,579
FORMULA FireWire-PT-16-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 310/310 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 189 transition count 276
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 189 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 69 place count 189 transition count 275
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 78 place count 180 transition count 265
Iterating global reduction 1 with 9 rules applied. Total rules applied 87 place count 180 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 88 place count 180 transition count 264
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 179 transition count 263
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 179 transition count 263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 178 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 178 transition count 262
Applied a total of 92 rules in 8 ms. Remains 178 /223 variables (removed 45) and now considering 262/310 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12057324728327058105.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18218336182743450872.kers'
[2026-05-26 22:03:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12057324728327058105.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18218336182743450872.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 262 rows 178 cols 750 entries
Finished phase 1 with 174 SingleSign rule and 0 generalized
[2026-05-26 22:03:42] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18218336182743450872.kers
Total runtime 2 ms.
[2026-05-26 22:03:42] [INFO ] Implicit Places using invariants in 127 ms returned []
[2026-05-26 22:03:42] [INFO ] Invariant cache hit.
[2026-05-26 22:03:43] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2026-05-26 22:03:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Problem TDEAD243 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 4/8 constraints. Problems are: Problem set: 1 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 262/440 variables, 178/188 constraints. Problems are: Problem set: 1 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 3/191 constraints. Problems are: Problem set: 1 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 1/192 constraints. Problems are: Problem set: 1 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 440/440 variables, and 192 constraints, problems are : Problem set: 1 solved, 260 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 10/14 constraints. Problems are: Problem set: 1 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 6/20 constraints. Problems are: Problem set: 1 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 262/440 variables, 178/198 constraints. Problems are: Problem set: 1 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 260/458 constraints. Problems are: Problem set: 1 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 0/458 constraints. Problems are: Problem set: 1 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 0/440 variables, 1/459 constraints. Problems are: Problem set: 1 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 459 constraints, problems are : Problem set: 1 solved, 260 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 260/261 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60077ms problems are : Problem set: 1 solved, 260 unsolved
Search for dead transitions found 1 dead transitions in 60078ms
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/223 places, 261/310 transitions.
Applied a total of 0 rules in 3 ms. Remains 178 /178 variables (removed 0) and now considering 261/261 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60478 ms. Remains : 178/223 places, 261/310 transitions.
[2026-05-26 22:04:43] [INFO ] Flatten gal took : 8 ms
[2026-05-26 22:04:43] [INFO ] Flatten gal took : 8 ms
[2026-05-26 22:04:43] [INFO ] Input system was already deterministic with 261 transitions.
[2026-05-26 22:04:43] [INFO ] Flatten gal took : 8 ms
[2026-05-26 22:04:43] [INFO ] Flatten gal took : 8 ms
[2026-05-26 22:04:43] [INFO ] Time to serialize gal into /tmp/CTLFireability13478843472598711118.gal : 3 ms
[2026-05-26 22:04:43] [INFO ] Time to serialize properties into /tmp/CTLFireability15844901485126780743.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/CTLFireability13478843472598711118.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15844901485126780743.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG((((!(A(EG(AX((p16==1))) U EX(EG((p42==1))))) * EX(((p70!=1)||(p176!=1)))) * (EF(((p49!=1)||(p125!=1))) * EX((p120!=1)))) * AX((p107!=1...159
=> equivalent forward existential formula: ((([((FwdU(Init,TRUE) * !(EG(!(EX(EG((p42==1))))))) * !(E(!(EX(EG((p42==1)))) U (!(EG(!(EX(!((p16==1)))))) * !(E...415
(forward)formula 0,0,0.472707,11104,1,0,9,19332,9,2,1650,25709,2
FORMULA FireWire-PT-16-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 310/310 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 193 transition count 280
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 193 transition count 280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 193 transition count 279
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 69 place count 185 transition count 270
Iterating global reduction 1 with 8 rules applied. Total rules applied 77 place count 185 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 185 transition count 269
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 184 transition count 268
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 184 transition count 268
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 183 transition count 267
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 183 transition count 267
Applied a total of 82 rules in 13 ms. Remains 183 /223 variables (removed 40) and now considering 267/310 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6234468295972149327.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18381291274907479309.kers'
[2026-05-26 22:04:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6234468295972149327.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18381291274907479309.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 267 rows 183 cols 764 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-05-26 22:04:43] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18381291274907479309.kers
Total runtime 3 ms.
[2026-05-26 22:04:43] [INFO ] Implicit Places using invariants in 194 ms returned []
[2026-05-26 22:04:43] [INFO ] Invariant cache hit.
[2026-05-26 22:04:44] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2026-05-26 22:04:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Problem TDEAD246 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 265 unsolved
At refinement iteration 5 (OVERLAPS) 267/450 variables, 183/194 constraints. Problems are: Problem set: 1 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 0/194 constraints. Problems are: Problem set: 1 solved, 265 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 450/450 variables, and 194 constraints, problems are : Problem set: 1 solved, 265 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 7/11 constraints. Problems are: Problem set: 1 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 3/14 constraints. Problems are: Problem set: 1 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 5/19 constraints. Problems are: Problem set: 1 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 267/450 variables, 183/202 constraints. Problems are: Problem set: 1 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 265/467 constraints. Problems are: Problem set: 1 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 1/468 constraints. Problems are: Problem set: 1 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 468 constraints, problems are : Problem set: 1 solved, 265 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 265/266 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60064ms problems are : Problem set: 1 solved, 265 unsolved
Search for dead transitions found 1 dead transitions in 60065ms
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 : 183/223 places, 266/310 transitions.
Applied a total of 0 rules in 2 ms. Remains 183 /183 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60643 ms. Remains : 183/223 places, 266/310 transitions.
[2026-05-26 22:05:44] [INFO ] Flatten gal took : 8 ms
[2026-05-26 22:05:44] [INFO ] Flatten gal took : 9 ms
[2026-05-26 22:05:44] [INFO ] Input system was already deterministic with 266 transitions.
[2026-05-26 22:05:44] [INFO ] Flatten gal took : 9 ms
[2026-05-26 22:05:44] [INFO ] Flatten gal took : 9 ms
[2026-05-26 22:05:44] [INFO ] Time to serialize gal into /tmp/CTLFireability5024837695387122796.gal : 3 ms
[2026-05-26 22:05:44] [INFO ] Time to serialize properties into /tmp/CTLFireability13991354379726549063.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/CTLFireability5024837695387122796.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13991354379726549063.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: A(!(((!((((p134==1)||(p95==1)) * A(((p147==1)&&(p215==1)) U ((p106==1)&&(p199==1))))) + !(((p139!=1) * AG((p148==1))))) + ((p4!=1) + !(((...308
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (!((E(!((!(EX(!((p153==1)))) + !(EG(!(((p50==1)&&(p125==1))))))) U (!(!(E(TRUE U !((p9...1442
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t31, t32, t37, t43, t46, t48, t52, t55, t66, t70, t83, t84, t95, t98, t10...330
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-05-26 22:06:14] [INFO ] Flatten gal took : 5 ms
[2026-05-26 22:06:14] [INFO ] Applying decomposition
[2026-05-26 22:06:14] [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/graph4479929330795358519.txt' '-o' '/tmp/graph4479929330795358519.bin' '-w' '/tmp/graph4479929330795358519.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4479929330795358519.bin' '-l' '-1' '-v' '-w' '/tmp/graph4479929330795358519.weights' '-q' '0' '-e' '0.001'
[2026-05-26 22:06:14] [INFO ] Decomposing Gal with order
[2026-05-26 22:06:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 22:06:14] [INFO ] Removed a total of 185 redundant transitions.
[2026-05-26 22:06:14] [INFO ] Flatten gal took : 18 ms
[2026-05-26 22:06:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 7 ms.
[2026-05-26 22:06:14] [INFO ] Time to serialize gal into /tmp/CTLFireability15773545489658388143.gal : 4 ms
[2026-05-26 22:06:14] [INFO ] Time to serialize properties into /tmp/CTLFireability11259691947473951584.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/CTLFireability15773545489658388143.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11259691947473951584.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.74397e+06,0.24365,10924,450,223,7793,9262,623,12653,169,28227,0


Converting to forward existential form...Done !
original formula: A(!(((!((((i7.u33.p134==1)||(i5.i0.u22.p95==1)) * A(((i8.i0.u36.p147==1)&&(i10.i0.u51.p215==1)) U ((i9.i0.u25.p106==1)&&(i9.i1.u46.p199==...476
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (!((E(!((!(EX(!((i7.u43.p153==1)))) + !(EG(!(((i6.i1.u12.p50==1)&&(i6.i1.u30.p125==1))...2058
Reverse transition relation is NOT exact ! Due to transitions t84, t129, t130, t145, t154, t254, t258, t262, i0.u32.t98, i2.u1.t143, i3.t124, i4.t117, i5.i...472
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,1,3.08891,85424,1,0,121658,22348,3710,276840,1023,55477,237388
FORMULA FireWire-PT-16-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 310/310 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 189 transition count 267
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 189 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 69 place count 189 transition count 266
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 76 place count 182 transition count 259
Iterating global reduction 1 with 7 rules applied. Total rules applied 83 place count 182 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 182 transition count 258
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 181 transition count 257
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 181 transition count 257
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 180 transition count 256
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 180 transition count 256
Applied a total of 88 rules in 8 ms. Remains 180 /223 variables (removed 43) and now considering 256/310 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-869023793943233560.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10700788617518348139.kers'
[2026-05-26 22:06:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-869023793943233560.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10700788617518348139.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 256 rows 180 cols 718 entries
Finished phase 1 with 176 SingleSign rule and 0 generalized
[2026-05-26 22:06:17] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10700788617518348139.kers
Total runtime 2 ms.
[2026-05-26 22:06:17] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-26 22:06:17] [INFO ] Invariant cache hit.
[2026-05-26 22:06:18] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2026-05-26 22:06:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Problem TDEAD237 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 9/13 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 256/436 variables, 180/193 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 1/194 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/194 constraints. Problems are: Problem set: 1 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 436/436 variables, and 194 constraints, problems are : Problem set: 1 solved, 254 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 10/14 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 2/16 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 1/17 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 6 (OVERLAPS) 256/436 variables, 180/197 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 254/451 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 2/453 constraints. Problems are: Problem set: 1 solved, 254 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/436 variables, and 453 constraints, problems are : Problem set: 1 solved, 254 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 254/255 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60064ms problems are : Problem set: 1 solved, 254 unsolved
Search for dead transitions found 1 dead transitions in 60066ms
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 : 180/223 places, 255/310 transitions.
Applied a total of 0 rules in 3 ms. Remains 180 /180 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60503 ms. Remains : 180/223 places, 255/310 transitions.
[2026-05-26 22:07:18] [INFO ] Flatten gal took : 9 ms
[2026-05-26 22:07:18] [INFO ] Flatten gal took : 9 ms
[2026-05-26 22:07:18] [INFO ] Input system was already deterministic with 255 transitions.
[2026-05-26 22:07:18] [INFO ] Flatten gal took : 8 ms
[2026-05-26 22:07:18] [INFO ] Flatten gal took : 8 ms
[2026-05-26 22:07:18] [INFO ] Time to serialize gal into /tmp/CTLFireability1180413521546999522.gal : 3 ms
[2026-05-26 22:07:18] [INFO ] Time to serialize properties into /tmp/CTLFireability17680497028678485773.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/CTLFireability1180413521546999522.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17680497028678485773.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (E(EG(!(A((p209!=1) U ((p71==1)&&(p181==1))))) U EX((A((p138!=1) U AF((p8==1))) + AG(((p189==1)||(p29==1)))))) * E(A(EG(AX((p162==1))) U ...182
=> equivalent forward existential formula: [(FwdU(FwdU((Init * E(EG(!(!((E(!(((p71==1)&&(p181==1))) U (!((p209!=1)) * !(((p71==1)&&(p181==1))))) + EG(!(((p...440
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t36, t37, t42, t45, t53, t54, t55, t69, t72, t85, t94, t98, t100, t1...307
Detected timeout of ITS tools.
[2026-05-26 22:07:48] [INFO ] Flatten gal took : 5 ms
[2026-05-26 22:07:48] [INFO ] Applying decomposition
[2026-05-26 22:07:48] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1702247291850609444.txt' '-o' '/tmp/graph1702247291850609444.bin' '-w' '/tmp/graph1702247291850609444.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1702247291850609444.bin' '-l' '-1' '-v' '-w' '/tmp/graph1702247291850609444.weights' '-q' '0' '-e' '0.001'
[2026-05-26 22:07:48] [INFO ] Decomposing Gal with order
[2026-05-26 22:07:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 22:07:48] [INFO ] Removed a total of 164 redundant transitions.
[2026-05-26 22:07:48] [INFO ] Flatten gal took : 33 ms
[2026-05-26 22:07:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2026-05-26 22:07:48] [INFO ] Time to serialize gal into /tmp/CTLFireability14654483511566899694.gal : 3 ms
[2026-05-26 22:07:48] [INFO ] Time to serialize properties into /tmp/CTLFireability3672553666312568036.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/CTLFireability14654483511566899694.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3672553666312568036.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.64885e+06,0.37563,11492,449,198,8380,9211,616,13457,148,34194,0


Converting to forward existential form...Done !
original formula: (E(EG(!(A((i10.i1.u47.p209!=1) U ((i3.u17.p71==1)&&(i3.u17.p181==1))))) U EX((A((i8.u32.p138!=1) U AF((i1.u3.p8==1))) + AG(((i8.u41.p189=...261
=> equivalent forward existential formula: [(FwdU(FwdU((Init * E(EG(!(!((E(!(((i3.u17.p71==1)&&(i3.u17.p181==1))) U (!((i10.i1.u47.p209!=1)) * !(((i3.u17.p...581
Reverse transition relation is NOT exact ! Due to transitions t42, t131, t132, t147, t155, t244, t251, i1.t146, i2.t124, i6.u26.t85, i7.u13.t116, i7.u30.t9...439
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 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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
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 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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
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
(forward)formula 0,0,10.0582,258960,1,0,426156,14961,3871,760361,937,50826,802021
FORMULA FireWire-PT-16-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 310/310 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 187 transition count 265
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 187 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 73 place count 187 transition count 264
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 83 place count 177 transition count 253
Iterating global reduction 1 with 10 rules applied. Total rules applied 93 place count 177 transition count 253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 94 place count 177 transition count 252
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 176 transition count 251
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 176 transition count 251
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 175 transition count 250
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 175 transition count 250
Applied a total of 98 rules in 10 ms. Remains 175 /223 variables (removed 48) and now considering 250/310 (removed 60) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6546203273953625592.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16176051765317313067.kers'
[2026-05-26 22:07:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6546203273953625592.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16176051765317313067.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 250 rows 175 cols 706 entries
Finished phase 1 with 171 SingleSign rule and 0 generalized
[2026-05-26 22:07:58] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16176051765317313067.kers
Total runtime 2 ms.
[2026-05-26 22:07:58] [INFO ] Implicit Places using invariants in 192 ms returned []
[2026-05-26 22:07:58] [INFO ] Invariant cache hit.
[2026-05-26 22:07:59] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2026-05-26 22:07:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Problem TDEAD231 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 5 (OVERLAPS) 250/425 variables, 175/184 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 2/186 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 248 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 425/425 variables, and 186 constraints, problems are : Problem set: 1 solved, 248 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 7/11 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 2/13 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 5 (OVERLAPS) 250/425 variables, 175/188 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 248/436 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 1/437 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 1/438 constraints. Problems are: Problem set: 1 solved, 248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/425 variables, and 438 constraints, problems are : Problem set: 1 solved, 248 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 248/249 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60070ms problems are : Problem set: 1 solved, 248 unsolved
Search for dead transitions found 1 dead transitions in 60071ms
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 : 175/223 places, 249/310 transitions.
Applied a total of 0 rules in 2 ms. Remains 175 /175 variables (removed 0) and now considering 249/249 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60620 ms. Remains : 175/223 places, 249/310 transitions.
[2026-05-26 22:08:59] [INFO ] Flatten gal took : 8 ms
[2026-05-26 22:08:59] [INFO ] Flatten gal took : 7 ms
[2026-05-26 22:08:59] [INFO ] Input system was already deterministic with 249 transitions.
[2026-05-26 22:08:59] [INFO ] Flatten gal took : 7 ms
[2026-05-26 22:08:59] [INFO ] Flatten gal took : 7 ms
[2026-05-26 22:08:59] [INFO ] Time to serialize gal into /tmp/CTLFireability1806241544015299500.gal : 3 ms
[2026-05-26 22:08:59] [INFO ] Time to serialize properties into /tmp/CTLFireability18395935658759094472.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/CTLFireability1806241544015299500.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18395935658759094472.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: !(A((AF((p221==1)) + (p117==1)) U EF((EX(EX((p171==1))) * (p139!=1)))))
=> equivalent forward existential formula: ([((FwdU(Init,!(E(TRUE U (EX(EX((p171==1))) * (p139!=1))))) * !((!(EG(!((p221==1)))) + (p117==1)))) * !(E(TRUE U...270
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t36, t37, t42, t46, t51, t64, t67, t80, t81, t90, t94, t96, t112, t1...295
(forward)formula 0,0,22.5246,507020,1,0,881,3.3759e+06,537,459,6289,2.74118e+06,1053
FORMULA FireWire-PT-16-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

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

BK_STOP 1779833361980

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

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