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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.8K Mar 6 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 6 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Mar 6 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Mar 6 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 08:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 08:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Mar 6 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 6 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Mar 6 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Mar 6 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:49 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 1.6M 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-d2m04-CTLFireability-2024-00
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2024-01
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2024-02
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2024-03
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2024-04
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2024-05
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2024-06
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2024-07
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2024-08
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2024-09
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2024-10
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2024-11
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2024-12
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2024-13
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2024-14
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779596993568

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-d2m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 04:29:55] [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-24 04:29:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 04:29:55] [INFO ] Load time of PNML (sax parser for PT used): 419 ms
[2026-05-24 04:29:55] [INFO ] Transformed 4763 places.
[2026-05-24 04:29:55] [INFO ] Transformed 2478 transitions.
[2026-05-24 04:29:56] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 600 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Deduced a syphon composed of 3580 places in 23 ms
Reduce places removed 3580 places and 0 transitions.
Support contains 77 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 354 places :
Symmetric choice reduction at 1 with 354 rule applications. Total rules 599 place count 783 transition count 1559
Iterating global reduction 1 with 354 rules applied. Total rules applied 953 place count 783 transition count 1559
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 1009 place count 783 transition count 1503
Discarding 281 places :
Symmetric choice reduction at 2 with 281 rule applications. Total rules 1290 place count 502 transition count 1222
Iterating global reduction 2 with 281 rules applied. Total rules applied 1571 place count 502 transition count 1222
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 1576 place count 502 transition count 1217
Discarding 187 places :
Symmetric choice reduction at 3 with 187 rule applications. Total rules 1763 place count 315 transition count 960
Iterating global reduction 3 with 187 rules applied. Total rules applied 1950 place count 315 transition count 960
Ensure Unique test removed 242 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 3 with 242 rules applied. Total rules applied 2192 place count 315 transition count 718
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 2205 place count 302 transition count 699
Iterating global reduction 4 with 13 rules applied. Total rules applied 2218 place count 302 transition count 699
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 2226 place count 302 transition count 691
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 2234 place count 294 transition count 683
Iterating global reduction 5 with 8 rules applied. Total rules applied 2242 place count 294 transition count 683
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2246 place count 294 transition count 679
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 2251 place count 289 transition count 674
Iterating global reduction 6 with 5 rules applied. Total rules applied 2256 place count 289 transition count 674
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2264 place count 289 transition count 666
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2265 place count 288 transition count 664
Iterating global reduction 7 with 1 rules applied. Total rules applied 2266 place count 288 transition count 664
Applied a total of 2266 rules in 294 ms. Remains 288 /1183 variables (removed 895) and now considering 664/2478 (removed 1814) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13928357692990558235.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6630247907106016612.kers'
[2026-05-24 04:29:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13928357692990558235.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6630247907106016612.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 664 rows 288 cols 1838 entries
Finished phase 1 with 284 SingleSign rule and 2 generalized
[2026-05-24 04:29:56] [INFO ] Computed 2 invariants in 5 ms
Computed 2 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-6630247907106016612.kers
Total runtime 8 ms.
[2026-05-24 04:29:57] [INFO ] Implicit Places using invariants in 784 ms returned []
[2026-05-24 04:29:57] [INFO ] Invariant cache hit.
[2026-05-24 04:29:57] [INFO ] State equation strengthened by 388 read => feed constraints.
[2026-05-24 04:29:59] [INFO ] Implicit Places using invariants and state equation in 2450 ms returned []
Implicit Place search using SMT with State Equation took 3288 ms to find 0 implicit places.
Running 663 sub problems to find dead transitions.
[2026-05-24 04:29:59] [INFO ] Invariant cache hit.
[2026-05-24 04:29:59] [INFO ] State equation strengthened by 388 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (OVERLAPS) 1/288 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 663 unsolved
SMT process timed out in 31767ms, After SMT, problems are : Problem set: 0 solved, 663 unsolved
Search for dead transitions found 0 dead transitions in 31798ms
Starting structural reductions in LTL mode, iteration 1 : 288/1183 places, 664/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35439 ms. Remains : 288/1183 places, 664/2478 transitions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 664/664 transitions.
Applied a total of 0 rules in 13 ms. Remains 288 /288 variables (removed 0) and now considering 664/664 (removed 0) transitions.
[2026-05-24 04:30:31] [INFO ] Invariant cache hit.
[2026-05-24 04:30:32] [INFO ] Implicit Places using invariants in 511 ms returned []
[2026-05-24 04:30:32] [INFO ] Invariant cache hit.
[2026-05-24 04:30:32] [INFO ] State equation strengthened by 388 read => feed constraints.
[2026-05-24 04:30:33] [INFO ] Implicit Places using invariants and state equation in 1838 ms returned []
Implicit Place search using SMT with State Equation took 2351 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2365 ms. Remains : 288/288 places, 664/664 transitions.
Support contains 77 out of 288 places after structural reductions.
[2026-05-24 04:30:34] [INFO ] Flatten gal took : 126 ms
[2026-05-24 04:30:34] [INFO ] Flatten gal took : 67 ms
[2026-05-24 04:30:34] [INFO ] Input system was already deterministic with 664 transitions.
RANDOM walk for 40000 steps (9301 resets) in 4709 ms. (8 steps per ms) remains 48/50 properties
BEST_FIRST walk for 4004 steps (157 resets) in 57 ms. (69 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (179 resets) in 54 ms. (72 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (174 resets) in 43 ms. (90 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (175 resets) in 83 ms. (47 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (178 resets) in 55 ms. (71 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (172 resets) in 53 ms. (74 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (168 resets) in 49 ms. (80 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (166 resets) in 32 ms. (121 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (174 resets) in 28 ms. (138 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (170 resets) in 29 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (362 resets) in 39 ms. (100 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (372 resets) in 38 ms. (102 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (181 resets) in 36 ms. (108 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (171 resets) in 27 ms. (142 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (174 resets) in 67 ms. (58 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (179 resets) in 41 ms. (95 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (382 resets) in 74 ms. (53 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (368 resets) in 79 ms. (50 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (163 resets) in 43 ms. (91 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (185 resets) in 45 ms. (87 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (181 resets) in 36 ms. (108 steps per ms) remains 47/48 properties
BEST_FIRST walk for 4002 steps (209 resets) in 39 ms. (100 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (420 resets) in 63 ms. (62 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (170 resets) in 35 ms. (111 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (170 resets) in 28 ms. (138 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (176 resets) in 36 ms. (108 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (161 resets) in 39 ms. (100 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (373 resets) in 67 ms. (58 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (383 resets) in 54 ms. (72 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (171 resets) in 40 ms. (97 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (365 resets) in 45 ms. (86 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (164 resets) in 28 ms. (138 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (382 resets) in 77 ms. (51 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (163 resets) in 47 ms. (83 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (172 resets) in 38 ms. (102 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (171 resets) in 41 ms. (95 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (177 resets) in 36 ms. (108 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (173 resets) in 34 ms. (114 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (177 resets) in 34 ms. (114 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (371 resets) in 46 ms. (85 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (207 resets) in 45 ms. (86 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (186 resets) in 36 ms. (108 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (407 resets) in 44 ms. (88 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (205 resets) in 34 ms. (114 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (184 resets) in 35 ms. (111 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (189 resets) in 32 ms. (121 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (179 resets) in 33 ms. (117 steps per ms) remains 47/47 properties
Probably explored full state space saw : 136918 states, properties seen :42
Probabilistic random walk after 373531 steps, saw 136918 distinct states, run finished after 4049 ms. (steps per millisecond=92 ) properties seen :42
Explored full state space saw : 137359 states, properties seen :0
Exhaustive walk after 374056 steps, saw 137359 distinct states, run finished after 2973 ms. (steps per millisecond=125 ) properties seen :0
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 04:30:43] [INFO ] Flatten gal took : 42 ms
[2026-05-24 04:30:43] [INFO ] Flatten gal took : 48 ms
[2026-05-24 04:30:43] [INFO ] Input system was already deterministic with 664 transitions.
Computed a total of 5 stabilizing places and 45 stable transitions
Graph (complete) has 1238 edges and 288 vertex of which 287 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 664/664 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 235 transition count 454
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 235 transition count 454
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 124 place count 235 transition count 436
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 164 place count 195 transition count 385
Iterating global reduction 1 with 40 rules applied. Total rules applied 204 place count 195 transition count 385
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 232 place count 195 transition count 357
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 261 place count 166 transition count 313
Iterating global reduction 2 with 29 rules applied. Total rules applied 290 place count 166 transition count 313
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 302 place count 166 transition count 301
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 317 place count 151 transition count 265
Iterating global reduction 3 with 15 rules applied. Total rules applied 332 place count 151 transition count 265
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 347 place count 151 transition count 250
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 355 place count 143 transition count 241
Iterating global reduction 4 with 8 rules applied. Total rules applied 363 place count 143 transition count 241
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 364 place count 143 transition count 240
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 368 place count 139 transition count 236
Iterating global reduction 5 with 4 rules applied. Total rules applied 372 place count 139 transition count 236
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 377 place count 139 transition count 231
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 379 place count 137 transition count 218
Iterating global reduction 6 with 2 rules applied. Total rules applied 381 place count 137 transition count 218
Applied a total of 381 rules in 50 ms. Remains 137 /288 variables (removed 151) and now considering 218/664 (removed 446) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17794390350354682585.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17457617175372108155.kers'
[2026-05-24 04:30:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17794390350354682585.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17457617175372108155.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 137 cols 676 entries
Finished phase 1 with 133 SingleSign rule and 2 generalized
[2026-05-24 04:30:44] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17457617175372108155.kers
Total runtime 2 ms.
[2026-05-24 04:30:44] [INFO ] Implicit Places using invariants in 150 ms returned []
[2026-05-24 04:30:44] [INFO ] Invariant cache hit.
[2026-05-24 04:30:44] [INFO ] State equation strengthened by 90 read => feed constraints.
[2026-05-24 04:30:44] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 919 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2026-05-24 04:30:45] [INFO ] Invariant cache hit.
[2026-05-24 04:30:45] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/355 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 90/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/355 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 229 constraints, problems are : Problem set: 0 solved, 217 unsolved in 19059 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/355 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 90/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 217/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/355 variables, and 446 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49343ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 49348ms
Starting structural reductions in LTL mode, iteration 1 : 137/288 places, 218/664 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50339 ms. Remains : 137/288 places, 218/664 transitions.
[2026-05-24 04:31:34] [INFO ] Flatten gal took : 12 ms
[2026-05-24 04:31:34] [INFO ] Flatten gal took : 11 ms
[2026-05-24 04:31:34] [INFO ] Input system was already deterministic with 218 transitions.
[2026-05-24 04:31:34] [INFO ] Flatten gal took : 11 ms
[2026-05-24 04:31:34] [INFO ] Flatten gal took : 10 ms
[2026-05-24 04:31:34] [INFO ] Time to serialize gal into /tmp/CTLFireability4885533322882259208.gal : 9 ms
[2026-05-24 04:31:34] [INFO ] Time to serialize properties into /tmp/CTLFireability4130696494291519611.ctl : 6 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/CTLFireability4885533322882259208.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4130696494291519611.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,32583,1.61666,44600,2,7039,5,115289,6,0,766,105945,0


Converting to forward existential form...Done !
original formula: EG(EF((((AX(((s1>=1)&&(l1713>=1))) * AX(E(((s1>=1)&&(l4114>=1)) U ((s1>=1)&&(l3082>=1))))) * ((s1>=1)&&(l1>=1))) * (((s1<1)||(l4112<1))&&...191
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((!(EX(!(((s1>=1)&&(l1713>=1))))) * !(EX(!(E(((s1>=1)&&(l4114>=1)) U ((s1>=1)&&(l3082>=1)))...252
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t69, t70, t74, t75, t76, t77, t78, t79, t80, t81, t82, t83, t84, t93, t...713
(forward)formula 0,0,4.01823,93848,1,0,376,322227,469,149,5461,159777,468
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 288/288 places, 664/664 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 236 transition count 460
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 236 transition count 460
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 128 place count 236 transition count 436
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 166 place count 198 transition count 387
Iterating global reduction 1 with 38 rules applied. Total rules applied 204 place count 198 transition count 387
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 228 place count 198 transition count 363
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 255 place count 171 transition count 322
Iterating global reduction 2 with 27 rules applied. Total rules applied 282 place count 171 transition count 322
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 291 place count 171 transition count 313
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 304 place count 158 transition count 280
Iterating global reduction 3 with 13 rules applied. Total rules applied 317 place count 158 transition count 280
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 329 place count 158 transition count 268
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 336 place count 151 transition count 260
Iterating global reduction 4 with 7 rules applied. Total rules applied 343 place count 151 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 344 place count 151 transition count 259
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 348 place count 147 transition count 255
Iterating global reduction 5 with 4 rules applied. Total rules applied 352 place count 147 transition count 255
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 355 place count 147 transition count 252
Applied a total of 355 rules in 98 ms. Remains 147 /288 variables (removed 141) and now considering 252/664 (removed 412) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4858094399399847739.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-317754092962815950.kers'
[2026-05-24 04:31:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4858094399399847739.kers, --Pflows, --basisKERS=/tmp/petrispot-output-317754092962815950.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 252 rows 147 cols 763 entries
Finished phase 1 with 143 SingleSign rule and 2 generalized
[2026-05-24 04:31:38] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-317754092962815950.kers
Total runtime 2 ms.
[2026-05-24 04:31:38] [INFO ] Implicit Places using invariants in 174 ms returned []
[2026-05-24 04:31:38] [INFO ] Invariant cache hit.
[2026-05-24 04:31:38] [INFO ] State equation strengthened by 113 read => feed constraints.
[2026-05-24 04:31:39] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 955 ms to find 0 implicit places.
[2026-05-24 04:31:39] [INFO ] Redundant transitions in 15 ms returned []
Running 251 sub problems to find dead transitions.
[2026-05-24 04:31:39] [INFO ] Invariant cache hit.
[2026-05-24 04:31:39] [INFO ] State equation strengthened by 113 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 252/399 variables, 147/149 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 113/262 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 7/269 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 3/272 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/399 variables, and 274 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 252/399 variables, 147/161 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 113/274 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 251/525 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/399 variables, and 525 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Starting structural reductions in SI_CTL mode, iteration 1 : 147/288 places, 252/664 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61237 ms. Remains : 147/288 places, 252/664 transitions.
[2026-05-24 04:32:39] [INFO ] Flatten gal took : 18 ms
[2026-05-24 04:32:39] [INFO ] Flatten gal took : 11 ms
[2026-05-24 04:32:39] [INFO ] Input system was already deterministic with 252 transitions.
[2026-05-24 04:32:39] [INFO ] Flatten gal took : 11 ms
[2026-05-24 04:32:39] [INFO ] Flatten gal took : 11 ms
[2026-05-24 04:32:39] [INFO ] Time to serialize gal into /tmp/CTLFireability6600633809235214106.gal : 5 ms
[2026-05-24 04:32:39] [INFO ] Time to serialize properties into /tmp/CTLFireability11568665182422738980.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/CTLFireability6600633809235214106.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11568665182422738980.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,38936,2.20783,60824,2,9256,5,148847,6,0,840,137123,0


Converting to forward existential form...Done !
original formula: EF(((E(((EG(((s1>=1)&&(l3082>=1))) * (s1>=1)) * ((l1806>=1)&&(!(((s1>=1)&&(l3091>=1))||((s1>=1)&&(l3850>=1)))))) U ((s1>=1)&&(l4116>=1)))...237
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * (E(((EG(((s1>=1)&&(l3082>=1))) * (s1>=1)) * ((l1806>=1)&&(!(((s1>=1)&&(l3091>=1))||((s...302
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t28, t29, t70, t72, t73, t77, t78, t79, t80, t81, t82, t84, t85, t86, t...916
(forward)formula 0,1,8.89488,209800,1,0,512,754294,540,195,6118,369817,625
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 664/664 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 232 transition count 420
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 232 transition count 420
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 128 place count 232 transition count 404
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 169 place count 191 transition count 352
Iterating global reduction 1 with 41 rules applied. Total rules applied 210 place count 191 transition count 352
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 234 place count 191 transition count 328
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 264 place count 161 transition count 285
Iterating global reduction 2 with 30 rules applied. Total rules applied 294 place count 161 transition count 285
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 306 place count 161 transition count 273
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 322 place count 145 transition count 229
Iterating global reduction 3 with 16 rules applied. Total rules applied 338 place count 145 transition count 229
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 343 place count 145 transition count 224
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 352 place count 136 transition count 214
Iterating global reduction 4 with 9 rules applied. Total rules applied 361 place count 136 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 362 place count 136 transition count 213
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 367 place count 131 transition count 208
Iterating global reduction 5 with 5 rules applied. Total rules applied 372 place count 131 transition count 208
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 378 place count 131 transition count 202
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 380 place count 129 transition count 189
Iterating global reduction 6 with 2 rules applied. Total rules applied 382 place count 129 transition count 189
Applied a total of 382 rules in 31 ms. Remains 129 /288 variables (removed 159) and now considering 189/664 (removed 475) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5221020360068444389.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10143218627464994037.kers'
[2026-05-24 04:32:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5221020360068444389.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10143218627464994037.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 189 rows 129 cols 605 entries
Finished phase 1 with 125 SingleSign rule and 2 generalized
[2026-05-24 04:32:48] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10143218627464994037.kers
Total runtime 2 ms.
[2026-05-24 04:32:49] [INFO ] Implicit Places using invariants in 198 ms returned []
[2026-05-24 04:32:49] [INFO ] Invariant cache hit.
[2026-05-24 04:32:49] [INFO ] State equation strengthened by 68 read => feed constraints.
[2026-05-24 04:32:50] [INFO ] Implicit Places using invariants and state equation in 939 ms returned []
Implicit Place search using SMT with State Equation took 1140 ms to find 0 implicit places.
Running 188 sub problems to find dead transitions.
[2026-05-24 04:32:50] [INFO ] Invariant cache hit.
[2026-05-24 04:32:50] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/318 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 68/199 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 0/318 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 199 constraints, problems are : Problem set: 0 solved, 188 unsolved in 12711 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/318 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 68/199 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 188/387 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 318/318 variables, and 387 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42803ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 42804ms
Starting structural reductions in LTL mode, iteration 1 : 129/288 places, 189/664 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43976 ms. Remains : 129/288 places, 189/664 transitions.
[2026-05-24 04:33:32] [INFO ] Flatten gal took : 11 ms
[2026-05-24 04:33:32] [INFO ] Flatten gal took : 8 ms
[2026-05-24 04:33:32] [INFO ] Input system was already deterministic with 189 transitions.
[2026-05-24 04:33:32] [INFO ] Flatten gal took : 7 ms
[2026-05-24 04:33:32] [INFO ] Flatten gal took : 7 ms
[2026-05-24 04:33:32] [INFO ] Time to serialize gal into /tmp/CTLFireability12175587646083259852.gal : 3 ms
[2026-05-24 04:33:32] [INFO ] Time to serialize properties into /tmp/CTLFireability5478705786960060197.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/CTLFireability12175587646083259852.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5478705786960060197.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,24777,1.06223,35956,2,5915,5,88171,6,0,705,81717,0


Converting to forward existential form...Done !
original formula: AG(E(!(AG(((s1>=1)&&(l4185>=1)))) U !(AX(A(((s1>=1)&&(l3085>=1)) U ((p176>=1)&&(l0>=1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(!(E(TRUE U !(((s1>=1)&&(l4185>=1)))))) U !(!(EX(!(!((E(!(((p176>=1)&&(l0>=1))) U (!(((...251
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t69, t70, t74, t75, t76, t84, t85, t90, t91, t92, t94, t95, t96, t98, t...613
(forward)formula 0,0,5.41858,142940,1,0,396,636837,412,167,5043,305589,503
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 664/664 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 236 transition count 463
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 236 transition count 463
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 125 place count 236 transition count 442
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 162 place count 199 transition count 395
Iterating global reduction 1 with 37 rules applied. Total rules applied 199 place count 199 transition count 395
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 222 place count 199 transition count 372
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 248 place count 173 transition count 332
Iterating global reduction 2 with 26 rules applied. Total rules applied 274 place count 173 transition count 332
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 285 place count 173 transition count 321
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 296 place count 162 transition count 295
Iterating global reduction 3 with 11 rules applied. Total rules applied 307 place count 162 transition count 295
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 313 place count 162 transition count 289
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 320 place count 155 transition count 281
Iterating global reduction 4 with 7 rules applied. Total rules applied 327 place count 155 transition count 281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 328 place count 155 transition count 280
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 332 place count 151 transition count 276
Iterating global reduction 5 with 4 rules applied. Total rules applied 336 place count 151 transition count 276
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 341 place count 151 transition count 271
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 343 place count 149 transition count 258
Iterating global reduction 6 with 2 rules applied. Total rules applied 345 place count 149 transition count 258
Applied a total of 345 rules in 26 ms. Remains 149 /288 variables (removed 139) and now considering 258/664 (removed 406) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9347747574695469075.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18395621813805760316.kers'
[2026-05-24 04:33:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9347747574695469075.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18395621813805760316.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 258 rows 149 cols 786 entries
Finished phase 1 with 145 SingleSign rule and 2 generalized
[2026-05-24 04:33:38] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18395621813805760316.kers
Total runtime 2 ms.
[2026-05-24 04:33:38] [INFO ] Implicit Places using invariants in 189 ms returned []
[2026-05-24 04:33:38] [INFO ] Invariant cache hit.
[2026-05-24 04:33:38] [INFO ] State equation strengthened by 113 read => feed constraints.
[2026-05-24 04:33:39] [INFO ] Implicit Places using invariants and state equation in 1146 ms returned []
Implicit Place search using SMT with State Equation took 1342 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2026-05-24 04:33:39] [INFO ] Invariant cache hit.
[2026-05-24 04:33:39] [INFO ] State equation strengthened by 113 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/407 variables, 149/151 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 113/264 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 407/407 variables, and 264 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/407 variables, 149/151 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 113/264 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 257/521 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 521 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60199ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60200ms
Starting structural reductions in LTL mode, iteration 1 : 149/288 places, 258/664 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61569 ms. Remains : 149/288 places, 258/664 transitions.
[2026-05-24 04:34:39] [INFO ] Flatten gal took : 9 ms
[2026-05-24 04:34:39] [INFO ] Flatten gal took : 9 ms
[2026-05-24 04:34:39] [INFO ] Input system was already deterministic with 258 transitions.
[2026-05-24 04:34:39] [INFO ] Flatten gal took : 9 ms
[2026-05-24 04:34:39] [INFO ] Flatten gal took : 8 ms
[2026-05-24 04:34:39] [INFO ] Time to serialize gal into /tmp/CTLFireability15030669347140964627.gal : 3 ms
[2026-05-24 04:34:39] [INFO ] Time to serialize properties into /tmp/CTLFireability937308748910507662.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/CTLFireability15030669347140964627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability937308748910507662.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,39596,2.28993,59668,2,9147,5,155129,6,0,854,126998,0


Converting to forward existential form...Done !
original formula: EX(A(((p74>=1)&&(l0>=1)) U A(EX(E(((s1>=1)&&(l3840>=1)) U ((s1>=1)&&(l3829>=1)))) U ((AF(((s1>=1)&&(l1772>=1))) + ((s1>=1)&&(l4150>=1))) ...237
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!((E(!(((!(EG(!(((s1>=1)&&(l1772>=1))))) + ((s1>=1)&&(l4150>=1))) + (((s1>=1)&&(l4121>=1))|...1627
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t28, t29, t30, t72, t73, t74, t75, t76, t77, t78, t79, t80, t81, t82, t...995
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,11.9395,290912,1,0,631,1.33769e+06,554,266,6193,601263,743
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2024-03 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 : 288/288 places, 664/664 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 233 transition count 420
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 233 transition count 420
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 127 place count 233 transition count 403
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 166 place count 194 transition count 354
Iterating global reduction 1 with 39 rules applied. Total rules applied 205 place count 194 transition count 354
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 226 place count 194 transition count 333
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 255 place count 165 transition count 292
Iterating global reduction 2 with 29 rules applied. Total rules applied 284 place count 165 transition count 292
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 295 place count 165 transition count 281
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 309 place count 151 transition count 252
Iterating global reduction 3 with 14 rules applied. Total rules applied 323 place count 151 transition count 252
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 328 place count 151 transition count 247
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 336 place count 143 transition count 238
Iterating global reduction 4 with 8 rules applied. Total rules applied 344 place count 143 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 345 place count 143 transition count 237
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 349 place count 139 transition count 233
Iterating global reduction 5 with 4 rules applied. Total rules applied 353 place count 139 transition count 233
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 358 place count 139 transition count 228
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 359 place count 138 transition count 223
Iterating global reduction 6 with 1 rules applied. Total rules applied 360 place count 138 transition count 223
Applied a total of 360 rules in 16 ms. Remains 138 /288 variables (removed 150) and now considering 223/664 (removed 441) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5905052973503290169.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3273153165319007355.kers'
[2026-05-24 04:34:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5905052973503290169.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3273153165319007355.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 223 rows 138 cols 687 entries
Finished phase 1 with 134 SingleSign rule and 2 generalized
[2026-05-24 04:34:52] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3273153165319007355.kers
Total runtime 1 ms.
[2026-05-24 04:34:52] [INFO ] Implicit Places using invariants in 250 ms returned []
[2026-05-24 04:34:52] [INFO ] Invariant cache hit.
[2026-05-24 04:34:52] [INFO ] State equation strengthened by 94 read => feed constraints.
[2026-05-24 04:34:53] [INFO ] Implicit Places using invariants and state equation in 1144 ms returned []
Implicit Place search using SMT with State Equation took 1397 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2026-05-24 04:34:53] [INFO ] Invariant cache hit.
[2026-05-24 04:34:53] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/361 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 94/234 constraints. Problems are: Problem set: 0 solved, 222 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 0/361 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 234 constraints, problems are : Problem set: 0 solved, 222 unsolved in 23114 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 138/138 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/361 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 94/234 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 222/456 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/361 variables, and 456 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 138/138 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53355ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 53358ms
Starting structural reductions in LTL mode, iteration 1 : 138/288 places, 223/664 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54772 ms. Remains : 138/288 places, 223/664 transitions.
[2026-05-24 04:35:46] [INFO ] Flatten gal took : 10 ms
[2026-05-24 04:35:46] [INFO ] Flatten gal took : 10 ms
[2026-05-24 04:35:46] [INFO ] Input system was already deterministic with 223 transitions.
[2026-05-24 04:35:46] [INFO ] Flatten gal took : 10 ms
[2026-05-24 04:35:46] [INFO ] Flatten gal took : 10 ms
[2026-05-24 04:35:46] [INFO ] Time to serialize gal into /tmp/CTLFireability14127693729866327463.gal : 4 ms
[2026-05-24 04:35:46] [INFO ] Time to serialize properties into /tmp/CTLFireability16829389168840468543.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/CTLFireability14127693729866327463.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16829389168840468543.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,29476,2.23217,49080,2,7592,5,122129,6,0,775,121931,0


Converting to forward existential form...Done !
original formula: AX(EF((((EX(((p161>=1)&&(l0>=1))) * (s1>=1)) * (l3659>=1)) + (EF(((p49>=1)&&(l0>=1))) * EX(((s1>=1)&&(l2872>=1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (((EX(((p161>=1)&&(l0>=1))) * (s1>=1)) * (l3659>=1)) + (E(TRUE U ((p49>=1)&&(l0>=1))) * ...194
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t72, t74, t75, t79, t80, t81, t82, t83, t84, t86, t87, t88, t89, t90, t...772
(forward)formula 0,1,6.97174,151084,1,0,499,627566,471,207,5608,269254,609
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 288/288 places, 664/664 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 232 transition count 432
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 232 transition count 432
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 127 place count 232 transition count 417
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 169 place count 190 transition count 364
Iterating global reduction 1 with 42 rules applied. Total rules applied 211 place count 190 transition count 364
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 238 place count 190 transition count 337
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 269 place count 159 transition count 289
Iterating global reduction 2 with 31 rules applied. Total rules applied 300 place count 159 transition count 289
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 313 place count 159 transition count 276
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 329 place count 143 transition count 232
Iterating global reduction 3 with 16 rules applied. Total rules applied 345 place count 143 transition count 232
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 350 place count 143 transition count 227
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 359 place count 134 transition count 217
Iterating global reduction 4 with 9 rules applied. Total rules applied 368 place count 134 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 369 place count 134 transition count 216
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 374 place count 129 transition count 211
Iterating global reduction 5 with 5 rules applied. Total rules applied 379 place count 129 transition count 211
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 386 place count 129 transition count 204
Applied a total of 386 rules in 50 ms. Remains 129 /288 variables (removed 159) and now considering 204/664 (removed 460) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7773932647380166587.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3244841364867916599.kers'
[2026-05-24 04:35:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7773932647380166587.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3244841364867916599.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 204 rows 129 cols 632 entries
Finished phase 1 with 125 SingleSign rule and 2 generalized
[2026-05-24 04:35:54] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3244841364867916599.kers
Total runtime 2 ms.
[2026-05-24 04:35:54] [INFO ] Implicit Places using invariants in 209 ms returned []
[2026-05-24 04:35:54] [INFO ] Invariant cache hit.
[2026-05-24 04:35:54] [INFO ] State equation strengthened by 84 read => feed constraints.
[2026-05-24 04:35:55] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1109 ms to find 0 implicit places.
[2026-05-24 04:35:55] [INFO ] Redundant transitions in 4 ms returned []
Running 203 sub problems to find dead transitions.
[2026-05-24 04:35:55] [INFO ] Invariant cache hit.
[2026-05-24 04:35:55] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/333 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 84/215 constraints. Problems are: Problem set: 0 solved, 203 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/333 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 215 constraints, problems are : Problem set: 0 solved, 203 unsolved in 17129 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/333 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 84/215 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 203/418 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 333/333 variables, and 418 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47292ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 47293ms
Starting structural reductions in SI_CTL mode, iteration 1 : 129/288 places, 204/664 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48464 ms. Remains : 129/288 places, 204/664 transitions.
[2026-05-24 04:36:42] [INFO ] Flatten gal took : 8 ms
[2026-05-24 04:36:42] [INFO ] Flatten gal took : 8 ms
[2026-05-24 04:36:42] [INFO ] Input system was already deterministic with 204 transitions.
[2026-05-24 04:36:42] [INFO ] Flatten gal took : 8 ms
[2026-05-24 04:36:42] [INFO ] Flatten gal took : 8 ms
[2026-05-24 04:36:42] [INFO ] Time to serialize gal into /tmp/CTLFireability17696099774927452439.gal : 3 ms
[2026-05-24 04:36:42] [INFO ] Time to serialize properties into /tmp/CTLFireability8291694325762190280.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/CTLFireability17696099774927452439.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8291694325762190280.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,24876,1.36941,34220,2,5881,5,87079,6,0,720,74667,0


Converting to forward existential form...Done !
original formula: !(A(AG(!(((s1>=1)&&(l3092>=1)))) U ((s1>=1)&&(l1744>=1))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,!(((s1>=1)&&(l1744>=1)))) * !(((s1>=1)&&(l1744>=1)))),TRUE) * ((s1>=1)&&(l3092>=1)))] != FALS...206
Hit Full ! (commute/partial/dont) 3/0/201
(forward)formula 0,1,3.23095,63448,1,0,11,197330,17,3,1411,166958,7
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 288/288 places, 664/664 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 232 transition count 426
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 232 transition count 426
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 128 place count 232 transition count 410
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 169 place count 191 transition count 358
Iterating global reduction 1 with 41 rules applied. Total rules applied 210 place count 191 transition count 358
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 235 place count 191 transition count 333
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 265 place count 161 transition count 286
Iterating global reduction 2 with 30 rules applied. Total rules applied 295 place count 161 transition count 286
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 307 place count 161 transition count 274
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 321 place count 147 transition count 242
Iterating global reduction 3 with 14 rules applied. Total rules applied 335 place count 147 transition count 242
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 340 place count 147 transition count 237
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 348 place count 139 transition count 228
Iterating global reduction 4 with 8 rules applied. Total rules applied 356 place count 139 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 357 place count 139 transition count 227
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 361 place count 135 transition count 223
Iterating global reduction 5 with 4 rules applied. Total rules applied 365 place count 135 transition count 223
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 371 place count 135 transition count 217
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 374 place count 132 transition count 197
Iterating global reduction 6 with 3 rules applied. Total rules applied 377 place count 132 transition count 197
Applied a total of 377 rules in 41 ms. Remains 132 /288 variables (removed 156) and now considering 197/664 (removed 467) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6501128625528207402.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13333815294140958535.kers'
[2026-05-24 04:36:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6501128625528207402.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13333815294140958535.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 197 rows 132 cols 636 entries
Finished phase 1 with 128 SingleSign rule and 2 generalized
[2026-05-24 04:36:45] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13333815294140958535.kers
Total runtime 2 ms.
[2026-05-24 04:36:45] [INFO ] Implicit Places using invariants in 139 ms returned []
[2026-05-24 04:36:45] [INFO ] Invariant cache hit.
[2026-05-24 04:36:46] [INFO ] State equation strengthened by 69 read => feed constraints.
[2026-05-24 04:36:46] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
[2026-05-24 04:36:46] [INFO ] Redundant transitions in 3 ms returned []
Running 196 sub problems to find dead transitions.
[2026-05-24 04:36:46] [INFO ] Invariant cache hit.
[2026-05-24 04:36:46] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/329 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 69/203 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/329 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 5/210 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 329/329 variables, and 210 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/329 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 69/210 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 196/406 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 329/329 variables, and 406 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60187ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 60189ms
Starting structural reductions in SI_CTL mode, iteration 1 : 132/288 places, 197/664 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60960 ms. Remains : 132/288 places, 197/664 transitions.
[2026-05-24 04:37:46] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:37:46] [INFO ] Flatten gal took : 7 ms
[2026-05-24 04:37:46] [INFO ] Input system was already deterministic with 197 transitions.
[2026-05-24 04:37:46] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:37:46] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:37:46] [INFO ] Time to serialize gal into /tmp/CTLFireability12427822534989408851.gal : 2 ms
[2026-05-24 04:37:46] [INFO ] Time to serialize properties into /tmp/CTLFireability1930921504676755115.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/CTLFireability12427822534989408851.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1930921504676755115.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,30010,2.05306,44988,2,6586,5,110270,6,0,725,122207,0


Converting to forward existential form...Done !
original formula: EF(AG((((s1<1)||(l1626<1))&&((s1<1)||(l4126<1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((s1<1)||(l1626<1))&&((s1<1)||(l4126<1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t20, t21, t70, t71, t72, t73, t75, t76, t77, t78, t86, t87, t91, t92, t...705
(forward)formula 0,1,5.57966,121044,1,0,389,471326,416,154,5118,219005,453
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 664/664 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 231 transition count 418
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 231 transition count 418
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 131 place count 231 transition count 401
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 172 place count 190 transition count 349
Iterating global reduction 1 with 41 rules applied. Total rules applied 213 place count 190 transition count 349
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 237 place count 190 transition count 325
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 268 place count 159 transition count 277
Iterating global reduction 2 with 31 rules applied. Total rules applied 299 place count 159 transition count 277
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 311 place count 159 transition count 265
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 326 place count 144 transition count 229
Iterating global reduction 3 with 15 rules applied. Total rules applied 341 place count 144 transition count 229
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 346 place count 144 transition count 224
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 355 place count 135 transition count 214
Iterating global reduction 4 with 9 rules applied. Total rules applied 364 place count 135 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 365 place count 135 transition count 213
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 370 place count 130 transition count 208
Iterating global reduction 5 with 5 rules applied. Total rules applied 375 place count 130 transition count 208
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 381 place count 130 transition count 202
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 383 place count 128 transition count 189
Iterating global reduction 6 with 2 rules applied. Total rules applied 385 place count 128 transition count 189
Applied a total of 385 rules in 24 ms. Remains 128 /288 variables (removed 160) and now considering 189/664 (removed 475) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9222412060345912646.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17665283760733785612.kers'
[2026-05-24 04:37:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9222412060345912646.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17665283760733785612.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 189 rows 128 cols 606 entries
Finished phase 1 with 124 SingleSign rule and 2 generalized
[2026-05-24 04:37:52] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17665283760733785612.kers
Total runtime 1 ms.
[2026-05-24 04:37:52] [INFO ] Implicit Places using invariants in 199 ms returned []
[2026-05-24 04:37:52] [INFO ] Invariant cache hit.
[2026-05-24 04:37:52] [INFO ] State equation strengthened by 68 read => feed constraints.
[2026-05-24 04:37:53] [INFO ] Implicit Places using invariants and state equation in 1305 ms returned []
Implicit Place search using SMT with State Equation took 1506 ms to find 0 implicit places.
Running 188 sub problems to find dead transitions.
[2026-05-24 04:37:53] [INFO ] Invariant cache hit.
[2026-05-24 04:37:53] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/317 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 68/198 constraints. Problems are: Problem set: 0 solved, 188 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 0/317 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 198 constraints, problems are : Problem set: 0 solved, 188 unsolved in 16430 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/317 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 68/198 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 188/386 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/317 variables, and 386 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46524ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 46525ms
Starting structural reductions in LTL mode, iteration 1 : 128/288 places, 189/664 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48055 ms. Remains : 128/288 places, 189/664 transitions.
[2026-05-24 04:38:40] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:38:40] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:38:40] [INFO ] Input system was already deterministic with 189 transitions.
[2026-05-24 04:38:40] [INFO ] Flatten gal took : 10 ms
[2026-05-24 04:38:40] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:38:40] [INFO ] Time to serialize gal into /tmp/CTLFireability2553654743894247507.gal : 2 ms
[2026-05-24 04:38:40] [INFO ] Time to serialize properties into /tmp/CTLFireability7002041686743979553.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/CTLFireability2553654743894247507.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7002041686743979553.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,24804,1.23468,35316,2,6077,5,87616,6,0,701,77945,0


Converting to forward existential form...Done !
original formula: AG((AX(AF(((s1>=1)&&(l3082>=1)))) * EF(((p67<1)||(l0<1)))))
=> equivalent forward existential formula: ([FwdG(EY(FwdU(Init,TRUE)),!(((s1>=1)&&(l3082>=1))))] = FALSE * [(FwdU(Init,TRUE) * !(E(TRUE U ((p67<1)||(l0<1))...168
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t69, t70, t74, t75, t76, t85, t93, t94, t98, t99, t100, t102, t103, t10...594
Hit Full ! (commute/partial/dont) 3/0/186
(forward)formula 0,0,3.60709,82404,1,0,324,294106,410,130,4990,152975,406
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 664/664 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 232 transition count 421
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 232 transition count 421
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 127 place count 232 transition count 406
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 169 place count 190 transition count 353
Iterating global reduction 1 with 42 rules applied. Total rules applied 211 place count 190 transition count 353
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 236 place count 190 transition count 328
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 266 place count 160 transition count 281
Iterating global reduction 2 with 30 rules applied. Total rules applied 296 place count 160 transition count 281
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 307 place count 160 transition count 270
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 322 place count 145 transition count 234
Iterating global reduction 3 with 15 rules applied. Total rules applied 337 place count 145 transition count 234
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 342 place count 145 transition count 229
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 351 place count 136 transition count 219
Iterating global reduction 4 with 9 rules applied. Total rules applied 360 place count 136 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 361 place count 136 transition count 218
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 366 place count 131 transition count 213
Iterating global reduction 5 with 5 rules applied. Total rules applied 371 place count 131 transition count 213
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 377 place count 131 transition count 207
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 379 place count 129 transition count 195
Iterating global reduction 6 with 2 rules applied. Total rules applied 381 place count 129 transition count 195
Applied a total of 381 rules in 13 ms. Remains 129 /288 variables (removed 159) and now considering 195/664 (removed 469) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18355310933347624482.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17878713394962878340.kers'
[2026-05-24 04:38:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18355310933347624482.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17878713394962878340.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 195 rows 129 cols 624 entries
Finished phase 1 with 125 SingleSign rule and 2 generalized
[2026-05-24 04:38:44] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17878713394962878340.kers
Total runtime 1 ms.
[2026-05-24 04:38:44] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-24 04:38:44] [INFO ] Invariant cache hit.
[2026-05-24 04:38:44] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-24 04:38:45] [INFO ] Implicit Places using invariants and state equation in 943 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2026-05-24 04:38:45] [INFO ] Invariant cache hit.
[2026-05-24 04:38:45] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/324 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 71/202 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 0/324 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 202 constraints, problems are : Problem set: 0 solved, 194 unsolved in 16071 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/324 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 71/202 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 194/396 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 324/324 variables, and 396 constraints, problems are : Problem set: 0 solved, 194 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46250ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 46251ms
Starting structural reductions in LTL mode, iteration 1 : 129/288 places, 195/664 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47366 ms. Remains : 129/288 places, 195/664 transitions.
[2026-05-24 04:39:31] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:39:31] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:39:31] [INFO ] Input system was already deterministic with 195 transitions.
[2026-05-24 04:39:31] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:39:31] [INFO ] Flatten gal took : 7 ms
[2026-05-24 04:39:31] [INFO ] Time to serialize gal into /tmp/CTLFireability1863149444703245280.gal : 19 ms
[2026-05-24 04:39:31] [INFO ] Time to serialize properties into /tmp/CTLFireability10962740187600597031.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/CTLFireability1863149444703245280.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10962740187600597031.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,25758,1.24907,34812,2,5718,5,89587,6,0,711,77723,0


Converting to forward existential form...Done !
original formula: EG(EX(((A(((s1>=1)&&(l1652>=1)) U ((s1>=1)&&(l1730>=1))) + (s1<1)) + (l1736<1))))
=> equivalent forward existential formula: [FwdG(Init,EX(((!((E(!(((s1>=1)&&(l1730>=1))) U (!(((s1>=1)&&(l1652>=1))) * !(((s1>=1)&&(l1730>=1))))) + EG(!(((...213
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t73, t74, t78, t79, t80, t89, t99, t107, t109, t110, t111, t113, t114, ...573
(forward)formula 0,1,7.56998,171704,1,0,550,804877,423,276,4995,487136,620
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 664/664 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 232 transition count 425
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 232 transition count 425
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 129 place count 232 transition count 408
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 169 place count 192 transition count 358
Iterating global reduction 1 with 40 rules applied. Total rules applied 209 place count 192 transition count 358
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 231 place count 192 transition count 336
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 261 place count 162 transition count 290
Iterating global reduction 2 with 30 rules applied. Total rules applied 291 place count 162 transition count 290
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 303 place count 162 transition count 278
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 318 place count 147 transition count 236
Iterating global reduction 3 with 15 rules applied. Total rules applied 333 place count 147 transition count 236
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 337 place count 147 transition count 232
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 346 place count 138 transition count 222
Iterating global reduction 4 with 9 rules applied. Total rules applied 355 place count 138 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 356 place count 138 transition count 221
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 361 place count 133 transition count 216
Iterating global reduction 5 with 5 rules applied. Total rules applied 366 place count 133 transition count 216
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 372 place count 133 transition count 210
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 374 place count 131 transition count 198
Iterating global reduction 6 with 2 rules applied. Total rules applied 376 place count 131 transition count 198
Applied a total of 376 rules in 17 ms. Remains 131 /288 variables (removed 157) and now considering 198/664 (removed 466) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14986805497469593530.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7740870996714434210.kers'
[2026-05-24 04:39:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14986805497469593530.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7740870996714434210.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 198 rows 131 cols 635 entries
Finished phase 1 with 127 SingleSign rule and 2 generalized
[2026-05-24 04:39:39] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7740870996714434210.kers
Total runtime 2 ms.
[2026-05-24 04:39:39] [INFO ] Implicit Places using invariants in 178 ms returned []
[2026-05-24 04:39:39] [INFO ] Invariant cache hit.
[2026-05-24 04:39:39] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-24 04:39:40] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2026-05-24 04:39:40] [INFO ] Invariant cache hit.
[2026-05-24 04:39:40] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/329 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 71/204 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (OVERLAPS) 0/329 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 204 constraints, problems are : Problem set: 0 solved, 197 unsolved in 19133 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/329 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 71/204 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 197/401 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 329/329 variables, and 401 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49262ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 49263ms
Starting structural reductions in LTL mode, iteration 1 : 131/288 places, 198/664 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50025 ms. Remains : 131/288 places, 198/664 transitions.
[2026-05-24 04:40:29] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:40:29] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:40:29] [INFO ] Input system was already deterministic with 198 transitions.
[2026-05-24 04:40:29] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:40:29] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:40:29] [INFO ] Time to serialize gal into /tmp/CTLFireability9455461127847259968.gal : 2 ms
[2026-05-24 04:40:29] [INFO ] Time to serialize properties into /tmp/CTLFireability17935456363806741577.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/CTLFireability9455461127847259968.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17935456363806741577.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,26459,1.20241,34092,2,6368,5,86336,6,0,722,77924,0


Converting to forward existential form...Done !
original formula: AX((EF(((s1>=1)&&(l3840>=1))) + ((p243>=1)&&(l0>=1))))
=> equivalent forward existential formula: [((EY(Init) * !(((p243>=1)&&(l0>=1)))) * !(E(TRUE U ((s1>=1)&&(l3840>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t70, t71, t75, t76, t77, t85, t94, t96, t97, t98, t100, t101, t118, t11...624
(forward)formula 0,1,4.25956,100828,1,0,377,405954,419,156,5185,162548,467
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 664/664 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 233 transition count 429
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 233 transition count 429
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 127 place count 233 transition count 412
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 166 place count 194 transition count 362
Iterating global reduction 1 with 39 rules applied. Total rules applied 205 place count 194 transition count 362
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 229 place count 194 transition count 338
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 256 place count 167 transition count 298
Iterating global reduction 2 with 27 rules applied. Total rules applied 283 place count 167 transition count 298
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 295 place count 167 transition count 286
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 309 place count 153 transition count 248
Iterating global reduction 3 with 14 rules applied. Total rules applied 323 place count 153 transition count 248
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 328 place count 153 transition count 243
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 335 place count 146 transition count 236
Iterating global reduction 4 with 7 rules applied. Total rules applied 342 place count 146 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 343 place count 146 transition count 235
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 347 place count 142 transition count 231
Iterating global reduction 5 with 4 rules applied. Total rules applied 351 place count 142 transition count 231
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 357 place count 142 transition count 225
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 360 place count 139 transition count 205
Iterating global reduction 6 with 3 rules applied. Total rules applied 363 place count 139 transition count 205
Applied a total of 363 rules in 16 ms. Remains 139 /288 variables (removed 149) and now considering 205/664 (removed 459) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9506633867987905055.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4048591014046222577.kers'
[2026-05-24 04:40:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9506633867987905055.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4048591014046222577.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 205 rows 139 cols 665 entries
Finished phase 1 with 135 SingleSign rule and 2 generalized
[2026-05-24 04:40:33] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4048591014046222577.kers
Total runtime 2 ms.
[2026-05-24 04:40:33] [INFO ] Implicit Places using invariants in 178 ms returned []
[2026-05-24 04:40:33] [INFO ] Invariant cache hit.
[2026-05-24 04:40:33] [INFO ] State equation strengthened by 70 read => feed constraints.
[2026-05-24 04:40:34] [INFO ] Implicit Places using invariants and state equation in 1061 ms returned []
Implicit Place search using SMT with State Equation took 1241 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2026-05-24 04:40:34] [INFO ] Invariant cache hit.
[2026-05-24 04:40:34] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 205/344 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 70/211 constraints. Problems are: Problem set: 0 solved, 204 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 4/215 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 0/344 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 215 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/344 variables, 139/145 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 70/215 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 204/419 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 344/344 variables, and 419 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 60144ms
Starting structural reductions in LTL mode, iteration 1 : 139/288 places, 205/664 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61404 ms. Remains : 139/288 places, 205/664 transitions.
[2026-05-24 04:41:35] [INFO ] Flatten gal took : 8 ms
[2026-05-24 04:41:35] [INFO ] Flatten gal took : 8 ms
[2026-05-24 04:41:35] [INFO ] Input system was already deterministic with 205 transitions.
[2026-05-24 04:41:35] [INFO ] Flatten gal took : 8 ms
[2026-05-24 04:41:35] [INFO ] Flatten gal took : 7 ms
[2026-05-24 04:41:35] [INFO ] Time to serialize gal into /tmp/CTLFireability11178430272632155883.gal : 3 ms
[2026-05-24 04:41:35] [INFO ] Time to serialize properties into /tmp/CTLFireability11861451273434564373.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/CTLFireability11178430272632155883.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11861451273434564373.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,31695,1.89059,47324,2,7145,5,116465,6,0,761,115918,0


Converting to forward existential form...Done !
original formula: AG((AF(((s1>=1)&&(l2290>=1))) + EX(EX(((EF(((s1>=1)&&(l4138>=1))) * (p258>=1)) * (l0>=1))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(EX(EX(((E(TRUE U ((s1>=1)&&(l4138>=1))) * (p258>=1)) * (l0>=1)))))),!(((s1>=1)&&(l229...172
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t75, t76, t80, t81, t82, t90, t92, t93, t94, t97, t98, t99, t100, t102,...694
Hit Full ! (commute/partial/dont) 3/0/202
(forward)formula 0,0,5.55381,126796,1,0,436,451044,444,181,5523,255386,523
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2024-10 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 : 288/288 places, 664/664 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 233 transition count 429
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 233 transition count 429
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 129 place count 233 transition count 410
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 168 place count 194 transition count 364
Iterating global reduction 1 with 39 rules applied. Total rules applied 207 place count 194 transition count 364
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 231 place count 194 transition count 340
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 260 place count 165 transition count 295
Iterating global reduction 2 with 29 rules applied. Total rules applied 289 place count 165 transition count 295
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 300 place count 165 transition count 284
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 314 place count 151 transition count 242
Iterating global reduction 3 with 14 rules applied. Total rules applied 328 place count 151 transition count 242
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 338 place count 151 transition count 232
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 345 place count 144 transition count 224
Iterating global reduction 4 with 7 rules applied. Total rules applied 352 place count 144 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 353 place count 144 transition count 223
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 358 place count 139 transition count 218
Iterating global reduction 5 with 5 rules applied. Total rules applied 363 place count 139 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 364 place count 139 transition count 217
Applied a total of 364 rules in 15 ms. Remains 139 /288 variables (removed 149) and now considering 217/664 (removed 447) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17552524389410496433.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8524729229722486244.kers'
[2026-05-24 04:41:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17552524389410496433.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8524729229722486244.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 217 rows 139 cols 689 entries
Finished phase 1 with 135 SingleSign rule and 2 generalized
[2026-05-24 04:41:40] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8524729229722486244.kers
Total runtime 3 ms.
[2026-05-24 04:41:40] [INFO ] Implicit Places using invariants in 222 ms returned []
[2026-05-24 04:41:40] [INFO ] Invariant cache hit.
[2026-05-24 04:41:41] [INFO ] State equation strengthened by 82 read => feed constraints.
[2026-05-24 04:41:42] [INFO ] Implicit Places using invariants and state equation in 1131 ms returned []
Implicit Place search using SMT with State Equation took 1360 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2026-05-24 04:41:42] [INFO ] Invariant cache hit.
[2026-05-24 04:41:42] [INFO ] State equation strengthened by 82 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/356 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 82/223 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/356 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 223 constraints, problems are : Problem set: 0 solved, 216 unsolved in 24379 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/356 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 82/223 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 216/439 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 356/356 variables, and 439 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54609ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 54610ms
Starting structural reductions in LTL mode, iteration 1 : 139/288 places, 217/664 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55986 ms. Remains : 139/288 places, 217/664 transitions.
[2026-05-24 04:42:36] [INFO ] Flatten gal took : 7 ms
[2026-05-24 04:42:36] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:42:36] [INFO ] Input system was already deterministic with 217 transitions.
[2026-05-24 04:42:36] [INFO ] Flatten gal took : 7 ms
[2026-05-24 04:42:36] [INFO ] Flatten gal took : 7 ms
[2026-05-24 04:42:36] [INFO ] Time to serialize gal into /tmp/CTLFireability12647446592517663031.gal : 2 ms
[2026-05-24 04:42:36] [INFO ] Time to serialize properties into /tmp/CTLFireability8749933368063191115.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/CTLFireability12647446592517663031.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8749933368063191115.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,33059,1.76806,43496,2,7073,5,106878,6,0,773,101771,0


Converting to forward existential form...Done !
original formula: EX(EG((EX(((p195<1)||(l0<1))) * ((EX(((p311<1)||(l3103<1))) + (s1<1)) + (l4119<1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),(EX(((p195<1)||(l0<1))) * ((EX(((p311<1)||(l3103<1))) + (s1<1)) + (l4119<1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t76, t77, t81, t82, t83, t84, t85, t86, t87, t88, t89, t90, t91, t92, t...707
(forward)formula 0,1,6.69376,149720,1,0,529,527715,459,250,5571,404976,565
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 288/288 places, 664/664 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 231 transition count 418
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 231 transition count 418
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 130 place count 231 transition count 402
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 172 place count 189 transition count 349
Iterating global reduction 1 with 42 rules applied. Total rules applied 214 place count 189 transition count 349
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 239 place count 189 transition count 324
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 270 place count 158 transition count 276
Iterating global reduction 2 with 31 rules applied. Total rules applied 301 place count 158 transition count 276
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 313 place count 158 transition count 264
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 329 place count 142 transition count 220
Iterating global reduction 3 with 16 rules applied. Total rules applied 345 place count 142 transition count 220
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 350 place count 142 transition count 215
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 359 place count 133 transition count 205
Iterating global reduction 4 with 9 rules applied. Total rules applied 368 place count 133 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 369 place count 133 transition count 204
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 374 place count 128 transition count 199
Iterating global reduction 5 with 5 rules applied. Total rules applied 379 place count 128 transition count 199
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 385 place count 128 transition count 193
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 387 place count 126 transition count 180
Iterating global reduction 6 with 2 rules applied. Total rules applied 389 place count 126 transition count 180
Applied a total of 389 rules in 32 ms. Remains 126 /288 variables (removed 162) and now considering 180/664 (removed 484) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9644542119720221602.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9507872622285869573.kers'
[2026-05-24 04:42:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9644542119720221602.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9507872622285869573.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 126 cols 587 entries
Finished phase 1 with 122 SingleSign rule and 2 generalized
[2026-05-24 04:42:43] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9507872622285869573.kers
Total runtime 1 ms.
[2026-05-24 04:42:43] [INFO ] Implicit Places using invariants in 135 ms returned []
[2026-05-24 04:42:43] [INFO ] Invariant cache hit.
[2026-05-24 04:42:43] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-24 04:42:44] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
[2026-05-24 04:42:44] [INFO ] Redundant transitions in 1 ms returned []
Running 179 sub problems to find dead transitions.
[2026-05-24 04:42:44] [INFO ] Invariant cache hit.
[2026-05-24 04:42:44] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/306 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 60/188 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 188 constraints, problems are : Problem set: 0 solved, 179 unsolved in 13452 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/306 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 60/188 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 179/367 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/306 variables, and 367 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43553ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 43554ms
Starting structural reductions in SI_CTL mode, iteration 1 : 126/288 places, 180/664 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44333 ms. Remains : 126/288 places, 180/664 transitions.
[2026-05-24 04:43:27] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:43:27] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:43:27] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-24 04:43:27] [INFO ] Flatten gal took : 7 ms
[2026-05-24 04:43:27] [INFO ] Flatten gal took : 7 ms
[2026-05-24 04:43:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12552923004395350334.gal : 2 ms
[2026-05-24 04:43:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3053132023214056187.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12552923004395350334.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3053132023214056187.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality3053132023214056187.prop.
RANDOM walk for 40000 steps (9129 resets) in 329 ms. (121 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 24
BEST_FIRST walk for 40003 steps (1755 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 56
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :56 after 88
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :88 after 152
Finished probabilistic random walk after 7864 steps, run visited all 1 properties in 36 ms. (steps per millisecond=218 )
Probabilistic random walk after 7864 steps, saw 3678 distinct states, run finished after 46 ms. (steps per millisecond=170 ) properties seen :1
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 664/664 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 237 transition count 451
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 237 transition count 451
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 120 place count 237 transition count 433
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 158 place count 199 transition count 385
Iterating global reduction 1 with 38 rules applied. Total rules applied 196 place count 199 transition count 385
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 221 place count 199 transition count 360
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 247 place count 173 transition count 322
Iterating global reduction 2 with 26 rules applied. Total rules applied 273 place count 173 transition count 322
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 283 place count 173 transition count 312
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 294 place count 162 transition count 291
Iterating global reduction 3 with 11 rules applied. Total rules applied 305 place count 162 transition count 291
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 313 place count 162 transition count 283
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 319 place count 156 transition count 276
Iterating global reduction 4 with 6 rules applied. Total rules applied 325 place count 156 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 326 place count 156 transition count 275
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 329 place count 153 transition count 272
Iterating global reduction 5 with 3 rules applied. Total rules applied 332 place count 153 transition count 272
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 335 place count 153 transition count 269
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 337 place count 151 transition count 256
Iterating global reduction 6 with 2 rules applied. Total rules applied 339 place count 151 transition count 256
Applied a total of 339 rules in 21 ms. Remains 151 /288 variables (removed 137) and now considering 256/664 (removed 408) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9906390012003030534.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11495191921456573508.kers'
[2026-05-24 04:43:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9906390012003030534.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11495191921456573508.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 256 rows 151 cols 777 entries
Finished phase 1 with 147 SingleSign rule and 2 generalized
[2026-05-24 04:43:28] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11495191921456573508.kers
Total runtime 3 ms.
[2026-05-24 04:43:28] [INFO ] Implicit Places using invariants in 235 ms returned []
[2026-05-24 04:43:28] [INFO ] Invariant cache hit.
[2026-05-24 04:43:28] [INFO ] State equation strengthened by 114 read => feed constraints.
[2026-05-24 04:43:29] [INFO ] Implicit Places using invariants and state equation in 1197 ms returned []
Implicit Place search using SMT with State Equation took 1434 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2026-05-24 04:43:29] [INFO ] Invariant cache hit.
[2026-05-24 04:43:29] [INFO ] State equation strengthened by 114 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 256/407 variables, 151/153 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 114/267 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 4/271 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (OVERLAPS) 0/407 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 407/407 variables, and 272 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 114/114 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 256/407 variables, 151/158 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 114/272 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 255/527 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 527 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 114/114 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60290ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 60292ms
Starting structural reductions in LTL mode, iteration 1 : 151/288 places, 256/664 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61749 ms. Remains : 151/288 places, 256/664 transitions.
[2026-05-24 04:44:29] [INFO ] Flatten gal took : 9 ms
[2026-05-24 04:44:29] [INFO ] Flatten gal took : 10 ms
[2026-05-24 04:44:29] [INFO ] Input system was already deterministic with 256 transitions.
[2026-05-24 04:44:29] [INFO ] Flatten gal took : 9 ms
[2026-05-24 04:44:29] [INFO ] Flatten gal took : 9 ms
[2026-05-24 04:44:30] [INFO ] Time to serialize gal into /tmp/CTLFireability13756772683866012782.gal : 3 ms
[2026-05-24 04:44:30] [INFO ] Time to serialize properties into /tmp/CTLFireability7065122414595375167.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/CTLFireability13756772683866012782.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7065122414595375167.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,42653,3.78021,80796,2,11153,5,194820,6,0,860,192090,0


Converting to forward existential form...Done !
original formula: (AG(EF(((s1>=1)&&(l2754>=1)))) * (AX(((((s1>=1)&&(l1757>=1))||((s1>=1)&&(l3080>=1)))||((s1>=1)&&(l1675>=1)))) + AG((((((s1<1)||(l4114<1))...228
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U ((s1>=1)&&(l2754>=1)))))] = FALSE * [(FwdU((Init * !(!(EX(!(((((s1>=1)&&(l1757>=...326
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t27, t29, t70, t72, t73, t74, t75, t76, t77, t78, t79, t80, t81, t82, t...1019
(forward)formula 0,0,12.1112,217932,1,0,466,645193,532,170,6145,386558,522
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 664/664 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 237 transition count 437
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 237 transition count 437
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 117 place count 237 transition count 422
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 154 place count 200 transition count 375
Iterating global reduction 1 with 37 rules applied. Total rules applied 191 place count 200 transition count 375
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 211 place count 200 transition count 355
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 239 place count 172 transition count 310
Iterating global reduction 2 with 28 rules applied. Total rules applied 267 place count 172 transition count 310
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 279 place count 172 transition count 298
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 291 place count 160 transition count 276
Iterating global reduction 3 with 12 rules applied. Total rules applied 303 place count 160 transition count 276
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 308 place count 160 transition count 271
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 315 place count 153 transition count 263
Iterating global reduction 4 with 7 rules applied. Total rules applied 322 place count 153 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 323 place count 153 transition count 262
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 326 place count 150 transition count 259
Iterating global reduction 5 with 3 rules applied. Total rules applied 329 place count 150 transition count 259
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 333 place count 150 transition count 255
Applied a total of 333 rules in 23 ms. Remains 150 /288 variables (removed 138) and now considering 255/664 (removed 409) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10170125325994899186.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11486792879473664346.kers'
[2026-05-24 04:44:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10170125325994899186.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11486792879473664346.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 255 rows 150 cols 777 entries
Finished phase 1 with 146 SingleSign rule and 2 generalized
[2026-05-24 04:44:42] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11486792879473664346.kers
Total runtime 2 ms.
[2026-05-24 04:44:42] [INFO ] Implicit Places using invariants in 264 ms returned []
[2026-05-24 04:44:42] [INFO ] Invariant cache hit.
[2026-05-24 04:44:42] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-24 04:44:43] [INFO ] Implicit Places using invariants and state equation in 1261 ms returned []
Implicit Place search using SMT with State Equation took 1527 ms to find 0 implicit places.
Running 254 sub problems to find dead transitions.
[2026-05-24 04:44:43] [INFO ] Invariant cache hit.
[2026-05-24 04:44:43] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 255/405 variables, 150/152 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 112/264 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 405/405 variables, and 269 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (OVERLAPS) 255/405 variables, 150/157 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 112/269 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 254/523 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 405/405 variables, and 523 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60284ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 60286ms
Starting structural reductions in LTL mode, iteration 1 : 150/288 places, 255/664 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61837 ms. Remains : 150/288 places, 255/664 transitions.
[2026-05-24 04:45:44] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:45:44] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:45:44] [INFO ] Input system was already deterministic with 255 transitions.
[2026-05-24 04:45:44] [INFO ] Flatten gal took : 7 ms
[2026-05-24 04:45:44] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:45:44] [INFO ] Time to serialize gal into /tmp/CTLFireability17425372660199768629.gal : 2 ms
[2026-05-24 04:45:44] [INFO ] Time to serialize properties into /tmp/CTLFireability3757473087031321900.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/CTLFireability17425372660199768629.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3757473087031321900.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,39116,3.4894,86368,2,11835,5,210912,6,0,855,193849,0


Converting to forward existential form...Done !
original formula: EG(EF(((!(A(((p26>=1)&&(l0>=1)) U ((s1>=1)&&(l1631>=1)))) * EX(((s1<1)||(l4279<1)))) * ((EX(((p35<1)||(l0<1))) + (((s1<1)||(l2472<1))&&((...224
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((!(!((E(!(((s1>=1)&&(l1631>=1))) U (!(((p26>=1)&&(l0>=1))) * !(((s1>=1)&&(l1631>=1))))) + E...344
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t24, t25, t26, t28, t75, t76, t77, t79, t82, t83, t84, t85, t86, t87, t...1024
(forward)formula 0,1,17.5912,376476,1,0,730,1.69163e+06,550,332,6249,947014,768
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-24 04:46:01] [INFO ] Flatten gal took : 13 ms
[2026-05-24 04:46:01] [INFO ] Flatten gal took : 13 ms
Total runtime 966580 ms.

BK_STOP 1779597961994

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

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