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.r066-tall-177946967700346.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 CO4-PT-09, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700346
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 4.9K Mar 6 13:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Mar 6 13:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 13:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 6 13:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 6 13:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Mar 6 13:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Mar 6 13:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Mar 6 13:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:30 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 152K 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 CO4-PT-09-CTLFireability-2024-00
FORMULA_NAME CO4-PT-09-CTLFireability-2024-01
FORMULA_NAME CO4-PT-09-CTLFireability-2024-02
FORMULA_NAME CO4-PT-09-CTLFireability-2024-03
FORMULA_NAME CO4-PT-09-CTLFireability-2024-04
FORMULA_NAME CO4-PT-09-CTLFireability-2024-05
FORMULA_NAME CO4-PT-09-CTLFireability-2024-06
FORMULA_NAME CO4-PT-09-CTLFireability-2024-07
FORMULA_NAME CO4-PT-09-CTLFireability-2024-08
FORMULA_NAME CO4-PT-09-CTLFireability-2024-09
FORMULA_NAME CO4-PT-09-CTLFireability-2024-10
FORMULA_NAME CO4-PT-09-CTLFireability-2024-11
FORMULA_NAME CO4-PT-09-CTLFireability-2024-12
FORMULA_NAME CO4-PT-09-CTLFireability-2024-13
FORMULA_NAME CO4-PT-09-CTLFireability-2024-14
FORMULA_NAME CO4-PT-09-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779522027306

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 07:40:28] [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-23 07:40:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 07:40:28] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2026-05-23 07:40:28] [INFO ] Transformed 467 places.
[2026-05-23 07:40:28] [INFO ] Transformed 634 transitions.
[2026-05-23 07:40:28] [INFO ] Found NUPN structural information;
[2026-05-23 07:40:28] [INFO ] Parsed PT model containing 467 places and 634 transitions and 1868 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Deduced a syphon composed of 108 places in 7 ms
Reduce places removed 108 places and 163 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA CO4-PT-09-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 471/471 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 346 transition count 469
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 86 place count 275 transition count 396
Iterating global reduction 1 with 71 rules applied. Total rules applied 157 place count 275 transition count 396
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 160 place count 275 transition count 393
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 192 place count 243 transition count 351
Iterating global reduction 2 with 32 rules applied. Total rules applied 224 place count 243 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 225 place count 243 transition count 350
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 230 place count 238 transition count 341
Iterating global reduction 3 with 5 rules applied. Total rules applied 235 place count 238 transition count 341
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 239 place count 234 transition count 337
Iterating global reduction 3 with 4 rules applied. Total rules applied 243 place count 234 transition count 337
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 246 place count 231 transition count 334
Iterating global reduction 3 with 3 rules applied. Total rules applied 249 place count 231 transition count 334
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 252 place count 231 transition count 331
Applied a total of 252 rules in 85 ms. Remains 231 /359 variables (removed 128) and now considering 331/471 (removed 140) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10891169944243025402.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7303130200641478196.kers'
[2026-05-23 07:40:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10891169944243025402.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7303130200641478196.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 331 rows 231 cols 986 entries
Finished phase 1 with 225 SingleSign rule and 0 generalized
[2026-05-23 07:40:28] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7303130200641478196.kers
Total runtime 2 ms.
[2026-05-23 07:40:29] [INFO ] Implicit Places using invariants in 299 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 344 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 230/359 places, 331/471 transitions.
Applied a total of 0 rules in 5 ms. Remains 230 /230 variables (removed 0) and now considering 331/331 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 446 ms. Remains : 230/359 places, 331/471 transitions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 331/331 transitions.
Applied a total of 0 rules in 4 ms. Remains 230 /230 variables (removed 0) and now considering 331/331 (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-5493385474740803919.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2504061266740471272.kers'
[2026-05-23 07:40:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5493385474740803919.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2504061266740471272.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 331 rows 230 cols 984 entries
Finished phase 1 with 225 SingleSign rule and 0 generalized
[2026-05-23 07:40:29] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2504061266740471272.kers
Total runtime 1 ms.
[2026-05-23 07:40:29] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-23 07:40:29] [INFO ] Invariant cache hit.
[2026-05-23 07:40:29] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 330 sub problems to find dead transitions.
[2026-05-23 07:40:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 11/16 constraints. Problems are: Problem set: 10 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/16 constraints. Problems are: Problem set: 10 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 331/561 variables, 230/246 constraints. Problems are: Problem set: 10 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 0/246 constraints. Problems are: Problem set: 10 solved, 320 unsolved
At refinement iteration 6 (OVERLAPS) 0/561 variables, 0/246 constraints. Problems are: Problem set: 10 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 561/561 variables, and 246 constraints, problems are : Problem set: 10 solved, 320 unsolved in 25414 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 5/5 constraints. Problems are: Problem set: 10 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 11/16 constraints. Problems are: Problem set: 10 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/16 constraints. Problems are: Problem set: 10 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 331/561 variables, 230/246 constraints. Problems are: Problem set: 10 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 320/566 constraints. Problems are: Problem set: 10 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 1/567 constraints. Problems are: Problem set: 10 solved, 320 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/561 variables, and 567 constraints, problems are : Problem set: 10 solved, 320 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 320/330 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55599ms problems are : Problem set: 10 solved, 320 unsolved
Search for dead transitions found 10 dead transitions in 55616ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in LTL mode, iteration 1 : 230/230 places, 321/331 transitions.
Applied a total of 0 rules in 3 ms. Remains 230 /230 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55892 ms. Remains : 230/230 places, 321/331 transitions.
Support contains 50 out of 230 places after structural reductions.
[2026-05-23 07:41:25] [INFO ] Flatten gal took : 49 ms
[2026-05-23 07:41:25] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CO4-PT-09-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 07:41:25] [INFO ] Flatten gal took : 21 ms
[2026-05-23 07:41:25] [INFO ] Input system was already deterministic with 321 transitions.
Support contains 41 out of 230 places (down from 50) after GAL structural reductions.
RANDOM walk for 40000 steps (233 resets) in 2166 ms. (18 steps per ms) remains 18/26 properties
BEST_FIRST walk for 4003 steps (19 resets) in 58 ms. (67 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4003 steps (30 resets) in 45 ms. (87 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (29 resets) in 38 ms. (102 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (19 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (31 resets) in 30 ms. (129 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4003 steps (29 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (31 resets) in 29 ms. (133 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4003 steps (29 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (34 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (24 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (27 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (29 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (29 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (28 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (31 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (29 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (30 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8689756977121676768.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7750013079691574964.kers'
[2026-05-23 07:41:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8689756977121676768.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7750013079691574964.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 321 rows 230 cols 924 entries
Finished phase 1 with 225 SingleSign rule and 0 generalized
[2026-05-23 07:41:26] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7750013079691574964.kers
Total runtime 1 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 26/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 3/52 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 133/185 variables, 52/57 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 225/410 variables, 89/146 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 120/530 variables, 75/221 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 17/547 variables, 12/233 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/547 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 4/551 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/551 variables, 1/236 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/551 variables, 0/236 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 0/551 variables, 0/236 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 236 constraints, problems are : Problem set: 1 solved, 14 unsolved in 1283 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 26/49 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 3/52 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 133/185 variables, 52/60 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 225/410 variables, 89/149 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 14/163 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 120/530 variables, 75/238 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/530 variables, 0/238 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 17/547 variables, 12/250 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/547 variables, 0/250 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 4/551 variables, 2/252 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/551 variables, 0/252 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 18 (OVERLAPS) 0/551 variables, 0/252 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 252 constraints, problems are : Problem set: 1 solved, 14 unsolved in 3373 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 14/15 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4672ms problems are : Problem set: 1 solved, 14 unsolved
Parikh walk visited 12 properties in 5245 ms.
Support contains 2 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 321/321 transitions.
Graph (trivial) has 232 edges and 230 vertex of which 2 / 230 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 528 edges and 229 vertex of which 211 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 91 rules applied. Total rules applied 93 place count 211 transition count 210
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 173 place count 133 transition count 208
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 173 place count 133 transition count 191
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 207 place count 116 transition count 191
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 220 place count 103 transition count 174
Iterating global reduction 2 with 13 rules applied. Total rules applied 233 place count 103 transition count 174
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 236 place count 103 transition count 171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 236 place count 103 transition count 170
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 238 place count 102 transition count 170
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 241 place count 99 transition count 165
Iterating global reduction 3 with 3 rules applied. Total rules applied 244 place count 99 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 245 place count 99 transition count 164
Performed 32 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 309 place count 67 transition count 126
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 4 with 8 rules applied. Total rules applied 317 place count 67 transition count 118
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 321 place count 65 transition count 116
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 325 place count 63 transition count 114
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 219 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 3 rules applied. Total rules applied 328 place count 62 transition count 112
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 358 place count 47 transition count 130
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 7 with 36 rules applied. Total rules applied 394 place count 47 transition count 94
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 406 place count 35 transition count 70
Iterating global reduction 8 with 12 rules applied. Total rules applied 418 place count 35 transition count 70
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 427 place count 35 transition count 61
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 428 place count 34 transition count 57
Iterating global reduction 9 with 1 rules applied. Total rules applied 429 place count 34 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 430 place count 34 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 434 place count 34 transition count 52
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 435 place count 33 transition count 50
Iterating global reduction 10 with 1 rules applied. Total rules applied 436 place count 33 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 437 place count 33 transition count 49
Free-agglomeration rule applied 7 times.
Iterating global reduction 11 with 7 rules applied. Total rules applied 444 place count 33 transition count 42
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 452 place count 26 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 453 place count 25 transition count 40
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 456 place count 23 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 458 place count 23 transition count 37
Free-agglomeration rule applied 3 times.
Iterating global reduction 13 with 3 rules applied. Total rules applied 461 place count 23 transition count 34
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 466 place count 20 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 468 place count 20 transition count 30
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 469 place count 20 transition count 29
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 472 place count 19 transition count 27
Applied a total of 472 rules in 60 ms. Remains 19 /230 variables (removed 211) and now considering 27/321 (removed 294) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 19/230 places, 27/321 transitions.
RANDOM walk for 216 steps (0 resets) in 5 ms. (36 steps per ms) remains 0/2 properties
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
[2026-05-23 07:41:36] [INFO ] Flatten gal took : 15 ms
[2026-05-23 07:41:36] [INFO ] Flatten gal took : 15 ms
[2026-05-23 07:41:36] [INFO ] Input system was already deterministic with 321 transitions.
Computed a total of 21 stabilizing places and 27 stable transitions
Graph (complete) has 530 edges and 230 vertex of which 225 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 321/321 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 211 transition count 299
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 211 transition count 299
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 211 transition count 296
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 205 transition count 289
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 205 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 204 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 204 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 204 transition count 287
Applied a total of 56 rules in 11 ms. Remains 204 /230 variables (removed 26) and now considering 287/321 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6247516569688449150.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13906978108216589917.kers'
[2026-05-23 07:41:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6247516569688449150.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13906978108216589917.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 287 rows 204 cols 830 entries
Finished phase 1 with 199 SingleSign rule and 0 generalized
[2026-05-23 07:41:36] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13906978108216589917.kers
Total runtime 2 ms.
[2026-05-23 07:41:36] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-23 07:41:36] [INFO ] Invariant cache hit.
[2026-05-23 07:41:36] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2026-05-23 07:41:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (OVERLAPS) 287/491 variables, 204/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 0/491 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 491/491 variables, and 215 constraints, problems are : Problem set: 0 solved, 286 unsolved in 20336 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 287/491 variables, 204/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 286/501 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/491 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 491/491 variables, and 502 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 50425ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 50427ms
Starting structural reductions in LTL mode, iteration 1 : 204/230 places, 287/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50612 ms. Remains : 204/230 places, 287/321 transitions.
[2026-05-23 07:42:26] [INFO ] Flatten gal took : 12 ms
[2026-05-23 07:42:26] [INFO ] Flatten gal took : 12 ms
[2026-05-23 07:42:26] [INFO ] Input system was already deterministic with 287 transitions.
[2026-05-23 07:42:26] [INFO ] Flatten gal took : 12 ms
[2026-05-23 07:42:26] [INFO ] Flatten gal took : 12 ms
[2026-05-23 07:42:26] [INFO ] Time to serialize gal into /tmp/CTLFireability2230127238568725418.gal : 5 ms
[2026-05-23 07:42:26] [INFO ] Time to serialize properties into /tmp/CTLFireability16123762074320934537.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2230127238568725418.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16123762074320934537.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.15504e+07,0.234379,13660,2,2913,5,32250,6,0,1099,37282,0


Converting to forward existential form...Done !
original formula: EX(AF(EG((((p244==1)&&(p115==0))&&(((p95==0)||(p302==0))||(p453==0))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(EG((((p244==1)&&(p115==0))&&(((p95==0)||(p302==0))||(p453==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t50, t59, t64, t65, ...363
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-05-23 07:42:57] [INFO ] Flatten gal took : 14 ms
[2026-05-23 07:42:57] [INFO ] Applying decomposition
[2026-05-23 07:42:57] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15550599504786017634.txt' '-o' '/tmp/graph15550599504786017634.bin' '-w' '/tmp/graph15550599504786017634.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15550599504786017634.bin' '-l' '-1' '-v' '-w' '/tmp/graph15550599504786017634.weights' '-q' '0' '-e' '0.001'
[2026-05-23 07:42:57] [INFO ] Decomposing Gal with order
[2026-05-23 07:42:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 07:42:57] [INFO ] Removed a total of 187 redundant transitions.
[2026-05-23 07:42:57] [INFO ] Flatten gal took : 63 ms
[2026-05-23 07:42:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 17 ms.
[2026-05-23 07:42:57] [INFO ] Time to serialize gal into /tmp/CTLFireability4316201207750279408.gal : 14 ms
[2026-05-23 07:42:57] [INFO ] Time to serialize properties into /tmp/CTLFireability14341417116694556212.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/CTLFireability4316201207750279408.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14341417116694556212.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.15504e+07,0.135054,9144,656,159,8143,848,594,22807,115,3764,0


Converting to forward existential form...Done !
original formula: EX(AF(EG((((i8.i0.u32.p244==1)&&(i3.u10.p115==0))&&(((i1.u4.p95==0)||(i11.i1.u44.p302==0))||(i12.u62.p453==0))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(EG((((i8.i0.u32.p244==1)&&(i3.u10.p115==0))&&(((i1.u4.p95==0)||(i11.i1.u44.p302==0))||(i12.u...183
Reverse transition relation is NOT exact ! Due to transitions t12, t77, t179, t206, t238, t266, i0.t4, i0.u63.t8, i0.u63.t9, i0.u64.t3, i0.u64.t5, i0.u64.t...550
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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 13
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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 13
(forward)formula 0,0,11.2697,369728,1,0,492627,2258,3241,2.28831e+06,560,16812,469556
FORMULA CO4-PT-09-CTLFireability-2024-00 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 : 230/230 places, 321/321 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 211 transition count 298
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 211 transition count 298
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 211 transition count 295
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 205 transition count 289
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 205 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 204 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 204 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 204 transition count 287
Applied a total of 56 rules in 15 ms. Remains 204 /230 variables (removed 26) and now considering 287/321 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2615664115316346723.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17738229206330205196.kers'
[2026-05-23 07:43:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2615664115316346723.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17738229206330205196.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 287 rows 204 cols 830 entries
Finished phase 1 with 199 SingleSign rule and 0 generalized
[2026-05-23 07:43:08] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17738229206330205196.kers
Total runtime 1 ms.
[2026-05-23 07:43:08] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-23 07:43:08] [INFO ] Invariant cache hit.
[2026-05-23 07:43:08] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 204/230 places, 287/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 243 ms. Remains : 204/230 places, 287/321 transitions.
[2026-05-23 07:43:08] [INFO ] Flatten gal took : 11 ms
[2026-05-23 07:43:08] [INFO ] Flatten gal took : 9 ms
[2026-05-23 07:43:08] [INFO ] Input system was already deterministic with 287 transitions.
[2026-05-23 07:43:08] [INFO ] Flatten gal took : 8 ms
[2026-05-23 07:43:08] [INFO ] Flatten gal took : 17 ms
[2026-05-23 07:43:08] [INFO ] Time to serialize gal into /tmp/CTLFireability17121406489615790444.gal : 2 ms
[2026-05-23 07:43:08] [INFO ] Time to serialize properties into /tmp/CTLFireability15163314696175137266.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/CTLFireability17121406489615790444.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15163314696175137266.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.15504e+07,0.234565,13716,2,2900,5,32005,6,0,1099,37825,0


Converting to forward existential form...Done !
original formula: EX(AG(!(A(AF((((p138==1)&&(p302==1))&&(p453==1))) U (p203==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(!((E(!((p203==1)) U (!(!(EG(!((((p138==1)&&(p302==1))&&(p453==1)))))) * !((p203==1))...193
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t50, t59, t64, t65, ...363
Detected timeout of ITS tools.
[2026-05-23 07:43:39] [INFO ] Flatten gal took : 12 ms
[2026-05-23 07:43:39] [INFO ] Applying decomposition
[2026-05-23 07:43:39] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12540472655645616677.txt' '-o' '/tmp/graph12540472655645616677.bin' '-w' '/tmp/graph12540472655645616677.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12540472655645616677.bin' '-l' '-1' '-v' '-w' '/tmp/graph12540472655645616677.weights' '-q' '0' '-e' '0.001'
[2026-05-23 07:43:39] [INFO ] Decomposing Gal with order
[2026-05-23 07:43:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 07:43:39] [INFO ] Removed a total of 199 redundant transitions.
[2026-05-23 07:43:39] [INFO ] Flatten gal took : 19 ms
[2026-05-23 07:43:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 6 ms.
[2026-05-23 07:43:39] [INFO ] Time to serialize gal into /tmp/CTLFireability9728654028247715551.gal : 2 ms
[2026-05-23 07:43:39] [INFO ] Time to serialize properties into /tmp/CTLFireability17777429838427951684.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/CTLFireability9728654028247715551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17777429838427951684.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.15504e+07,0.159809,11212,757,159,11801,881,669,32089,112,4428,0


Converting to forward existential form...Done !
original formula: EX(AG(!(A(AF((((i3.i0.u15.p138==1)&&(i10.i1.u51.p302==1))&&(i12.u64.p453==1))) U (i5.i1.u27.p203==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(!((E(!((i5.i1.u27.p203==1)) U (!(!(EG(!((((i3.i0.u15.p138==1)&&(i10.i1.u51.p302==1))...252
Reverse transition relation is NOT exact ! Due to transitions t12, t77, t136, t211, t239, t266, i0.t4, i0.u70.t8, i0.u70.t9, i0.u71.t3, i0.u71.t5, i0.u71.t...555
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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 13
(forward)formula 0,0,17.2873,547376,1,0,779688,2283,4118,2.64327e+06,523,16018,947131
FORMULA CO4-PT-09-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 321/321 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 212 transition count 300
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 212 transition count 300
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 212 transition count 297
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 205 transition count 289
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 205 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 204 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 204 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 204 transition count 287
Applied a total of 56 rules in 7 ms. Remains 204 /230 variables (removed 26) and now considering 287/321 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12664075266650652947.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3225446451918701056.kers'
[2026-05-23 07:43:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12664075266650652947.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3225446451918701056.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 287 rows 204 cols 830 entries
Finished phase 1 with 199 SingleSign rule and 0 generalized
[2026-05-23 07:43:56] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-3225446451918701056.kers
Total runtime 5 ms.
[2026-05-23 07:43:56] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-23 07:43:56] [INFO ] Invariant cache hit.
[2026-05-23 07:43:56] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 204/230 places, 287/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 212 ms. Remains : 204/230 places, 287/321 transitions.
[2026-05-23 07:43:56] [INFO ] Flatten gal took : 9 ms
[2026-05-23 07:43:56] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:43:56] [INFO ] Input system was already deterministic with 287 transitions.
[2026-05-23 07:43:56] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:43:56] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:43:56] [INFO ] Time to serialize gal into /tmp/CTLFireability7212961518174695997.gal : 2 ms
[2026-05-23 07:43:56] [INFO ] Time to serialize properties into /tmp/CTLFireability14925797989260403006.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/CTLFireability7212961518174695997.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14925797989260403006.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.15505e+07,0.230961,13608,2,2909,5,31765,6,0,1099,37550,0


Converting to forward existential form...Done !
original formula: (A((((A((p453==1) U (p264==1)) + (p349!=1)) + (p233!=1)) * EF((((((p248==1)&&(p302==1))&&(p453==1)) + AX(FALSE)) + !(AF((p110==1)))))) U ...204
=> equivalent forward existential formula: [(FwdU((Init * !((E(!(!((E(!((p222==1)) U (!(!(!(EX(!((p254==1)))))) * !((p222==1)))) + EG(!((p222==1)))))) U (!...571
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t50, t59, t64, t65, ...375
Detected timeout of ITS tools.
[2026-05-23 07:44:26] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:44:26] [INFO ] Applying decomposition
[2026-05-23 07:44:26] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9609565463794063992.txt' '-o' '/tmp/graph9609565463794063992.bin' '-w' '/tmp/graph9609565463794063992.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9609565463794063992.bin' '-l' '-1' '-v' '-w' '/tmp/graph9609565463794063992.weights' '-q' '0' '-e' '0.001'
[2026-05-23 07:44:26] [INFO ] Decomposing Gal with order
[2026-05-23 07:44:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 07:44:26] [INFO ] Removed a total of 196 redundant transitions.
[2026-05-23 07:44:26] [INFO ] Flatten gal took : 29 ms
[2026-05-23 07:44:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 18 ms.
[2026-05-23 07:44:26] [INFO ] Time to serialize gal into /tmp/CTLFireability17822597996328753403.gal : 3 ms
[2026-05-23 07:44:26] [INFO ] Time to serialize properties into /tmp/CTLFireability13047728550201303966.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/CTLFireability17822597996328753403.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13047728550201303966.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.15505e+07,0.132213,8884,757,212,6945,992,649,21252,112,5411,0


Converting to forward existential form...Done !
original formula: (A((((A((i12.u62.p453==1) U (i7.i1.u40.p264==1)) + (i10.i0.u58.p349!=1)) + (i5.i1.u32.p233!=1)) * EF((((((i7.i0.u35.p248==1)&&(i10.i0.u49...311
=> equivalent forward existential formula: [(FwdU((Init * !((E(!(!((E(!((i2.i1.u29.p222==1)) U (!(!(!(EX(!((i7.i0.u36.p254==1)))))) * !((i2.i1.u29.p222==1)...798
Reverse transition relation is NOT exact ! Due to transitions t12, t77, t206, t240, t265, i0.t4, i0.u68.t8, i0.u68.t9, i0.u69.t3, i0.u69.t5, i0.u69.t6, i0....594
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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 13
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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 13
(forward)formula 0,0,26.135,743464,1,0,981434,2450,4190,3.766e+06,561,16627,924251
FORMULA CO4-PT-09-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 230/230 places, 321/321 transitions.
Graph (trivial) has 232 edges and 230 vertex of which 2 / 230 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 529 edges and 229 vertex of which 224 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 223 transition count 233
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 144 transition count 231
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 162 place count 144 transition count 215
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 194 place count 128 transition count 215
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 206 place count 116 transition count 200
Iterating global reduction 2 with 12 rules applied. Total rules applied 218 place count 116 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 220 place count 116 transition count 198
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 220 place count 116 transition count 195
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 226 place count 113 transition count 195
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 229 place count 110 transition count 189
Iterating global reduction 3 with 3 rules applied. Total rules applied 232 place count 110 transition count 189
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 3 with 26 rules applied. Total rules applied 258 place count 97 transition count 176
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 3 with 4 rules applied. Total rules applied 262 place count 97 transition count 172
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 264 place count 96 transition count 171
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 266 place count 95 transition count 170
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 5 with 3 rules applied. Total rules applied 269 place count 95 transition count 167
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 272 place count 94 transition count 165
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 274 place count 93 transition count 164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 276 place count 92 transition count 163
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 283 place count 92 transition count 156
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 8 with 2 rules applied. Total rules applied 285 place count 92 transition count 154
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 287 place count 90 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 287 place count 90 transition count 153
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 289 place count 89 transition count 153
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 291 place count 88 transition count 152
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 293 place count 86 transition count 150
Applied a total of 293 rules in 67 ms. Remains 86 /230 variables (removed 144) and now considering 150/321 (removed 171) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8814246961316733352.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7290910327708488555.kers'
[2026-05-23 07:44:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8814246961316733352.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7290910327708488555.kers]
Normalized transition count is 149 out of 150 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 149 rows 86 cols 384 entries
Finished phase 1 with 81 SingleSign rule and 0 generalized
[2026-05-23 07:44:53] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7290910327708488555.kers
Total runtime 0 ms.
[2026-05-23 07:44:53] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-23 07:44:53] [INFO ] Invariant cache hit.
[2026-05-23 07:44:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:44:53] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2026-05-23 07:44:53] [INFO ] Redundant transitions in 6 ms returned []
Running 135 sub problems to find dead transitions.
[2026-05-23 07:44:53] [INFO ] Invariant cache hit.
[2026-05-23 07:44:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 149/235 variables, 86/91 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 1/236 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (OVERLAPS) 0/236 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 92 constraints, problems are : Problem set: 0 solved, 135 unsolved in 4929 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 149/235 variables, 86/91 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 135/226 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 1/236 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 0/236 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 227 constraints, problems are : Problem set: 0 solved, 135 unsolved in 6945 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11894ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 11894ms
Starting structural reductions in SI_CTL mode, iteration 1 : 86/230 places, 150/321 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12112 ms. Remains : 86/230 places, 150/321 transitions.
[2026-05-23 07:45:05] [INFO ] Flatten gal took : 8 ms
[2026-05-23 07:45:05] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:45:05] [INFO ] Input system was already deterministic with 150 transitions.
[2026-05-23 07:45:05] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:45:05] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:45:05] [INFO ] Time to serialize gal into /tmp/CTLFireability3207644329634649770.gal : 0 ms
[2026-05-23 07:45:05] [INFO ] Time to serialize properties into /tmp/CTLFireability6431710994402767186.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/CTLFireability3207644329634649770.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6431710994402767186.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,134785,0.053802,5800,2,594,5,6234,6,0,486,4733,0


Converting to forward existential form...Done !
original formula: EG((p344==0))
=> equivalent forward existential formula: [FwdG(Init,(p344==0))] != FALSE
Hit Full ! (commute/partial/dont) 148/0/2
(forward)formula 0,1,0.176951,11304,1,0,8,37266,19,4,2595,16589,8
FORMULA CO4-PT-09-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 230/230 places, 321/321 transitions.
Graph (trivial) has 230 edges and 230 vertex of which 2 / 230 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 529 edges and 229 vertex of which 224 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 82 place count 223 transition count 232
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 164 place count 143 transition count 230
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 164 place count 143 transition count 214
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 196 place count 127 transition count 214
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 209 place count 114 transition count 197
Iterating global reduction 2 with 13 rules applied. Total rules applied 222 place count 114 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 224 place count 114 transition count 195
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 224 place count 114 transition count 192
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 230 place count 111 transition count 192
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 233 place count 108 transition count 186
Iterating global reduction 3 with 3 rules applied. Total rules applied 236 place count 108 transition count 186
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 3 with 22 rules applied. Total rules applied 258 place count 97 transition count 175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 260 place count 97 transition count 173
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 264 place count 95 transition count 171
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 4 with 6 rules applied. Total rules applied 270 place count 95 transition count 165
Reduce places removed 2 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 5 with 6 rules applied. Total rules applied 276 place count 93 transition count 161
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 280 place count 91 transition count 159
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 284 place count 89 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 289 place count 89 transition count 152
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 290 place count 89 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 291 place count 88 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 293 place count 87 transition count 150
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 295 place count 85 transition count 148
Applied a total of 295 rules in 34 ms. Remains 85 /230 variables (removed 145) and now considering 148/321 (removed 173) transitions.
[2026-05-23 07:45:05] [INFO ] Flow matrix only has 128 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14090414763587361852.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13908093952728476951.kers'
[2026-05-23 07:45:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14090414763587361852.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13908093952728476951.kers]
Normalized transition count is 127 out of 128 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 127 rows 85 cols 342 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-23 07:45:05] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13908093952728476951.kers
Total runtime 0 ms.
[2026-05-23 07:45:05] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-23 07:45:05] [INFO ] Flow matrix only has 128 transitions (discarded 20 similar events)
[2026-05-23 07:45:05] [INFO ] Invariant cache hit.
[2026-05-23 07:45:05] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 07:45:05] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2026-05-23 07:45:05] [INFO ] Redundant transitions in 3 ms returned []
Running 142 sub problems to find dead transitions.
[2026-05-23 07:45:05] [INFO ] Flow matrix only has 128 transitions (discarded 20 similar events)
[2026-05-23 07:45:05] [INFO ] Invariant cache hit.
[2026-05-23 07:45:05] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 127/212 variables, 85/90 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 1/213 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (OVERLAPS) 0/213 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 111 constraints, problems are : Problem set: 0 solved, 142 unsolved in 5903 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 127/212 variables, 85/90 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 142/252 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (OVERLAPS) 1/213 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 12 (OVERLAPS) 0/213 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 256 constraints, problems are : Problem set: 0 solved, 142 unsolved in 10828 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16749ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 16749ms
Starting structural reductions in SI_CTL mode, iteration 1 : 85/230 places, 148/321 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16899 ms. Remains : 85/230 places, 148/321 transitions.
[2026-05-23 07:45:22] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:45:22] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:45:22] [INFO ] Input system was already deterministic with 148 transitions.
[2026-05-23 07:45:22] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:45:22] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:45:22] [INFO ] Time to serialize gal into /tmp/CTLFireability18232763710311610793.gal : 1 ms
[2026-05-23 07:45:22] [INFO ] Time to serialize properties into /tmp/CTLFireability6364859758900683243.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/CTLFireability18232763710311610793.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6364859758900683243.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,163813,0.042873,5472,2,670,5,5043,6,0,479,4082,0


Converting to forward existential form...Done !
original formula: AG(EF((((p302!=1)||(p372!=1))||(p464!=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((p302!=1)||(p372!=1))||(p464!=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t10, t32, t35, t43, t48, t56, t63, t70, t74, t81, t82, t88, t95, t96, t99, t1...265
(forward)formula 0,1,0.383047,19280,1,0,242,71085,316,114,3223,56228,305
FORMULA CO4-PT-09-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 321/321 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 213 transition count 301
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 213 transition count 301
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 213 transition count 299
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 207 transition count 292
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 207 transition count 292
Applied a total of 48 rules in 12 ms. Remains 207 /230 variables (removed 23) and now considering 292/321 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17531479581585013909.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11438109062973589079.kers'
[2026-05-23 07:45:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17531479581585013909.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11438109062973589079.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 292 rows 207 cols 844 entries
Finished phase 1 with 202 SingleSign rule and 0 generalized
[2026-05-23 07:45:22] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11438109062973589079.kers
Total runtime 1 ms.
[2026-05-23 07:45:22] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-23 07:45:22] [INFO ] Invariant cache hit.
[2026-05-23 07:45:23] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 291 sub problems to find dead transitions.
[2026-05-23 07:45:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (OVERLAPS) 292/499 variables, 207/217 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (OVERLAPS) 0/499 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 217 constraints, problems are : Problem set: 0 solved, 291 unsolved in 19100 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (OVERLAPS) 292/499 variables, 207/218 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 291/509 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 499/499 variables, and 510 constraints, problems are : Problem set: 0 solved, 291 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49145ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 49146ms
Starting structural reductions in LTL mode, iteration 1 : 207/230 places, 292/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49333 ms. Remains : 207/230 places, 292/321 transitions.
[2026-05-23 07:46:12] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:46:12] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:46:12] [INFO ] Input system was already deterministic with 292 transitions.
[2026-05-23 07:46:12] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:46:12] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:46:12] [INFO ] Time to serialize gal into /tmp/CTLFireability10208851235758957944.gal : 1 ms
[2026-05-23 07:46:12] [INFO ] Time to serialize properties into /tmp/CTLFireability5544180989231623519.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/CTLFireability10208851235758957944.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5544180989231623519.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.3126e+07,0.270965,15292,2,2891,5,37386,6,0,1116,42648,0


Converting to forward existential form...Done !
original formula: EX(E(!((AX(FALSE) + (p4!=1))) U E(((p285==1)||(p394==1)) U (((p153==1)||(p463==1))||((((p300==1)&&(p307==1))&&(p354==1))||(((p300==1)&&(p...180
=> equivalent forward existential formula: [(FwdU(FwdU(EY(Init),!((!(EX(!(FALSE))) + (p4!=1)))),((p285==1)||(p394==1))) * (((p153==1)||(p463==1))||((((p300...233
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t46, t47, t55, t64, ...391
Hit Full ! (commute/partial/dont) 286/0/6
(forward)formula 0,0,3.16483,103024,1,0,424,401978,612,248,7167,432173,599
FORMULA CO4-PT-09-CTLFireability-2024-07 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 : 230/230 places, 321/321 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 210 transition count 297
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 210 transition count 297
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 210 transition count 294
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 50 place count 203 transition count 286
Iterating global reduction 1 with 7 rules applied. Total rules applied 57 place count 203 transition count 286
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 202 transition count 285
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 202 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 202 transition count 284
Applied a total of 60 rules in 7 ms. Remains 202 /230 variables (removed 28) and now considering 284/321 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5587649673144015014.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6408818339526307701.kers'
[2026-05-23 07:46:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5587649673144015014.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6408818339526307701.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 284 rows 202 cols 816 entries
Finished phase 1 with 197 SingleSign rule and 0 generalized
[2026-05-23 07:46:15] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6408818339526307701.kers
Total runtime 2 ms.
[2026-05-23 07:46:15] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-23 07:46:15] [INFO ] Invariant cache hit.
[2026-05-23 07:46:15] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2026-05-23 07:46:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (OVERLAPS) 284/486 variables, 202/212 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 0/486 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 212 constraints, problems are : Problem set: 0 solved, 283 unsolved in 19435 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (OVERLAPS) 284/486 variables, 202/213 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 283/496 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 498 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49485ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 49486ms
Starting structural reductions in LTL mode, iteration 1 : 202/230 places, 284/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49669 ms. Remains : 202/230 places, 284/321 transitions.
[2026-05-23 07:47:05] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:47:05] [INFO ] Flatten gal took : 10 ms
[2026-05-23 07:47:05] [INFO ] Input system was already deterministic with 284 transitions.
[2026-05-23 07:47:05] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:47:05] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:47:05] [INFO ] Time to serialize gal into /tmp/CTLFireability17912224273337871870.gal : 2 ms
[2026-05-23 07:47:05] [INFO ] Time to serialize properties into /tmp/CTLFireability7682161825132580629.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/CTLFireability17912224273337871870.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7682161825132580629.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.13672e+07,0.229564,13496,2,2885,5,31637,6,0,1088,37361,0


Converting to forward existential form...Done !
original formula: EG(EX(EF((p174==0))))
=> equivalent forward existential formula: [FwdG(Init,EX(E(TRUE U (p174==0))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t50, t59, t64, t65, ...369
(forward)formula 0,1,11.3395,369536,1,0,654,1.46284e+06,595,403,7317,2.34173e+06,773
FORMULA CO4-PT-09-CTLFireability-2024-09 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 : 230/230 places, 321/321 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 211 transition count 298
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 211 transition count 298
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 211 transition count 295
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 204 transition count 287
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 204 transition count 287
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 203 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 203 transition count 286
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 203 transition count 285
Applied a total of 58 rules in 15 ms. Remains 203 /230 variables (removed 27) and now considering 285/321 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13817646590569263352.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4372402432621963227.kers'
[2026-05-23 07:47:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13817646590569263352.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4372402432621963227.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 285 rows 203 cols 818 entries
Finished phase 1 with 198 SingleSign rule and 0 generalized
[2026-05-23 07:47:16] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4372402432621963227.kers
Total runtime 2 ms.
[2026-05-23 07:47:16] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-23 07:47:16] [INFO ] Invariant cache hit.
[2026-05-23 07:47:16] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2026-05-23 07:47:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (OVERLAPS) 285/488 variables, 203/214 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (OVERLAPS) 0/488 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 214 constraints, problems are : Problem set: 0 solved, 284 unsolved in 20240 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 285/488 variables, 203/214 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 284/498 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 0/488 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 499 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50280ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 50280ms
Starting structural reductions in LTL mode, iteration 1 : 203/230 places, 285/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50489 ms. Remains : 203/230 places, 285/321 transitions.
[2026-05-23 07:48:07] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:48:07] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:48:07] [INFO ] Input system was already deterministic with 285 transitions.
[2026-05-23 07:48:07] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:48:07] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:48:07] [INFO ] Time to serialize gal into /tmp/CTLFireability8709367341429728534.gal : 2 ms
[2026-05-23 07:48:07] [INFO ] Time to serialize properties into /tmp/CTLFireability17332525181121327363.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/CTLFireability8709367341429728534.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17332525181121327363.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.18052e+07,0.191846,11928,2,2615,5,26783,6,0,1093,31627,0


Converting to forward existential form...Done !
original formula: EF(AX((p339==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((p339==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t50, t59, t65, t66, ...369
(forward)formula 0,1,2.35096,87348,1,0,412,332884,587,240,6764,362720,577
FORMULA CO4-PT-09-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 321/321 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 214 transition count 301
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 214 transition count 301
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 214 transition count 298
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 208 transition count 291
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 208 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 207 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 207 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 207 transition count 289
Applied a total of 50 rules in 16 ms. Remains 207 /230 variables (removed 23) and now considering 289/321 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16832112354070352479.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7228634309504649990.kers'
[2026-05-23 07:48:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16832112354070352479.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7228634309504649990.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 289 rows 207 cols 826 entries
Finished phase 1 with 202 SingleSign rule and 0 generalized
[2026-05-23 07:48:09] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7228634309504649990.kers
Total runtime 2 ms.
[2026-05-23 07:48:09] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-23 07:48:09] [INFO ] Invariant cache hit.
[2026-05-23 07:48:09] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2026-05-23 07:48:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 289/496 variables, 207/218 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/496 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 0/496 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 219 constraints, problems are : Problem set: 0 solved, 288 unsolved in 21399 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (OVERLAPS) 289/496 variables, 207/221 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 288/509 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 510 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 51445ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 51446ms
Starting structural reductions in LTL mode, iteration 1 : 207/230 places, 289/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51637 ms. Remains : 207/230 places, 289/321 transitions.
[2026-05-23 07:49:01] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:49:01] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:49:01] [INFO ] Input system was already deterministic with 289 transitions.
[2026-05-23 07:49:01] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:49:01] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:49:01] [INFO ] Time to serialize gal into /tmp/CTLFireability54868178275139462.gal : 1 ms
[2026-05-23 07:49:01] [INFO ] Time to serialize properties into /tmp/CTLFireability16434622167496833089.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/CTLFireability54868178275139462.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16434622167496833089.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.48307e+07,0.219966,13416,2,3107,5,31201,6,0,1113,39660,0


Converting to forward existential form...Done !
original formula: A((EF((((p213==1)&&(p361==1))||(p418==1))) + ((p310==1) * !(EF((p453==1))))) U E(A(!(((p376==1)||(((p300==1)&&(p307==1))&&(p377==1)))) U ...183
=> equivalent forward existential formula: [((Init * !(EG(!(E(!((E(!(!(EX(!(FALSE)))) U (!(!(((p376==1)||(((p300==1)&&(p307==1))&&(p377==1))))) * !(!(EX(!(...673
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t12, t13, t19, t28, t33, t34, t36, t37, t41, t42, t49, t51, t60, ...383
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-05-23 07:49:31] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:49:31] [INFO ] Applying decomposition
[2026-05-23 07:49:31] [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/graph5762539631714078692.txt' '-o' '/tmp/graph5762539631714078692.bin' '-w' '/tmp/graph5762539631714078692.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5762539631714078692.bin' '-l' '-1' '-v' '-w' '/tmp/graph5762539631714078692.weights' '-q' '0' '-e' '0.001'
[2026-05-23 07:49:31] [INFO ] Decomposing Gal with order
[2026-05-23 07:49:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 07:49:31] [INFO ] Removed a total of 186 redundant transitions.
[2026-05-23 07:49:31] [INFO ] Flatten gal took : 11 ms
[2026-05-23 07:49:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 5 ms.
[2026-05-23 07:49:31] [INFO ] Time to serialize gal into /tmp/CTLFireability4945349255842233178.gal : 2 ms
[2026-05-23 07:49:31] [INFO ] Time to serialize properties into /tmp/CTLFireability2706991274547454821.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/CTLFireability4945349255842233178.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2706991274547454821.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.48307e+07,0.156434,11612,456,186,12435,1318,647,34317,115,6832,0


Converting to forward existential form...Done !
original formula: A((EF((((i4.i0.u32.p213==1)&&(i10.u58.p361==1))||(i11.u64.p418==1))) + ((i8.i1.u52.p310==1) * !(EF((i11.u65.p453==1))))) U E(A(!(((i9.u56...274
=> equivalent forward existential formula: [((Init * !(EG(!(E(!((E(!(!(EX(!(FALSE)))) U (!(!(((i9.u56.p376==1)||(((i8.i1.u50.p300==1)&&(i8.i1.u52.p307==1))...858
Reverse transition relation is NOT exact ! Due to transitions t12, t79, t208, t239, t266, t269, i0.i1.u6.t212, i1.i1.u12.t182, i1.i1.u13.t184, i2.i1.u20.t1...615
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
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
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 321/321 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 213 transition count 300
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 213 transition count 300
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 213 transition count 298
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 207 transition count 292
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 207 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 206 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 206 transition count 291
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 206 transition count 290
Applied a total of 51 rules in 8 ms. Remains 206 /230 variables (removed 24) and now considering 290/321 (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-6341265448242187672.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15834636014440847582.kers'
[2026-05-23 07:50:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6341265448242187672.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15834636014440847582.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 206 cols 835 entries
Finished phase 1 with 201 SingleSign rule and 0 generalized
[2026-05-23 07:50:01] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15834636014440847582.kers
Total runtime 2 ms.
[2026-05-23 07:50:01] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-23 07:50:01] [INFO ] Invariant cache hit.
[2026-05-23 07:50:01] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2026-05-23 07:50:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 290/496 variables, 206/215 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/496 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 0/496 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 215 constraints, problems are : Problem set: 0 solved, 289 unsolved in 19332 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (OVERLAPS) 290/496 variables, 206/217 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 289/506 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 508 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49390ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 49391ms
Starting structural reductions in LTL mode, iteration 1 : 206/230 places, 290/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49599 ms. Remains : 206/230 places, 290/321 transitions.
[2026-05-23 07:50:50] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:50:50] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:50:50] [INFO ] Input system was already deterministic with 290 transitions.
[2026-05-23 07:50:51] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:50:51] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:50:51] [INFO ] Time to serialize gal into /tmp/CTLFireability242922515284063385.gal : 1 ms
[2026-05-23 07:50:51] [INFO ] Time to serialize properties into /tmp/CTLFireability12367606070532843762.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/CTLFireability242922515284063385.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12367606070532843762.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.17337e+07,0.22944,13604,2,2913,5,32004,6,0,1109,37431,0


Converting to forward existential form...Done !
original formula: !(A(EX(!(EX((p187==1)))) U A((p243==1) U AF(((p183==1)||(p132==1))))))
=> equivalent forward existential formula: (([FwdG((FwdU((FwdU(Init,!(!((E(!(!(EG(!(((p183==1)||(p132==1)))))) U (!((p243==1)) * !(!(EG(!(((p183==1)||(p132...737
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t50, t59, t64, t65, ...375
Detected timeout of ITS tools.
[2026-05-23 07:51:21] [INFO ] Flatten gal took : 9 ms
[2026-05-23 07:51:21] [INFO ] Applying decomposition
[2026-05-23 07:51:21] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14317156661083085759.txt' '-o' '/tmp/graph14317156661083085759.bin' '-w' '/tmp/graph14317156661083085759.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14317156661083085759.bin' '-l' '-1' '-v' '-w' '/tmp/graph14317156661083085759.weights' '-q' '0' '-e' '0.001'
[2026-05-23 07:51:21] [INFO ] Decomposing Gal with order
[2026-05-23 07:51:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 07:51:21] [INFO ] Removed a total of 193 redundant transitions.
[2026-05-23 07:51:21] [INFO ] Flatten gal took : 10 ms
[2026-05-23 07:51:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 5 ms.
[2026-05-23 07:51:21] [INFO ] Time to serialize gal into /tmp/CTLFireability7473759437162763352.gal : 6 ms
[2026-05-23 07:51:21] [INFO ] Time to serialize properties into /tmp/CTLFireability4849483355427171333.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/CTLFireability7473759437162763352.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4849483355427171333.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17337e+07,0.165716,11076,785,184,12406,1101,673,28689,114,5215,0


Converting to forward existential form...Done !
original formula: !(A(EX(!(EX((i5.i1.u21.p187==1)))) U A((i7.i2.u35.p243==1) U AF(((i5.i1.u21.p183==1)||(i7.i0.u14.p132==1))))))
=> equivalent forward existential formula: (([FwdG((FwdU((FwdU(Init,!(!((E(!(!(EG(!(((i5.i1.u21.p183==1)||(i7.i0.u14.p132==1)))))) U (!((i7.i2.u35.p243==1)...1037
Reverse transition relation is NOT exact ! Due to transitions t12, t77, t147, t209, t268, i0.t4, i0.u69.t8, i0.u69.t9, i0.u70.t3, i0.u70.t5, i0.u70.t6, i0....571
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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 13
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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 13
(forward)formula 0,1,24.7552,865028,1,0,1.28626e+06,2311,4650,5.90853e+06,617,20023,1103279
FORMULA CO4-PT-09-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-23 07:51:46] [INFO ] Flatten gal took : 11 ms
[2026-05-23 07:51:46] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:51:46] [INFO ] Applying decomposition
[2026-05-23 07:51:46] [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/graph2301860467892627652.txt' '-o' '/tmp/graph2301860467892627652.bin' '-w' '/tmp/graph2301860467892627652.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2301860467892627652.bin' '-l' '-1' '-v' '-w' '/tmp/graph2301860467892627652.weights' '-q' '0' '-e' '0.001'
[2026-05-23 07:51:46] [INFO ] Decomposing Gal with order
[2026-05-23 07:51:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 07:51:46] [INFO ] Removed a total of 215 redundant transitions.
[2026-05-23 07:51:46] [INFO ] Flatten gal took : 11 ms
[2026-05-23 07:51:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 4 ms.
[2026-05-23 07:51:46] [INFO ] Time to serialize gal into /tmp/CTLFireability15306721594470476122.gal : 2 ms
[2026-05-23 07:51:46] [INFO ] Time to serialize properties into /tmp/CTLFireability3010163462139236619.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/CTLFireability15306721594470476122.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3010163462139236619.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,2.779e+07,0.353882,19932,1125,294,27506,2254,658,73728,141,17413,0


Converting to forward existential form...Done !
original formula: A((EF((((i8.u34.p213==1)&&(i11.u65.p361==1))||(i12.u72.p418==1))) + ((i9.u56.p310==1) * !(EF((i12.u78.p453==1))))) U E(A(!(((i9.u63.p376=...256
=> equivalent forward existential formula: [((Init * !(EG(!(E(!((E(!(!(EX(!(FALSE)))) U (!(!(((i9.u63.p376==1)||(((i9.u55.p300==1)&&(i9.u56.p307==1))&&(i9....816
Reverse transition relation is NOT exact ! Due to transitions t12, t50, t90, t163, t202, t229, t293, i2.i0.i0.u9.t209, i2.i0.i1.u22.t176, i2.i0.i1.u22.t178...669
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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 13
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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 13
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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 13
Using saturation style SCC detection
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 13
(forward)formula 0,0,112.756,2206324,1,0,2.84608e+06,4286,2263,1.81245e+07,392,35265,1398530
FORMULA CO4-PT-09-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 790831 ms.

BK_STOP 1779522819332

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ 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="CO4-PT-09"
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 CO4-PT-09, 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 r066-tall-177946967700346"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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