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.r082-smll-177946993500122.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 DBSingleClientW-PT-d0m09, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993500122
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.7K Mar 6 18:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 6 18:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 6 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 6 18:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 08:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 08:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 6 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Mar 6 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 6 18:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Mar 6 18:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 119K 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 DBSingleClientW-PT-d0m09-CTLFireability-2024-00
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2024-01
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2024-02
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2024-03
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2024-04
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2024-05
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2024-06
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2024-07
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2024-08
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2024-09
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2024-10
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2024-11
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2024-12
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2024-13
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2024-14
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779556844337

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 17:20:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 17:20:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 17:20:47] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2026-05-23 17:20:47] [INFO ] Transformed 553 places.
[2026-05-23 17:20:47] [INFO ] Transformed 150 transitions.
[2026-05-23 17:20:47] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 416 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 30 ms.
Deduced a syphon composed of 444 places in 4 ms
Reduce places removed 444 places and 0 transitions.
Support contains 69 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 98 transition count 135
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 98 transition count 135
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 97 transition count 134
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 97 transition count 134
Applied a total of 28 rules in 56 ms. Remains 97 /109 variables (removed 12) and now considering 134/150 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1895761745494216503.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3012501303212595743.kers'
[2026-05-23 17:20:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1895761745494216503.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3012501303212595743.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 134 rows 97 cols 400 entries
Finished phase 1 with 93 SingleSign rule and 2 generalized
[2026-05-23 17:20:47] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3012501303212595743.kers
Total runtime 3 ms.
[2026-05-23 17:20:47] [INFO ] Implicit Places using invariants in 446 ms returned []
[2026-05-23 17:20:47] [INFO ] Invariant cache hit.
[2026-05-23 17:20:48] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-23 17:20:48] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 808 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2026-05-23 17:20:48] [INFO ] Invariant cache hit.
[2026-05-23 17:20:48] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 134/231 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 61/160 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 0/231 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 161 constraints, problems are : Problem set: 0 solved, 133 unsolved in 11168 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 134/231 variables, 97/100 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 61/161 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 133/294 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 231/231 variables, and 294 constraints, problems are : Problem set: 0 solved, 133 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41566ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 41593ms
Starting structural reductions in LTL mode, iteration 1 : 97/109 places, 134/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42523 ms. Remains : 97/109 places, 134/150 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2026-05-23 17:21:29] [INFO ] Invariant cache hit.
[2026-05-23 17:21:29] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-23 17:21:29] [INFO ] Invariant cache hit.
[2026-05-23 17:21:30] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-23 17:21:30] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 367 ms. Remains : 97/97 places, 134/134 transitions.
Support contains 69 out of 97 places after structural reductions.
[2026-05-23 17:21:30] [INFO ] Flatten gal took : 55 ms
[2026-05-23 17:21:30] [INFO ] Flatten gal took : 23 ms
[2026-05-23 17:21:30] [INFO ] Input system was already deterministic with 134 transitions.
Reduction of identical properties reduced properties to check from 71 to 67
RANDOM walk for 40000 steps (9136 resets) in 3283 ms. (12 steps per ms) remains 37/67 properties
BEST_FIRST walk for 4002 steps (405 resets) in 52 ms. (75 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (201 resets) in 35 ms. (111 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (184 resets) in 31 ms. (125 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (203 resets) in 44 ms. (88 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (217 resets) in 63 ms. (62 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (445 resets) in 37 ms. (105 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4002 steps (192 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (206 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (410 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (117 resets) in 35 ms. (111 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (216 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (414 resets) in 28 ms. (138 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (416 resets) in 35 ms. (111 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (205 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (201 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (191 resets) in 28 ms. (138 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (183 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (403 resets) in 33 ms. (117 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (209 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (194 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (371 resets) in 25 ms. (154 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (189 resets) in 21 ms. (181 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (219 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (208 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (800 resets) in 34 ms. (114 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (194 resets) in 29 ms. (133 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (197 resets) in 25 ms. (154 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (198 resets) in 21 ms. (181 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (207 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (200 resets) in 35 ms. (111 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (197 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (272 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (402 resets) in 29 ms. (133 steps per ms) remains 34/36 properties
BEST_FIRST walk for 4004 steps (347 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (196 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (195 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
[2026-05-23 17:21:32] [INFO ] Invariant cache hit.
[2026-05-23 17:21:32] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp69 is UNSAT
At refinement iteration 1 (OVERLAPS) 21/69 variables, 1/1 constraints. Problems are: Problem set: 6 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 6 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 17/86 variables, 1/2 constraints. Problems are: Problem set: 6 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 126/212 variables, 86/88 constraints. Problems are: Problem set: 6 solved, 28 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 53/141 constraints. Problems are: Problem set: 6 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/141 constraints. Problems are: Problem set: 6 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 19/231 variables, 11/152 constraints. Problems are: Problem set: 6 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 8/160 constraints. Problems are: Problem set: 6 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 0/160 constraints. Problems are: Problem set: 6 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 0/231 variables, 2/162 constraints. Problems are: Problem set: 6 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/162 constraints. Problems are: Problem set: 6 solved, 28 unsolved
At refinement iteration 13 (OVERLAPS) 0/231 variables, 0/162 constraints. Problems are: Problem set: 6 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 162 constraints, problems are : Problem set: 6 solved, 28 unsolved in 3379 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 26/63 variables, 1/1 constraints. Problems are: Problem set: 6 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 6 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 22/85 variables, 1/2 constraints. Problems are: Problem set: 6 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/3 constraints. Problems are: Problem set: 6 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 121/206 variables, 85/88 constraints. Problems are: Problem set: 6 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 48/136 constraints. Problems are: Problem set: 6 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 4/140 constraints. Problems are: Problem set: 6 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/140 constraints. Problems are: Problem set: 6 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 25/231 variables, 12/152 constraints. Problems are: Problem set: 6 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 13/165 constraints. Problems are: Problem set: 6 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 24/189 constraints. Problems are: Problem set: 6 solved, 28 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 1/190 constraints. Problems are: Problem set: 6 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 231/231 variables, and 190 constraints, problems are : Problem set: 6 solved, 28 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 28/34 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8457ms problems are : Problem set: 6 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 91 transition count 124
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 91 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 89 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 89 transition count 122
Applied a total of 16 rules in 27 ms. Remains 89 /97 variables (removed 8) and now considering 122/134 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 89/97 places, 122/134 transitions.
RANDOM walk for 40000 steps (9208 resets) in 566 ms. (70 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (391 resets) in 53 ms. (74 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (202 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (208 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (205 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (174 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (382 resets) in 39 ms. (100 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4004 steps (217 resets) in 28 ms. (138 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (396 resets) in 29 ms. (133 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (196 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (403 resets) in 29 ms. (133 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (394 resets) in 49 ms. (80 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (174 resets) in 31 ms. (125 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4001 steps (191 resets) in 33 ms. (117 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (188 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (421 resets) in 22 ms. (173 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (190 resets) in 33 ms. (117 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (208 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (196 resets) in 22 ms. (173 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (182 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (800 resets) in 34 ms. (114 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (215 resets) in 36 ms. (108 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (219 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (210 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (197 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (243 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (436 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (432 resets) in 36 ms. (108 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (211 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
Probabilistic random walk after 1000000 steps, saw 378867 distinct states, run finished after 1621 ms. (steps per millisecond=616 ) properties seen :25
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1008746166130210976.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-35797782923710456.kers'
[2026-05-23 17:21:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1008746166130210976.kers, --Pflows, --basisKERS=/tmp/petrispot-output-35797782923710456.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 122 rows 89 cols 369 entries
Finished phase 1 with 85 SingleSign rule and 2 generalized
[2026-05-23 17:21:42] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-35797782923710456.kers
Total runtime 2 ms.
[2026-05-23 17:21:42] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 81/141 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/203 variables, 25/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/211 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/211 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/211 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/211 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 144 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 81/141 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/203 variables, 25/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/211 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/211 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/211 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/211 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 145 constraints, problems are : Problem set: 0 solved, 1 unsolved in 381 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 540ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 122/122 transitions.
Graph (complete) has 263 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 88 transition count 120
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 19 place count 72 transition count 90
Iterating global reduction 1 with 16 rules applied. Total rules applied 35 place count 72 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 72 transition count 89
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 43 place count 65 transition count 82
Iterating global reduction 2 with 7 rules applied. Total rules applied 50 place count 65 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 52 place count 65 transition count 80
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 55 place count 62 transition count 74
Iterating global reduction 3 with 3 rules applied. Total rules applied 58 place count 62 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 61 place count 60 transition count 70
Iterating global reduction 4 with 2 rules applied. Total rules applied 63 place count 60 transition count 70
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 65 place count 58 transition count 68
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 58 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 69 place count 58 transition count 66
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 70 place count 57 transition count 65
Iterating global reduction 5 with 1 rules applied. Total rules applied 71 place count 57 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 73 place count 57 transition count 63
Applied a total of 73 rules in 48 ms. Remains 57 /89 variables (removed 32) and now considering 63/122 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 57/89 places, 63/122 transitions.
RANDOM walk for 40000 steps (9161 resets) in 233 ms. (170 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (2633 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2710735 steps, run timeout after 3001 ms. (steps per millisecond=903 ) properties seen :0 out of 1
Probabilistic random walk after 2710735 steps, saw 1073087 distinct states, run finished after 3007 ms. (steps per millisecond=901 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9346601028022260656.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18130642854638569731.kers'
[2026-05-23 17:21:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9346601028022260656.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18130642854638569731.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 63 rows 57 cols 208 entries
Finished phase 1 with 52 SingleSign rule and 3 generalized
[2026-05-23 17:21:46] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18130642854638569731.kers
Total runtime 1 ms.
[2026-05-23 17:21:46] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/94 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/120 variables, 15/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 11/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 88 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/94 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/120 variables, 15/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 11/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/120 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/120 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 314 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 412ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 6 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 57/57 places, 63/63 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2026-05-23 17:21:46] [INFO ] Invariant cache hit.
[2026-05-23 17:21:46] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-23 17:21:46] [INFO ] Invariant cache hit.
[2026-05-23 17:21:46] [INFO ] State equation strengthened by 19 read => feed constraints.
[2026-05-23 17:21:47] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2026-05-23 17:21:47] [INFO ] Redundant transitions in 1 ms returned []
Running 62 sub problems to find dead transitions.
[2026-05-23 17:21:47] [INFO ] Invariant cache hit.
[2026-05-23 17:21:47] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 63/120 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 19/78 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 78 constraints, problems are : Problem set: 0 solved, 62 unsolved in 2179 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 63/120 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 19/78 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 62/140 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 140 constraints, problems are : Problem set: 0 solved, 62 unsolved in 7065 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9267ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 9268ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9499 ms. Remains : 57/57 places, 63/63 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 57 transition count 60
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 3 place count 57 transition count 54
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 15 place count 51 transition count 54
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 1 with 4 rules applied. Total rules applied 19 place count 49 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 47 transition count 64
Applied a total of 23 rules in 23 ms. Remains 47 /57 variables (removed 10) and now considering 64/63 (removed -1) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2859761568916782589.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7053428998796497901.kers'
[2026-05-23 17:21:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2859761568916782589.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7053428998796497901.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 64 rows 47 cols 249 entries
Finished phase 1 with 40 SingleSign rule and 2 generalized
[2026-05-23 17:21:56] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7053428998796497901.kers
Total runtime 1 ms.
[2026-05-23 17:21:56] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-23 17:21:56] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 4 ms returned sat
[2026-05-23 17:21:56] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-23 17:21:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-23 17:21:56] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 17:21:56] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-23 17:21:56] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-23 17:21:56] [INFO ] After 136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 287 ms.
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DBSingleClientW-PT-d0m09-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-CTLFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 17:21:56] [INFO ] Flatten gal took : 22 ms
[2026-05-23 17:21:56] [INFO ] Flatten gal took : 24 ms
[2026-05-23 17:21:56] [INFO ] Input system was already deterministic with 134 transitions.
Computed a total of 6 stabilizing places and 18 stable transitions
Graph (complete) has 323 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 79 transition count 102
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 79 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 79 transition count 100
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 71 transition count 92
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 71 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 71 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 70 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 70 transition count 89
Applied a total of 58 rules in 17 ms. Remains 70 /97 variables (removed 27) and now considering 89/134 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18271626631170782041.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14103440465027082507.kers'
[2026-05-23 17:21:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18271626631170782041.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14103440465027082507.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 89 rows 70 cols 291 entries
Finished phase 1 with 66 SingleSign rule and 2 generalized
[2026-05-23 17:21:56] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14103440465027082507.kers
Total runtime 2 ms.
[2026-05-23 17:21:56] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-23 17:21:56] [INFO ] Invariant cache hit.
[2026-05-23 17:21:57] [INFO ] State equation strengthened by 29 read => feed constraints.
[2026-05-23 17:21:57] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2026-05-23 17:21:57] [INFO ] Invariant cache hit.
[2026-05-23 17:21:57] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 89/159 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 29/101 constraints. Problems are: Problem set: 0 solved, 88 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 0/159 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 101 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2947 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 89/159 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 29/101 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 88/189 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 0/159 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 189 constraints, problems are : Problem set: 0 solved, 88 unsolved in 9380 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12376ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 12378ms
Starting structural reductions in LTL mode, iteration 1 : 70/97 places, 89/134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12719 ms. Remains : 70/97 places, 89/134 transitions.
[2026-05-23 17:22:09] [INFO ] Flatten gal took : 8 ms
[2026-05-23 17:22:09] [INFO ] Flatten gal took : 8 ms
[2026-05-23 17:22:09] [INFO ] Input system was already deterministic with 89 transitions.
[2026-05-23 17:22:09] [INFO ] Flatten gal took : 7 ms
[2026-05-23 17:22:09] [INFO ] Flatten gal took : 8 ms
[2026-05-23 17:22:09] [INFO ] Time to serialize gal into /tmp/CTLFireability3135006038539376926.gal : 4 ms
[2026-05-23 17:22:09] [INFO ] Time to serialize properties into /tmp/CTLFireability13387452689800902225.ctl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3135006038539376926.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13387452689800902225.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.06335e+07,12.2798,246832,2,25023,5,946125,6,0,369,1.0282e+06,0


Converting to forward existential form...Done !
original formula: EF((AG(((EF(((s1<1)||(l149<1))) + (p28<1)) + (l0<1))) * (EG(((p14<1)||(l156<1))) + (((EG(AX(((s1>=1)&&(l510>=1)))) * E(((p24>=1)&&(l0>=1)...265
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * !(E(TRUE U !(((E(TRUE U ((s1<1)||(l149<1))) + (p28<1)) + (l0<1)))))),((p14<1)||(l156<1...671
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t57, t65, t66, t67, t6...356
Hit Full ! (commute/partial/dont) 86/0/3
(forward)formula 0,1,21.5164,307804,1,0,184,1.27286e+06,211,70,2746,1.36402e+06,204
FORMULA DBSingleClientW-PT-d0m09-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 84 transition count 113
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 84 transition count 113
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 78 transition count 107
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 78 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 78 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 77 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 77 transition count 104
Applied a total of 42 rules in 8 ms. Remains 77 /97 variables (removed 20) and now considering 104/134 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2443005263858525965.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1797046247481853909.kers'
[2026-05-23 17:22:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2443005263858525965.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1797046247481853909.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 104 rows 77 cols 320 entries
Finished phase 1 with 73 SingleSign rule and 2 generalized
[2026-05-23 17:22:31] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1797046247481853909.kers
Total runtime 1 ms.
[2026-05-23 17:22:31] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-05-23 17:22:31] [INFO ] Invariant cache hit.
[2026-05-23 17:22:31] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-23 17:22:31] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2026-05-23 17:22:31] [INFO ] Invariant cache hit.
[2026-05-23 17:22:31] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/181 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 43/122 constraints. Problems are: Problem set: 0 solved, 103 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 122 constraints, problems are : Problem set: 0 solved, 103 unsolved in 4946 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/181 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 43/122 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 103/225 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/181 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 225 constraints, problems are : Problem set: 0 solved, 103 unsolved in 13603 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18611ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 18615ms
Starting structural reductions in LTL mode, iteration 1 : 77/97 places, 104/134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19001 ms. Remains : 77/97 places, 104/134 transitions.
[2026-05-23 17:22:50] [INFO ] Flatten gal took : 7 ms
[2026-05-23 17:22:50] [INFO ] Flatten gal took : 8 ms
[2026-05-23 17:22:50] [INFO ] Input system was already deterministic with 104 transitions.
[2026-05-23 17:22:50] [INFO ] Flatten gal took : 7 ms
[2026-05-23 17:22:50] [INFO ] Flatten gal took : 7 ms
[2026-05-23 17:22:50] [INFO ] Time to serialize gal into /tmp/CTLFireability17941844062133774047.gal : 2 ms
[2026-05-23 17:22:50] [INFO ] Time to serialize properties into /tmp/CTLFireability11079781745240280834.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/CTLFireability17941844062133774047.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11079781745240280834.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.19376e+08,26.9175,529836,2,38574,5,2.16717e+06,6,0,412,1.68929e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 17:23:20] [INFO ] Flatten gal took : 8 ms
[2026-05-23 17:23:20] [INFO ] Applying decomposition
[2026-05-23 17:23:20] [INFO ] Flatten gal took : 8 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/graph11605464429208047155.txt' '-o' '/tmp/graph11605464429208047155.bin' '-w' '/tmp/graph11605464429208047155.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11605464429208047155.bin' '-l' '-1' '-v' '-w' '/tmp/graph11605464429208047155.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:23:20] [INFO ] Decomposing Gal with order
[2026-05-23 17:23:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:23:20] [INFO ] Removed a total of 79 redundant transitions.
[2026-05-23 17:23:20] [INFO ] Flatten gal took : 82 ms
[2026-05-23 17:23:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 13 ms.
[2026-05-23 17:23:20] [INFO ] Time to serialize gal into /tmp/CTLFireability1918701314665895890.gal : 5 ms
[2026-05-23 17:23:20] [INFO ] Time to serialize properties into /tmp/CTLFireability7883190602903028151.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/CTLFireability1918701314665895890.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7883190602903028151.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 78 transition count 100
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 78 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 78 transition count 99
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 71 transition count 92
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 71 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 68 transition count 86
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 68 transition count 86
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 68 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 67 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 67 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 66 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 66 place count 66 transition count 81
Applied a total of 66 rules in 10 ms. Remains 66 /97 variables (removed 31) and now considering 81/134 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8959974810308222078.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3414650738859615302.kers'
[2026-05-23 17:23:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8959974810308222078.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3414650738859615302.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 81 rows 66 cols 260 entries
Finished phase 1 with 62 SingleSign rule and 2 generalized
[2026-05-23 17:23:50] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3414650738859615302.kers
Total runtime 1 ms.
[2026-05-23 17:23:50] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-23 17:23:50] [INFO ] Invariant cache hit.
[2026-05-23 17:23:50] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 17:23:51] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2026-05-23 17:23:51] [INFO ] Invariant cache hit.
[2026-05-23 17:23:51] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/147 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 28/96 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/147 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 96 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3265 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/147 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 28/96 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 80/176 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/147 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 176 constraints, problems are : Problem set: 0 solved, 80 unsolved in 10717 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14032ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 14033ms
Starting structural reductions in LTL mode, iteration 1 : 66/97 places, 81/134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14384 ms. Remains : 66/97 places, 81/134 transitions.
[2026-05-23 17:24:05] [INFO ] Flatten gal took : 11 ms
[2026-05-23 17:24:05] [INFO ] Flatten gal took : 10 ms
[2026-05-23 17:24:05] [INFO ] Input system was already deterministic with 81 transitions.
[2026-05-23 17:24:05] [INFO ] Flatten gal took : 10 ms
[2026-05-23 17:24:05] [INFO ] Flatten gal took : 10 ms
[2026-05-23 17:24:05] [INFO ] Time to serialize gal into /tmp/CTLFireability13341148607799876581.gal : 3 ms
[2026-05-23 17:24:05] [INFO ] Time to serialize properties into /tmp/CTLFireability8220325826835699412.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/CTLFireability13341148607799876581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8220325826835699412.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,4.16556e+07,6.29871,127816,2,16561,5,535377,6,0,345,496608,0


Converting to forward existential form...Done !
original formula: E(!(((s1>=1)&&(l335>=1))) U (((s1>=1)&&(l491>=1)) * ((A(((s1>=1)&&(l110>=1)) U ((s1>=1)&&(l0>=1))) + AF(((p24>=1)&&(l0>=1)))) + EX(((s1>=...173
=> equivalent forward existential formula: (([(((FwdU(Init,!(((s1>=1)&&(l335>=1)))) * ((s1>=1)&&(l491>=1))) * !(EG(!(((s1>=1)&&(l0>=1)))))) * !(E(!(((s1>=1...443
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t42, t43, t44, t50, t52, t53, t54, t59, t60, t61, t62, t63, t64, t6...331
Hit Full ! (commute/partial/dont) 1/0/80
Detected timeout of ITS tools.
[2026-05-23 17:24:35] [INFO ] Flatten gal took : 6 ms
[2026-05-23 17:24:35] [INFO ] Applying decomposition
[2026-05-23 17:24:35] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14916773421274288803.txt' '-o' '/tmp/graph14916773421274288803.bin' '-w' '/tmp/graph14916773421274288803.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14916773421274288803.bin' '-l' '-1' '-v' '-w' '/tmp/graph14916773421274288803.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:24:35] [INFO ] Decomposing Gal with order
[2026-05-23 17:24:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:24:35] [INFO ] Removed a total of 82 redundant transitions.
[2026-05-23 17:24:35] [INFO ] Flatten gal took : 14 ms
[2026-05-23 17:24:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 6 ms.
[2026-05-23 17:24:35] [INFO ] Time to serialize gal into /tmp/CTLFireability17774355489451454837.gal : 3 ms
[2026-05-23 17:24:35] [INFO ] Time to serialize properties into /tmp/CTLFireability10878986027836049982.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/CTLFireability17774355489451454837.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10878986027836049982.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,4.16556e+07,11.8561,199016,2556,1032,172245,32718,251,1.45277e+06,71,333243,0


Converting to forward existential form...Done !
original formula: E(!(((i3.u1.s1>=1)&&(i3.u1.l335>=1))) U (((i3.u1.s1>=1)&&(i6.u14.l491>=1)) * ((A(((i3.u1.s1>=1)&&(i0.u5.l110>=1)) U ((i3.u1.s1>=1)&&(i3.u...247
=> equivalent forward existential formula: (([(((FwdU(Init,!(((i3.u1.s1>=1)&&(i3.u1.l335>=1)))) * ((i3.u1.s1>=1)&&(i6.u14.l491>=1))) * !(EG(!(((i3.u1.s1>=1...591
Reverse transition relation is NOT exact ! Due to transitions t6, t9, t28, t42, t43, t44, t52, t53, t54, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, ...324
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 78 transition count 102
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 78 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 78 transition count 101
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 45 place count 72 transition count 95
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 72 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 72 transition count 93
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 70 transition count 90
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 70 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 70 transition count 89
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 69 transition count 87
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 69 transition count 87
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 68 transition count 86
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 68 transition count 86
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 67 transition count 85
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 67 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 66 place count 67 transition count 83
Applied a total of 66 rules in 10 ms. Remains 67 /97 variables (removed 30) and now considering 83/134 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8880437026694496256.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11558501603239099164.kers'
[2026-05-23 17:25:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8880437026694496256.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11558501603239099164.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 83 rows 67 cols 262 entries
Finished phase 1 with 63 SingleSign rule and 2 generalized
[2026-05-23 17:25:05] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11558501603239099164.kers
Total runtime 1 ms.
[2026-05-23 17:25:05] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-23 17:25:05] [INFO ] Invariant cache hit.
[2026-05-23 17:25:05] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-23 17:25:05] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2026-05-23 17:25:05] [INFO ] Invariant cache hit.
[2026-05-23 17:25:05] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/150 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 31/100 constraints. Problems are: Problem set: 0 solved, 82 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/150 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 100 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2987 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/150 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 31/100 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 82/182 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/150 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 182 constraints, problems are : Problem set: 0 solved, 82 unsolved in 11840 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14869ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 14869ms
Starting structural reductions in LTL mode, iteration 1 : 67/97 places, 83/134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15155 ms. Remains : 67/97 places, 83/134 transitions.
[2026-05-23 17:25:20] [INFO ] Flatten gal took : 10 ms
[2026-05-23 17:25:20] [INFO ] Flatten gal took : 9 ms
[2026-05-23 17:25:20] [INFO ] Input system was already deterministic with 83 transitions.
[2026-05-23 17:25:20] [INFO ] Flatten gal took : 8 ms
[2026-05-23 17:25:20] [INFO ] Flatten gal took : 7 ms
[2026-05-23 17:25:20] [INFO ] Time to serialize gal into /tmp/CTLFireability10335384708937389366.gal : 2 ms
[2026-05-23 17:25:20] [INFO ] Time to serialize properties into /tmp/CTLFireability15386934297566345265.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/CTLFireability10335384708937389366.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15386934297566345265.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,3.74328e+07,17.2892,318644,2,31427,5,1.06774e+06,6,0,351,1.3487e+06,0


Converting to forward existential form...Done !
original formula: (EF(EG(A(EX(((s1>=1)&&(l125>=1))) U ((!((s1>=1)&&(l149>=1)))||(((s1>=1)&&(l488>=1))&&((s1>=1)&&(l114>=1))))))) * EF(((AX(((p34<1)||(l122<...215
=> equivalent forward existential formula: (([(FwdU((Init * E(TRUE U EG(!((E(!(((!((s1>=1)&&(l149>=1)))||(((s1>=1)&&(l488>=1))&&((s1>=1)&&(l114>=1))))) U (...1101
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t50, t51, t5...371
Detected timeout of ITS tools.
[2026-05-23 17:25:50] [INFO ] Flatten gal took : 8 ms
[2026-05-23 17:25:50] [INFO ] Applying decomposition
[2026-05-23 17:25:50] [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/graph9245265736828803919.txt' '-o' '/tmp/graph9245265736828803919.bin' '-w' '/tmp/graph9245265736828803919.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9245265736828803919.bin' '-l' '-1' '-v' '-w' '/tmp/graph9245265736828803919.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:25:50] [INFO ] Decomposing Gal with order
[2026-05-23 17:25:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:25:50] [INFO ] Removed a total of 81 redundant transitions.
[2026-05-23 17:25:50] [INFO ] Flatten gal took : 19 ms
[2026-05-23 17:25:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 8 ms.
[2026-05-23 17:25:50] [INFO ] Time to serialize gal into /tmp/CTLFireability8765464001280608570.gal : 4 ms
[2026-05-23 17:25:50] [INFO ] Time to serialize properties into /tmp/CTLFireability2693195381280850934.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/CTLFireability8765464001280608570.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2693195381280850934.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 77 transition count 97
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 77 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 77 transition count 96
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 49 place count 69 transition count 88
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 69 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 59 place count 69 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 68 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 68 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 67 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 67 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 66 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 66 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 66 transition count 79
Applied a total of 67 rules in 10 ms. Remains 66 /97 variables (removed 31) and now considering 79/134 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9498241961431383617.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11270488907812151565.kers'
[2026-05-23 17:26:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9498241961431383617.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11270488907812151565.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 79 rows 66 cols 257 entries
Finished phase 1 with 62 SingleSign rule and 2 generalized
[2026-05-23 17:26:20] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11270488907812151565.kers
Total runtime 1 ms.
[2026-05-23 17:26:20] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-23 17:26:20] [INFO ] Invariant cache hit.
[2026-05-23 17:26:21] [INFO ] State equation strengthened by 26 read => feed constraints.
[2026-05-23 17:26:21] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2026-05-23 17:26:21] [INFO ] Invariant cache hit.
[2026-05-23 17:26:21] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 79/145 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 26/94 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/145 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 94 constraints, problems are : Problem set: 0 solved, 78 unsolved in 3009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 79/145 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 26/94 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 78/172 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/145 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 172 constraints, problems are : Problem set: 0 solved, 78 unsolved in 10721 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13751ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 13751ms
Starting structural reductions in LTL mode, iteration 1 : 66/97 places, 79/134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14060 ms. Remains : 66/97 places, 79/134 transitions.
[2026-05-23 17:26:34] [INFO ] Flatten gal took : 4 ms
[2026-05-23 17:26:34] [INFO ] Flatten gal took : 4 ms
[2026-05-23 17:26:34] [INFO ] Input system was already deterministic with 79 transitions.
[2026-05-23 17:26:34] [INFO ] Flatten gal took : 4 ms
[2026-05-23 17:26:34] [INFO ] Flatten gal took : 4 ms
[2026-05-23 17:26:34] [INFO ] Time to serialize gal into /tmp/CTLFireability10927750992494155616.gal : 3 ms
[2026-05-23 17:26:34] [INFO ] Time to serialize properties into /tmp/CTLFireability9353513447102827107.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/CTLFireability10927750992494155616.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9353513447102827107.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,4.45398e+07,3.31537,77036,2,12907,5,282975,6,0,343,330210,0


Converting to forward existential form...Done !
original formula: AG((AF(AX(((s1<1)||(l502<1)))) * ((p18<1)||(l115<1))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(!(EX(!(((s1<1)||(l502<1)))))))] = FALSE * [(FwdU(Init,TRUE) * !(((p18<1)||(l115<1))))] ...163
(forward)formula 0,0,3.33205,77036,1,0,8,282975,9,2,354,330210,1
FORMULA DBSingleClientW-PT-d0m09-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 81 transition count 106
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 81 transition count 106
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 75 transition count 100
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 75 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 75 transition count 99
Applied a total of 45 rules in 3 ms. Remains 75 /97 variables (removed 22) and now considering 99/134 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4600067324857705869.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8993522107347446083.kers'
[2026-05-23 17:26:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4600067324857705869.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8993522107347446083.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 99 rows 75 cols 313 entries
Finished phase 1 with 71 SingleSign rule and 2 generalized
[2026-05-23 17:26:38] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8993522107347446083.kers
Total runtime 1 ms.
[2026-05-23 17:26:38] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-23 17:26:38] [INFO ] Invariant cache hit.
[2026-05-23 17:26:38] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-23 17:26:38] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2026-05-23 17:26:38] [INFO ] Invariant cache hit.
[2026-05-23 17:26:38] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 99/174 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 37/114 constraints. Problems are: Problem set: 0 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/174 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 114 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3648 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 99/174 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 37/114 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 98/212 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/174 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 212 constraints, problems are : Problem set: 0 solved, 98 unsolved in 22001 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25678ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 25679ms
Starting structural reductions in LTL mode, iteration 1 : 75/97 places, 99/134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25945 ms. Remains : 75/97 places, 99/134 transitions.
[2026-05-23 17:27:04] [INFO ] Flatten gal took : 5 ms
[2026-05-23 17:27:04] [INFO ] Flatten gal took : 5 ms
[2026-05-23 17:27:04] [INFO ] Input system was already deterministic with 99 transitions.
[2026-05-23 17:27:04] [INFO ] Flatten gal took : 4 ms
[2026-05-23 17:27:04] [INFO ] Flatten gal took : 5 ms
[2026-05-23 17:27:04] [INFO ] Time to serialize gal into /tmp/CTLFireability13729570584073394076.gal : 1 ms
[2026-05-23 17:27:04] [INFO ] Time to serialize properties into /tmp/CTLFireability1108924553788086477.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/CTLFireability13729570584073394076.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1108924553788086477.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.18465e+08,25.9503,446852,2,31334,5,1.58549e+06,6,0,399,2.00174e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 17:27:34] [INFO ] Flatten gal took : 5 ms
[2026-05-23 17:27:34] [INFO ] Applying decomposition
[2026-05-23 17:27:34] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8461771096714283679.txt' '-o' '/tmp/graph8461771096714283679.bin' '-w' '/tmp/graph8461771096714283679.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8461771096714283679.bin' '-l' '-1' '-v' '-w' '/tmp/graph8461771096714283679.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:27:34] [INFO ] Decomposing Gal with order
[2026-05-23 17:27:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:27:34] [INFO ] Removed a total of 90 redundant transitions.
[2026-05-23 17:27:34] [INFO ] Flatten gal took : 12 ms
[2026-05-23 17:27:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 6 ms.
[2026-05-23 17:27:34] [INFO ] Time to serialize gal into /tmp/CTLFireability9150046757014372635.gal : 3 ms
[2026-05-23 17:27:34] [INFO ] Time to serialize properties into /tmp/CTLFireability735275449054710218.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/CTLFireability9150046757014372635.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability735275449054710218.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 -...261
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.18465e+08,26.5376,352508,3202,1922,214616,33179,303,2.74316e+06,125,550772,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 75 transition count 93
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 75 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 75 transition count 92
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 67 transition count 84
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 67 transition count 82
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 66 place count 64 transition count 76
Iterating global reduction 2 with 3 rules applied. Total rules applied 69 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 64 transition count 75
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 62 transition count 72
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 62 transition count 72
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 60 transition count 70
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 80 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 81 place count 59 transition count 67
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 59 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 84 place count 59 transition count 65
Applied a total of 84 rules in 10 ms. Remains 59 /97 variables (removed 38) and now considering 65/134 (removed 69) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10894937318794991284.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3940848199030693080.kers'
[2026-05-23 17:28:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10894937318794991284.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3940848199030693080.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 65 rows 59 cols 214 entries
Finished phase 1 with 55 SingleSign rule and 2 generalized
[2026-05-23 17:28:04] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3940848199030693080.kers
Total runtime 1 ms.
[2026-05-23 17:28:04] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-23 17:28:04] [INFO ] Invariant cache hit.
[2026-05-23 17:28:04] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 17:28:04] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2026-05-23 17:28:04] [INFO ] Invariant cache hit.
[2026-05-23 17:28:04] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 65/124 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 85 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2366 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 65/124 variables, 59/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 64/149 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 149 constraints, problems are : Problem set: 0 solved, 64 unsolved in 8631 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11011ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 11013ms
Starting structural reductions in LTL mode, iteration 1 : 59/97 places, 65/134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11235 ms. Remains : 59/97 places, 65/134 transitions.
[2026-05-23 17:28:15] [INFO ] Flatten gal took : 4 ms
[2026-05-23 17:28:15] [INFO ] Flatten gal took : 6 ms
[2026-05-23 17:28:15] [INFO ] Input system was already deterministic with 65 transitions.
[2026-05-23 17:28:15] [INFO ] Flatten gal took : 2 ms
[2026-05-23 17:28:15] [INFO ] Flatten gal took : 2 ms
[2026-05-23 17:28:15] [INFO ] Time to serialize gal into /tmp/CTLFireability178435169420818181.gal : 1 ms
[2026-05-23 17:28:15] [INFO ] Time to serialize properties into /tmp/CTLFireability9423318355367365517.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/CTLFireability178435169420818181.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9423318355367365517.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,7.74095e+06,4.33988,87624,2,17098,5,321728,6,0,301,346912,0


Converting to forward existential form...Done !
original formula: AF(EG((((s5>=1)&&(l0>=1)) * (AX(((s1<1)||(l110<1))) + EF(((p13<1)||(l155<1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG((((s5>=1)&&(l0>=1)) * (!(EX(!(((s1<1)||(l110<1))))) + E(TRUE U ((p13<1)||(l155<1))))))))] = FALS...156
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t40, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t5...291
Using saturation style SCC detection
(forward)formula 0,0,15.7049,247780,1,0,150,1.01393e+06,164,65,2214,1.14321e+06,168
FORMULA DBSingleClientW-PT-d0m09-CTLFireability-2024-06 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 : 97/97 places, 134/134 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 77 transition count 95
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 77 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 77 transition count 94
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 49 place count 69 transition count 86
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 69 transition count 86
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 69 transition count 85
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 66 transition count 79
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 66 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 66 transition count 78
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 67 place count 64 transition count 75
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 63 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 63 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 73 place count 63 transition count 72
Applied a total of 73 rules in 12 ms. Remains 63 /97 variables (removed 34) and now considering 72/134 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14173462920360259788.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13350509227755570457.kers'
[2026-05-23 17:28:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14173462920360259788.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13350509227755570457.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 72 rows 63 cols 240 entries
Finished phase 1 with 59 SingleSign rule and 2 generalized
[2026-05-23 17:28:31] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13350509227755570457.kers
Total runtime 1 ms.
[2026-05-23 17:28:31] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-23 17:28:31] [INFO ] Invariant cache hit.
[2026-05-23 17:28:31] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 17:28:31] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 71 sub problems to find dead transitions.
[2026-05-23 17:28:31] [INFO ] Invariant cache hit.
[2026-05-23 17:28:31] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/135 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/135 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 86 constraints, problems are : Problem set: 0 solved, 71 unsolved in 2371 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/135 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 71/157 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 157 constraints, problems are : Problem set: 0 solved, 71 unsolved in 12135 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14526ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 14526ms
Starting structural reductions in LTL mode, iteration 1 : 63/97 places, 72/134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14763 ms. Remains : 63/97 places, 72/134 transitions.
[2026-05-23 17:28:46] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:28:46] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:28:46] [INFO ] Input system was already deterministic with 72 transitions.
[2026-05-23 17:28:46] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:28:46] [INFO ] Flatten gal took : 2 ms
[2026-05-23 17:28:46] [INFO ] Time to serialize gal into /tmp/CTLFireability2912605326242971392.gal : 1 ms
[2026-05-23 17:28:46] [INFO ] Time to serialize properties into /tmp/CTLFireability9281159845645036574.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/CTLFireability2912605326242971392.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9281159845645036574.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.26346e+07,4.02765,81704,2,17316,5,279924,6,0,324,328519,0


Converting to forward existential form...Done !
original formula: AX(EG(((AF(((s6<1)||(l0<1))) * EF(((p12<1)||(l0<1)))) * (EF(((s1<1)||(l91<1))) + (((p33<1)||(l0<1))&&((s1<1)||(l336<1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(((!(EG(!(((s6<1)||(l0<1))))) * E(TRUE U ((p12<1)||(l0<1)))) * (E(TRUE U ((s1<1)||(l91<1))) + (...207
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t44, t49, t50, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, t6...306
Detected timeout of ITS tools.
[2026-05-23 17:29:16] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:29:16] [INFO ] Applying decomposition
[2026-05-23 17:29:16] [INFO ] Flatten gal took : 2 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/graph17652930987500072911.txt' '-o' '/tmp/graph17652930987500072911.bin' '-w' '/tmp/graph17652930987500072911.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17652930987500072911.bin' '-l' '-1' '-v' '-w' '/tmp/graph17652930987500072911.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:29:16] [INFO ] Decomposing Gal with order
[2026-05-23 17:29:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:29:16] [INFO ] Removed a total of 75 redundant transitions.
[2026-05-23 17:29:16] [INFO ] Flatten gal took : 9 ms
[2026-05-23 17:29:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 4 ms.
[2026-05-23 17:29:16] [INFO ] Time to serialize gal into /tmp/CTLFireability9112350202637400964.gal : 1 ms
[2026-05-23 17:29:16] [INFO ] Time to serialize properties into /tmp/CTLFireability7736570311051541436.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/CTLFireability9112350202637400964.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7736570311051541436.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.26346e+07,13.1485,208104,2834,534,218470,7887,236,1.39364e+06,60,159388,0


Converting to forward existential form...Done !
original formula: AX(EG(((AF(((i0.u6.s6<1)||(i2.u0.l0<1))) * EF(((i0.u6.p12<1)||(i2.u0.l0<1)))) * (EF(((i2.u0.s1<1)||(u8.l91<1))) + (((i6.u2.p33<1)||(i2.u0...199
=> equivalent forward existential formula: [(EY(Init) * !(EG(((!(EG(!(((i0.u6.s6<1)||(i2.u0.l0<1))))) * E(TRUE U ((i0.u6.p12<1)||(i2.u0.l0<1)))) * (E(TRUE ...264
Reverse transition relation is NOT exact ! Due to transitions t2, t9, t24, t44, t49, t50, t51, t52, t53, t54, t55, t56, t57, t59, t60, t62, t63, t66, t67, ...294
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 76 transition count 98
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 76 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 76 transition count 97
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 52 place count 67 transition count 88
Iterating global reduction 1 with 9 rules applied. Total rules applied 61 place count 67 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 67 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 66 place count 64 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 69 place count 64 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 64 transition count 79
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 62 transition count 76
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 62 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 60 transition count 74
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 60 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 80 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 81 place count 59 transition count 71
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 59 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 84 place count 59 transition count 69
Applied a total of 84 rules in 22 ms. Remains 59 /97 variables (removed 38) and now considering 69/134 (removed 65) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11340278886108212915.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8019133307549572293.kers'
[2026-05-23 17:29:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11340278886108212915.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8019133307549572293.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 69 rows 59 cols 219 entries
Finished phase 1 with 55 SingleSign rule and 2 generalized
[2026-05-23 17:29:46] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8019133307549572293.kers
Total runtime 1 ms.
[2026-05-23 17:29:46] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-23 17:29:46] [INFO ] Invariant cache hit.
[2026-05-23 17:29:46] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-23 17:29:46] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2026-05-23 17:29:46] [INFO ] Redundant transitions in 1 ms returned []
Running 68 sub problems to find dead transitions.
[2026-05-23 17:29:46] [INFO ] Invariant cache hit.
[2026-05-23 17:29:46] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/128 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 25/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 86 constraints, problems are : Problem set: 0 solved, 68 unsolved in 2007 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/128 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 25/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 68/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 154 constraints, problems are : Problem set: 0 solved, 68 unsolved in 6611 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8637ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 8638ms
Starting structural reductions in SI_CTL mode, iteration 1 : 59/97 places, 69/134 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8878 ms. Remains : 59/97 places, 69/134 transitions.
[2026-05-23 17:29:55] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:29:55] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:29:55] [INFO ] Input system was already deterministic with 69 transitions.
[2026-05-23 17:29:55] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:29:55] [INFO ] Flatten gal took : 2 ms
[2026-05-23 17:29:55] [INFO ] Time to serialize gal into /tmp/CTLFireability18007359044810782675.gal : 0 ms
[2026-05-23 17:29:55] [INFO ] Time to serialize properties into /tmp/CTLFireability4880952551597564130.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/CTLFireability18007359044810782675.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4880952551597564130.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,8.16082e+06,2.42635,56836,2,14057,5,202797,6,0,305,225135,0


Converting to forward existential form...Done !
original formula: AG(AF(((s1>=1)&&(l150>=1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((s1>=1)&&(l150>=1))))] = FALSE
Hit Full ! (commute/partial/dont) 1/0/68
(forward)formula 0,0,6.64471,118456,1,0,18,511153,20,3,1645,479082,16
FORMULA DBSingleClientW-PT-d0m09-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 75 transition count 93
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 75 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 75 transition count 92
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 54 place count 66 transition count 83
Iterating global reduction 1 with 9 rules applied. Total rules applied 63 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 66 transition count 81
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 64 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 62 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 61 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 61 transition count 71
Applied a total of 77 rules in 4 ms. Remains 61 /97 variables (removed 36) and now considering 71/134 (removed 63) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17987665814209379851.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12043511473918435971.kers'
[2026-05-23 17:30:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17987665814209379851.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12043511473918435971.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 71 rows 61 cols 234 entries
Finished phase 1 with 57 SingleSign rule and 2 generalized
[2026-05-23 17:30:02] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12043511473918435971.kers
Total runtime 1 ms.
[2026-05-23 17:30:02] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-23 17:30:02] [INFO ] Invariant cache hit.
[2026-05-23 17:30:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 17:30:02] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2026-05-23 17:30:02] [INFO ] Invariant cache hit.
[2026-05-23 17:30:02] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/132 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 22/85 constraints. Problems are: Problem set: 0 solved, 70 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 85 constraints, problems are : Problem set: 0 solved, 70 unsolved in 2160 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/132 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 22/85 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 70/155 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 155 constraints, problems are : Problem set: 0 solved, 70 unsolved in 7512 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9694ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 9694ms
Starting structural reductions in LTL mode, iteration 1 : 61/97 places, 71/134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10000 ms. Remains : 61/97 places, 71/134 transitions.
[2026-05-23 17:30:12] [INFO ] Flatten gal took : 4 ms
[2026-05-23 17:30:12] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:30:12] [INFO ] Input system was already deterministic with 71 transitions.
[2026-05-23 17:30:12] [INFO ] Flatten gal took : 2 ms
[2026-05-23 17:30:12] [INFO ] Flatten gal took : 2 ms
[2026-05-23 17:30:12] [INFO ] Time to serialize gal into /tmp/CTLFireability11075093799451583769.gal : 2 ms
[2026-05-23 17:30:12] [INFO ] Time to serialize properties into /tmp/CTLFireability6813216451775146910.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/CTLFireability11075093799451583769.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6813216451775146910.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.73073e+07,3.69083,73436,2,11453,5,289217,6,0,315,278683,0


Converting to forward existential form...Done !
original formula: EF(EG(AX(((s1<1)||(l337<1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX(!(((s1<1)||(l337<1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t46, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t6...291
(forward)formula 0,1,9.40515,155840,1,0,151,753063,165,62,2204,795330,163
FORMULA DBSingleClientW-PT-d0m09-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 83 transition count 115
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 83 transition count 115
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 80 transition count 112
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 80 transition count 112
Applied a total of 34 rules in 2 ms. Remains 80 /97 variables (removed 17) and now considering 112/134 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5601012624206220683.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11637788937737728443.kers'
[2026-05-23 17:30:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5601012624206220683.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11637788937737728443.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 112 rows 80 cols 338 entries
Finished phase 1 with 76 SingleSign rule and 2 generalized
[2026-05-23 17:30:21] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11637788937737728443.kers
Total runtime 3 ms.
[2026-05-23 17:30:21] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-23 17:30:21] [INFO ] Invariant cache hit.
[2026-05-23 17:30:21] [INFO ] State equation strengthened by 49 read => feed constraints.
[2026-05-23 17:30:22] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2026-05-23 17:30:22] [INFO ] Invariant cache hit.
[2026-05-23 17:30:22] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/192 variables, 80/82 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 49/131 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 131 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4390 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 80/80 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/192 variables, 80/82 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 49/131 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 111/242 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 242 constraints, problems are : Problem set: 0 solved, 111 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 80/80 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34457ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 34457ms
Starting structural reductions in LTL mode, iteration 1 : 80/97 places, 112/134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34877 ms. Remains : 80/97 places, 112/134 transitions.
[2026-05-23 17:30:56] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:30:56] [INFO ] Flatten gal took : 4 ms
[2026-05-23 17:30:56] [INFO ] Input system was already deterministic with 112 transitions.
[2026-05-23 17:30:56] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:30:56] [INFO ] Flatten gal took : 4 ms
[2026-05-23 17:30:56] [INFO ] Time to serialize gal into /tmp/CTLFireability14997450378643013546.gal : 1 ms
[2026-05-23 17:30:56] [INFO ] Time to serialize properties into /tmp/CTLFireability3978031972700938310.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/CTLFireability14997450378643013546.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3978031972700938310.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.46337e+08,29.204,527448,2,23179,5,2.33903e+06,6,0,432,1.45809e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 17:31:26] [INFO ] Flatten gal took : 4 ms
[2026-05-23 17:31:26] [INFO ] Applying decomposition
[2026-05-23 17:31:26] [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/graph11627483147841834522.txt' '-o' '/tmp/graph11627483147841834522.bin' '-w' '/tmp/graph11627483147841834522.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11627483147841834522.bin' '-l' '-1' '-v' '-w' '/tmp/graph11627483147841834522.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:31:26] [INFO ] Decomposing Gal with order
[2026-05-23 17:31:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:31:26] [INFO ] Removed a total of 111 redundant transitions.
[2026-05-23 17:31:26] [INFO ] Flatten gal took : 11 ms
[2026-05-23 17:31:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 4 ms.
[2026-05-23 17:31:26] [INFO ] Time to serialize gal into /tmp/CTLFireability51417352690532395.gal : 2 ms
[2026-05-23 17:31:26] [INFO ] Time to serialize properties into /tmp/CTLFireability17436458482428801199.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/CTLFireability51417352690532395.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17436458482428801199.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 -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 78 transition count 102
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 78 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 78 transition count 101
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 71 transition count 94
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 71 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 71 transition count 92
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 69 transition count 87
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 69 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 69 transition count 86
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 68 transition count 85
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 68 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 67 transition count 84
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 66 place count 67 transition count 82
Applied a total of 66 rules in 20 ms. Remains 67 /97 variables (removed 30) and now considering 82/134 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-779013871145893998.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8637808168616916176.kers'
[2026-05-23 17:31:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-779013871145893998.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8637808168616916176.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 82 rows 67 cols 258 entries
Finished phase 1 with 63 SingleSign rule and 2 generalized
[2026-05-23 17:31:56] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8637808168616916176.kers
Total runtime 1 ms.
[2026-05-23 17:31:56] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-23 17:31:56] [INFO ] Invariant cache hit.
[2026-05-23 17:31:56] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-23 17:31:56] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2026-05-23 17:31:56] [INFO ] Redundant transitions in 1 ms returned []
Running 81 sub problems to find dead transitions.
[2026-05-23 17:31:56] [INFO ] Invariant cache hit.
[2026-05-23 17:31:56] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 82/149 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 31/100 constraints. Problems are: Problem set: 0 solved, 81 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 100 constraints, problems are : Problem set: 0 solved, 81 unsolved in 3236 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 82/149 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 31/100 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 81/181 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/149 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 181 constraints, problems are : Problem set: 0 solved, 81 unsolved in 10512 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13777ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 13778ms
Starting structural reductions in SI_CTL mode, iteration 1 : 67/97 places, 82/134 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14045 ms. Remains : 67/97 places, 82/134 transitions.
[2026-05-23 17:32:10] [INFO ] Flatten gal took : 2 ms
[2026-05-23 17:32:10] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:32:10] [INFO ] Input system was already deterministic with 82 transitions.
[2026-05-23 17:32:10] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:32:10] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:32:10] [INFO ] Time to serialize gal into /tmp/CTLFireability6286342177279922602.gal : 2 ms
[2026-05-23 17:32:10] [INFO ] Time to serialize properties into /tmp/CTLFireability12506934704514620873.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/CTLFireability6286342177279922602.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12506934704514620873.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.74792e+07,9.40792,179176,2,22100,5,637024,6,0,350,811970,0


Converting to forward existential form...Done !
original formula: EF(((EG(AG(((s1<1)||(l334<1)))) + EF((AG(AF(((s1>=1)&&(l149>=1)))) * A(((s1>=1)&&(l133>=1)) U ((s1>=1)&&(l336>=1)))))) + ((s1>=1)&&(l504>...161
=> equivalent forward existential formula: (([FwdG(FwdU(Init,TRUE),!(E(TRUE U !(((s1<1)||(l334<1))))))] != FALSE + [(((FwdU(FwdU(Init,TRUE),TRUE) * !(E(TRU...382
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t51, t54, t5...371
Detected timeout of ITS tools.
[2026-05-23 17:32:40] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:32:40] [INFO ] Applying decomposition
[2026-05-23 17:32:40] [INFO ] Flatten gal took : 3 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/graph12298903075749686724.txt' '-o' '/tmp/graph12298903075749686724.bin' '-w' '/tmp/graph12298903075749686724.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12298903075749686724.bin' '-l' '-1' '-v' '-w' '/tmp/graph12298903075749686724.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:32:40] [INFO ] Decomposing Gal with order
[2026-05-23 17:32:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:32:40] [INFO ] Removed a total of 76 redundant transitions.
[2026-05-23 17:32:40] [INFO ] Flatten gal took : 15 ms
[2026-05-23 17:32:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 2 ms.
[2026-05-23 17:32:40] [INFO ] Time to serialize gal into /tmp/CTLFireability15326755915562334555.gal : 9 ms
[2026-05-23 17:32:40] [INFO ] Time to serialize properties into /tmp/CTLFireability11661245541565988182.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/CTLFireability15326755915562334555.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11661245541565988182.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 76 transition count 94
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 76 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 76 transition count 93
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 52 place count 67 transition count 84
Iterating global reduction 1 with 9 rules applied. Total rules applied 61 place count 67 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 67 transition count 83
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 65 place count 64 transition count 77
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 64 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 64 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 71 place count 62 transition count 73
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 75 place count 60 transition count 71
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 60 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 79 place count 60 transition count 69
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 80 place count 59 transition count 68
Iterating global reduction 4 with 1 rules applied. Total rules applied 81 place count 59 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 83 place count 59 transition count 66
Applied a total of 83 rules in 9 ms. Remains 59 /97 variables (removed 38) and now considering 66/134 (removed 68) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3523014011774251848.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9321983324883292189.kers'
[2026-05-23 17:33:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3523014011774251848.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9321983324883292189.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 66 rows 59 cols 218 entries
Finished phase 1 with 55 SingleSign rule and 2 generalized
[2026-05-23 17:33:10] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9321983324883292189.kers
Total runtime 1 ms.
[2026-05-23 17:33:11] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-23 17:33:11] [INFO ] Invariant cache hit.
[2026-05-23 17:33:11] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 17:33:11] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2026-05-23 17:33:11] [INFO ] Invariant cache hit.
[2026-05-23 17:33:11] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/125 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2797 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 66/125 variables, 59/62 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 65/147 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/125 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 147 constraints, problems are : Problem set: 0 solved, 65 unsolved in 6865 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9685ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 9685ms
Starting structural reductions in LTL mode, iteration 1 : 59/97 places, 66/134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9932 ms. Remains : 59/97 places, 66/134 transitions.
[2026-05-23 17:33:20] [INFO ] Flatten gal took : 4 ms
[2026-05-23 17:33:20] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:33:20] [INFO ] Input system was already deterministic with 66 transitions.
[2026-05-23 17:33:20] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:33:20] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:33:20] [INFO ] Time to serialize gal into /tmp/CTLFireability9710807839859082836.gal : 2 ms
[2026-05-23 17:33:20] [INFO ] Time to serialize properties into /tmp/CTLFireability4328796994839490991.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/CTLFireability9710807839859082836.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4328796994839490991.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,7.77926e+06,4.77535,100436,2,16202,5,401913,6,0,302,375533,0


Converting to forward existential form...Done !
original formula: EX(AF(AG(((p30>=1)&&(l0>=1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(E(TRUE U !(((p30>=1)&&(l0>=1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t41, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t5...291
Detected timeout of ITS tools.
[2026-05-23 17:33:50] [INFO ] Flatten gal took : 4 ms
[2026-05-23 17:33:50] [INFO ] Applying decomposition
[2026-05-23 17:33:50] [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/graph4711431046650460159.txt' '-o' '/tmp/graph4711431046650460159.bin' '-w' '/tmp/graph4711431046650460159.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4711431046650460159.bin' '-l' '-1' '-v' '-w' '/tmp/graph4711431046650460159.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:33:50] [INFO ] Decomposing Gal with order
[2026-05-23 17:33:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:33:51] [INFO ] Removed a total of 72 redundant transitions.
[2026-05-23 17:33:51] [INFO ] Flatten gal took : 10 ms
[2026-05-23 17:33:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 4 ms.
[2026-05-23 17:33:51] [INFO ] Time to serialize gal into /tmp/CTLFireability11460610574407131141.gal : 3 ms
[2026-05-23 17:33:51] [INFO ] Time to serialize properties into /tmp/CTLFireability17025007566256273372.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/CTLFireability11460610574407131141.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17025007566256273372.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,7.77926e+06,1.46338,36868,1942,328,56278,8862,247,118051,49,35606,0


Converting to forward existential form...Done !
original formula: EX(AF(AG(((i4.u11.p30>=1)&&(i0.u1.l0>=1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(E(TRUE U !(((i4.u11.p30>=1)&&(i0.u1.l0>=1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t28, t41, t46, t47, t49, t50, t51, t52, t53, t54, t55, t57, t58, t60, t61, t63, t64, ...291
Fast SCC detection found an SCC at level 4
(forward)formula 0,0,22.754,368548,1,0,489900,72847,969,2.10349e+06,295,332620,674148
FORMULA DBSingleClientW-PT-d0m09-CTLFireability-2024-13 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 : 97/97 places, 134/134 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 77 transition count 95
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 77 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 77 transition count 94
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 50 place count 68 transition count 85
Iterating global reduction 1 with 9 rules applied. Total rules applied 59 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 66 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 65 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 64 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 63 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 63 transition count 73
Applied a total of 74 rules in 28 ms. Remains 63 /97 variables (removed 34) and now considering 73/134 (removed 61) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8358629463369690163.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6137433668413577912.kers'
[2026-05-23 17:34:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8358629463369690163.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6137433668413577912.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 73 rows 63 cols 244 entries
Finished phase 1 with 59 SingleSign rule and 2 generalized
[2026-05-23 17:34:13] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6137433668413577912.kers
Total runtime 1 ms.
[2026-05-23 17:34:14] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-23 17:34:14] [INFO ] Invariant cache hit.
[2026-05-23 17:34:14] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 17:34:14] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2026-05-23 17:34:14] [INFO ] Redundant transitions in 2 ms returned []
Running 72 sub problems to find dead transitions.
[2026-05-23 17:34:14] [INFO ] Invariant cache hit.
[2026-05-23 17:34:14] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 0/136 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 92 constraints, problems are : Problem set: 0 solved, 72 unsolved in 4220 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 73/136 variables, 63/71 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 21/92 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 72/164 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/136 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 164 constraints, problems are : Problem set: 0 solved, 72 unsolved in 8406 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12673ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 12673ms
Starting structural reductions in SI_CTL mode, iteration 1 : 63/97 places, 73/134 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12966 ms. Remains : 63/97 places, 73/134 transitions.
[2026-05-23 17:34:26] [INFO ] Flatten gal took : 4 ms
[2026-05-23 17:34:26] [INFO ] Flatten gal took : 3 ms
[2026-05-23 17:34:26] [INFO ] Input system was already deterministic with 73 transitions.
[2026-05-23 17:34:26] [INFO ] Flatten gal took : 2 ms
[2026-05-23 17:34:26] [INFO ] Flatten gal took : 2 ms
[2026-05-23 17:34:26] [INFO ] Time to serialize gal into /tmp/CTLFireability16108927330164112015.gal : 1 ms
[2026-05-23 17:34:26] [INFO ] Time to serialize properties into /tmp/CTLFireability14683839862211611569.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/CTLFireability16108927330164112015.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14683839862211611569.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.83195e+07,8.40874,147784,2,20182,5,496669,6,0,325,637942,0


Converting to forward existential form...Done !
original formula: EG(EF(!(E(((p36>=1)&&(l137>=1)) U ((s7>=1)&&(l0>=1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(((p36>=1)&&(l137>=1)) U ((s7>=1)&&(l0>=1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t43, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t6...301
(forward)formula 0,1,25.1937,363108,1,0,156,1.44352e+06,175,63,2359,1.57644e+06,180
FORMULA DBSingleClientW-PT-d0m09-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-23 17:34:52] [INFO ] Flatten gal took : 5 ms
[2026-05-23 17:34:52] [INFO ] Flatten gal took : 4 ms
[2026-05-23 17:34:52] [INFO ] Applying decomposition
[2026-05-23 17:34:52] [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/graph4177691162669988452.txt' '-o' '/tmp/graph4177691162669988452.bin' '-w' '/tmp/graph4177691162669988452.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4177691162669988452.bin' '-l' '-1' '-v' '-w' '/tmp/graph4177691162669988452.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:34:52] [INFO ] Decomposing Gal with order
[2026-05-23 17:34:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:34:52] [INFO ] Removed a total of 139 redundant transitions.
[2026-05-23 17:34:52] [INFO ] Flatten gal took : 12 ms
[2026-05-23 17:34:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 105 labels/synchronizations in 4 ms.
[2026-05-23 17:34:52] [INFO ] Time to serialize gal into /tmp/CTLFireability12533675213322465585.gal : 2 ms
[2026-05-23 17:34:52] [INFO ] Time to serialize properties into /tmp/CTLFireability967147062052523305.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/CTLFireability12533675213322465585.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability967147062052523305.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 7 CTL formulae.
Detected timeout of ITS tools.
[2026-05-23 17:59:34] [INFO ] Flatten gal took : 6 ms
[2026-05-23 17:59:34] [INFO ] Time to serialize gal into /tmp/CTLFireability17901768339879413771.gal : 1 ms
[2026-05-23 17:59:34] [INFO ] Time to serialize properties into /tmp/CTLFireability11417792596289827715.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/CTLFireability17901768339879413771.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11417792596289827715.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 7 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.83593e+08,239.32,3945072,2,146152,5,1.30721e+07,6,0,522,1.03186e+07,0


Converting to forward existential form...Done !
original formula: (AG((A((EX(((s1>=1)&&(l125>=1))) + (((A(!(((s1<1)||(l149<1))) U ((s1>=1)&&(l510>=1))) * (s1>=1)) * ((l339>=1)&&(s1>=1))) * (l496>=1))) U ...448
=> equivalent forward existential formula: ([(FwdU(((FwdU((Init * !(!(E(TRUE U !((!((E(!(((s1>=1)&&(l33>=1))) U (!((EX(((s1>=1)&&(l125>=1))) + (((!((E(!(((...1269
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t19, t21, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35,...569

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d0m09"
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 DBSingleClientW-PT-d0m09, 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 r082-smll-177946993500122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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