Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969020000233.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 MedleyA-PT-18, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020000233
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 8.9K Mar 7 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Mar 7 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 7 18:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 7 18:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 11:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 18:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Mar 7 18:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 7 18:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 7 18:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 158K 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 MedleyA-PT-18-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779700851157

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-25 09:20:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 09:20:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:20:52] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2026-05-25 09:20:52] [INFO ] Transformed 252 places.
[2026-05-25 09:20:52] [INFO ] Transformed 543 transitions.
[2026-05-25 09:20:52] [INFO ] Found NUPN structural information;
[2026-05-25 09:20:52] [INFO ] Parsed PT model containing 252 places and 543 transitions and 2436 arcs in 256 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-18-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 106 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 541/541 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 230 transition count 504
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 230 transition count 504
Applied a total of 44 rules in 24 ms. Remains 230 /252 variables (removed 22) and now considering 504/541 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10851834794951088969.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10183213316588471959.kers'
[2026-05-25 09:20:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10851834794951088969.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10183213316588471959.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 504 rows 230 cols 2358 entries
Finished phase 1 with 222 SingleSign rule and 1 generalized
[2026-05-25 09:20:53] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10183213316588471959.kers
Total runtime 3 ms.
[2026-05-25 09:20:53] [INFO ] Implicit Places using invariants in 316 ms returned []
[2026-05-25 09:20:53] [INFO ] Invariant cache hit.
[2026-05-25 09:20:53] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
Running 503 sub problems to find dead transitions.
[2026-05-25 09:20:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 230/734 variables, and 57 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/230 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 230/734 variables, and 81 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/230 constraints, PredecessorRefiner: 0/503 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60481ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 60509ms
Starting structural reductions in LTL mode, iteration 1 : 230/252 places, 504/541 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61213 ms. Remains : 230/252 places, 504/541 transitions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 504/504 transitions.
Applied a total of 0 rules in 5 ms. Remains 230 /230 variables (removed 0) and now considering 504/504 (removed 0) transitions.
[2026-05-25 09:21:54] [INFO ] Invariant cache hit.
[2026-05-25 09:21:54] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-25 09:21:54] [INFO ] Invariant cache hit.
[2026-05-25 09:21:54] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 324 ms. Remains : 230/230 places, 504/504 transitions.
Support contains 106 out of 230 places after structural reductions.
[2026-05-25 09:21:54] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-25 09:21:54] [INFO ] Flatten gal took : 84 ms
[2026-05-25 09:21:54] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-18-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 09:21:54] [INFO ] Flatten gal took : 33 ms
[2026-05-25 09:21:54] [INFO ] Input system was already deterministic with 504 transitions.
Support contains 100 out of 230 places (down from 106) after GAL structural reductions.
RANDOM walk for 40000 steps (1535 resets) in 1562 ms. (25 steps per ms) remains 62/75 properties
BEST_FIRST walk for 4004 steps (34 resets) in 68 ms. (58 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (33 resets) in 31 ms. (125 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (33 resets) in 15 ms. (250 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (34 resets) in 34 ms. (114 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (34 resets) in 18 ms. (210 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (33 resets) in 12 ms. (307 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (31 resets) in 37 ms. (105 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (32 resets) in 12 ms. (308 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (35 resets) in 11 ms. (333 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (32 resets) in 16 ms. (235 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (33 resets) in 11 ms. (333 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (32 resets) in 12 ms. (308 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (35 resets) in 11 ms. (333 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (34 resets) in 14 ms. (266 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (34 resets) in 17 ms. (222 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (32 resets) in 17 ms. (222 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (34 resets) in 16 ms. (235 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (35 resets) in 14 ms. (266 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (33 resets) in 21 ms. (181 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (34 resets) in 19 ms. (200 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (34 resets) in 19 ms. (200 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (33 resets) in 11 ms. (333 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4001 steps (34 resets) in 18 ms. (210 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (33 resets) in 20 ms. (190 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (33 resets) in 10 ms. (363 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (33 resets) in 11 ms. (333 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (35 resets) in 25 ms. (153 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (35 resets) in 15 ms. (250 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (33 resets) in 15 ms. (250 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (33 resets) in 17 ms. (222 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (35 resets) in 12 ms. (307 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (35 resets) in 13 ms. (285 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (34 resets) in 11 ms. (333 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (35 resets) in 12 ms. (307 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (35 resets) in 10 ms. (363 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (34 resets) in 22 ms. (174 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (35 resets) in 13 ms. (286 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (35 resets) in 15 ms. (250 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (33 resets) in 18 ms. (210 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (35 resets) in 20 ms. (190 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (34 resets) in 21 ms. (181 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (28 resets) in 12 ms. (308 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (34 resets) in 16 ms. (235 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (34 resets) in 16 ms. (235 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (36 resets) in 16 ms. (235 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (32 resets) in 25 ms. (153 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (33 resets) in 17 ms. (222 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (33 resets) in 16 ms. (235 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (32 resets) in 16 ms. (235 steps per ms) remains 62/62 properties
[2026-05-25 09:21:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 141/230 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 504/734 variables, 230/237 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/734 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 0/734 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 734/734 variables, and 237 constraints, problems are : Problem set: 0 solved, 62 unsolved in 2205 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Problem AtomicPropp36 is UNSAT
At refinement iteration 1 (OVERLAPS) 141/230 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 20/27 constraints. Problems are: Problem set: 1 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 5/32 constraints. Problems are: Problem set: 1 solved, 61 unsolved
SMT process timed out in 7297ms, After SMT, problems are : Problem set: 1 solved, 61 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 88 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 504/504 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 230 transition count 493
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 24 place count 219 transition count 491
Reduce places removed 1 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 12 rules applied. Total rules applied 36 place count 218 transition count 480
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 47 place count 207 transition count 480
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 47 place count 207 transition count 474
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 59 place count 201 transition count 474
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 66 place count 194 transition count 464
Iterating global reduction 4 with 7 rules applied. Total rules applied 73 place count 194 transition count 464
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 97 place count 182 transition count 452
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 117 place count 172 transition count 491
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 137 place count 172 transition count 471
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 171 transition count 470
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 171 transition count 470
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 145 place count 168 transition count 467
Free-agglomeration rule applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 158 place count 168 transition count 454
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 171 place count 155 transition count 454
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 173 place count 155 transition count 452
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 176 place count 155 transition count 452
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 177 place count 154 transition count 451
Applied a total of 177 rules in 210 ms. Remains 154 /230 variables (removed 76) and now considering 451/504 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 154/230 places, 451/504 transitions.
RANDOM walk for 40000 steps (2700 resets) in 759 ms. (52 steps per ms) remains 42/61 properties
BEST_FIRST walk for 4003 steps (84 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (75 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (90 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (88 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (80 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (74 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (78 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (81 resets) in 25 ms. (153 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (82 resets) in 28 ms. (138 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (76 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (90 resets) in 26 ms. (148 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (92 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (79 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (78 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (30 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (76 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (82 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (82 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (79 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (77 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (88 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (90 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (82 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (93 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (91 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (93 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (89 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (83 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (107 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (89 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (87 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (85 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (88 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (73 resets) in 8 ms. (444 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (88 resets) in 13 ms. (286 steps per ms) remains 40/42 properties
BEST_FIRST walk for 4004 steps (94 resets) in 10 ms. (364 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (82 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (71 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (87 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (79 resets) in 10 ms. (363 steps per ms) remains 40/40 properties
[2026-05-25 09:22:03] [INFO ] Flow matrix only has 448 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17893610015868129921.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-434892395637989355.kers'
[2026-05-25 09:22:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17893610015868129921.kers, --Pflows, --basisKERS=/tmp/petrispot-output-434892395637989355.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 448 rows 154 cols 2069 entries
Finished phase 1 with 146 SingleSign rule and 1 generalized
[2026-05-25 09:22:03] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-434892395637989355.kers
Total runtime 2 ms.
[2026-05-25 09:22:03] [INFO ] State equation strengthened by 103 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 94/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 448/602 variables, 154/161 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/602 variables, 103/264 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/602 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/602 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 264 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1633 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 94/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 448/602 variables, 154/188 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 103/291 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 40/331 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/602 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/602 variables, and 333 constraints, problems are : Problem set: 0 solved, 40 unsolved in 45032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46689ms problems are : Problem set: 0 solved, 40 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 451/451 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 154 transition count 449
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 152 transition count 447
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 150 transition count 447
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 8 place count 150 transition count 445
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 12 place count 148 transition count 445
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 16 place count 144 transition count 439
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 144 transition count 439
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 32 place count 138 transition count 433
Performed 6 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 44 place count 132 transition count 462
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 51 place count 132 transition count 455
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 53 place count 132 transition count 453
Free-agglomeration rule applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 62 place count 132 transition count 444
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 72 place count 123 transition count 443
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 77 place count 123 transition count 438
Applied a total of 77 rules in 88 ms. Remains 123 /154 variables (removed 31) and now considering 438/451 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 123/154 places, 438/451 transitions.
RANDOM walk for 40000 steps (3427 resets) in 474 ms. (84 steps per ms) remains 38/40 properties
BEST_FIRST walk for 4004 steps (103 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (109 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (117 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (106 resets) in 19 ms. (200 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4003 steps (114 resets) in 22 ms. (174 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (125 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (112 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (114 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (104 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (107 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (109 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (114 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (108 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (113 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (31 resets) in 8 ms. (444 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4003 steps (106 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (98 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (108 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (103 resets) in 28 ms. (138 steps per ms) remains 34/36 properties
BEST_FIRST walk for 4002 steps (118 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (116 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (120 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (110 resets) in 13 ms. (285 steps per ms) remains 32/34 properties
BEST_FIRST walk for 4003 steps (113 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (146 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (125 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (107 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (127 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (111 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (115 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (104 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (115 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (112 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (109 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (104 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
[2026-05-25 09:22:50] [INFO ] Flow matrix only has 428 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9147331353261295885.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-358962079254973764.kers'
[2026-05-25 09:22:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9147331353261295885.kers, --Pflows, --basisKERS=/tmp/petrispot-output-358962079254973764.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 428 rows 123 cols 2075 entries
Finished phase 1 with 115 SingleSign rule and 1 generalized
[2026-05-25 09:22:50] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-358962079254973764.kers
Total runtime 2 ms.
[2026-05-25 09:22:50] [INFO ] State equation strengthened by 117 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 72/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 428/551 variables, 123/130 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 117/247 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 247 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1449 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 72/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 428/551 variables, 123/139 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 117/256 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 32/288 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 5/293 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/551 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/551 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 296 constraints, problems are : Problem set: 0 solved, 32 unsolved in 75016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 76498ms problems are : Problem set: 0 solved, 32 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 51 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 438/438 transitions.
Graph (trivial) has 35 edges and 123 vertex of which 4 / 123 are part of one of the 2 SCC in 8 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 121 transition count 433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 120 transition count 433
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 120 transition count 431
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 118 transition count 431
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 116 transition count 429
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 17 place count 113 transition count 431
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 113 transition count 428
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 113 transition count 426
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 111 transition count 426
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 28 place count 111 transition count 422
Applied a total of 28 rules in 124 ms. Remains 111 /123 variables (removed 12) and now considering 422/438 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 111/123 places, 422/438 transitions.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2026-05-25 09:24:07] [INFO ] Flatten gal took : 31 ms
[2026-05-25 09:24:07] [INFO ] Flatten gal took : 26 ms
[2026-05-25 09:24:07] [INFO ] Input system was already deterministic with 504 transitions.
Computed a total of 19 stabilizing places and 19 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 504/504 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 206 transition count 466
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 206 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 205 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 205 transition count 465
Applied a total of 50 rules in 22 ms. Remains 205 /230 variables (removed 25) and now considering 465/504 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11527460781135639842.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8416096248630071567.kers'
[2026-05-25 09:24:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11527460781135639842.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8416096248630071567.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 465 rows 205 cols 2280 entries
Finished phase 1 with 197 SingleSign rule and 1 generalized
[2026-05-25 09:24:07] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8416096248630071567.kers
Total runtime 2 ms.
[2026-05-25 09:24:07] [INFO ] Implicit Places using invariants in 144 ms returned []
[2026-05-25 09:24:07] [INFO ] Invariant cache hit.
[2026-05-25 09:24:07] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2026-05-25 09:24:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 205/670 variables, and 55 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/205 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 48/55 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
At refinement iteration 6 (OVERLAPS) 465/670 variables, 205/271 constraints. Problems are: Problem set: 50 solved, 414 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/670 variables, 414/685 constraints. Problems are: Problem set: 50 solved, 414 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/670 variables, and 685 constraints, problems are : Problem set: 50 solved, 414 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 414/464 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60192ms problems are : Problem set: 50 solved, 414 unsolved
Search for dead transitions found 50 dead transitions in 60193ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 205/230 places, 415/504 transitions.
Applied a total of 0 rules in 4 ms. Remains 205 /205 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60612 ms. Remains : 205/230 places, 415/504 transitions.
[2026-05-25 09:25:08] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:25:08] [INFO ] Flatten gal took : 28 ms
[2026-05-25 09:25:08] [INFO ] Input system was already deterministic with 415 transitions.
[2026-05-25 09:25:08] [INFO ] Flatten gal took : 19 ms
[2026-05-25 09:25:08] [INFO ] Flatten gal took : 19 ms
[2026-05-25 09:25:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality18262163782024874487.gal : 19 ms
[2026-05-25 09:25:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality4447763632505192994.ctl : 18 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/CTLCardinality18262163782024874487.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4447763632505192994.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.
Detected timeout of ITS tools.
[2026-05-25 09:25:38] [INFO ] Flatten gal took : 23 ms
[2026-05-25 09:25:38] [INFO ] Applying decomposition
[2026-05-25 09:25:38] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16800081440963179966.txt' '-o' '/tmp/graph16800081440963179966.bin' '-w' '/tmp/graph16800081440963179966.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16800081440963179966.bin' '-l' '-1' '-v' '-w' '/tmp/graph16800081440963179966.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:25:38] [INFO ] Decomposing Gal with order
[2026-05-25 09:25:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:25:38] [INFO ] Removed a total of 944 redundant transitions.
[2026-05-25 09:25:38] [INFO ] Flatten gal took : 81 ms
[2026-05-25 09:25:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 27 ms.
[2026-05-25 09:25:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality8915865840219201003.gal : 6 ms
[2026-05-25 09:25:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality17873674340673880694.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/CTLCardinality8915865840219201003.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17873674340673880694.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.47272e+07,1.86588,80056,1891,58,116033,647,1073,511312,91,2143,0


Converting to forward existential form...Done !
original formula: E((!((EF((i4.i0.u7.p32==1)) * EX(((((i7.i1.u52.p199==0)||(i7.i1.u52.p200==1))&&((i6.i0.u58.p219==0)||(i9.i1.u2.p4==1)))&&(i4.i1.u48.p182=...526
=> equivalent forward existential formula: [(FwdU((FwdU(Init,(!((E(TRUE U (i4.i0.u7.p32==1)) * EX(((((i7.i1.u52.p199==0)||(i7.i1.u52.p200==1))&&((i6.i0.u58...854
Reverse transition relation is NOT exact ! Due to transitions t28, t39, t57, t96, t105, t114, t119, t184, t200, t233, t235, t241, t243, t265, t267, t273, t...1213
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 504/504 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 202 transition count 459
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 202 transition count 459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 201 transition count 458
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 201 transition count 458
Applied a total of 58 rules in 8 ms. Remains 201 /230 variables (removed 29) and now considering 458/504 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5201857503950863749.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3616342626519743546.kers'
[2026-05-25 09:26:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5201857503950863749.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3616342626519743546.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 458 rows 201 cols 2266 entries
Finished phase 1 with 193 SingleSign rule and 1 generalized
[2026-05-25 09:26:09] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3616342626519743546.kers
Total runtime 2 ms.
[2026-05-25 09:26:09] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-25 09:26:09] [INFO ] Invariant cache hit.
[2026-05-25 09:26:09] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2026-05-25 09:26:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 15/42 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 457 unsolved
SMT process timed out in 30219ms, After SMT, problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 30220ms
Starting structural reductions in LTL mode, iteration 1 : 201/230 places, 458/504 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30726 ms. Remains : 201/230 places, 458/504 transitions.
[2026-05-25 09:26:39] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:26:39] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:26:39] [INFO ] Input system was already deterministic with 458 transitions.
[2026-05-25 09:26:39] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:26:39] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:26:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality9437867562020207551.gal : 4 ms
[2026-05-25 09:26:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality16847028873227692849.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/CTLCardinality9437867562020207551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16847028873227692849.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.
Detected timeout of ITS tools.
[2026-05-25 09:27:09] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:27:09] [INFO ] Applying decomposition
[2026-05-25 09:27:09] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3407373264139403343.txt' '-o' '/tmp/graph3407373264139403343.bin' '-w' '/tmp/graph3407373264139403343.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3407373264139403343.bin' '-l' '-1' '-v' '-w' '/tmp/graph3407373264139403343.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:27:09] [INFO ] Decomposing Gal with order
[2026-05-25 09:27:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:27:10] [INFO ] Removed a total of 1314 redundant transitions.
[2026-05-25 09:27:10] [INFO ] Flatten gal took : 33 ms
[2026-05-25 09:27:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 10 ms.
[2026-05-25 09:27:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality12086518931298117053.gal : 4 ms
[2026-05-25 09:27:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality1432324254619401933.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/CTLCardinality12086518931298117053.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1432324254619401933.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.94267e+07,9.01512,179708,4707,28,128875,432,1043,1.60045e+06,64,927,0


Converting to forward existential form...Done !
original formula: AF(((AX(FALSE) + AF(AG((i5.u58.p200==1)))) + (i3.u38.p137==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((!(EX(!(FALSE))) + !(EG(!(!(E(TRUE U !((i5.u58.p200==1)))))))) + (i3.u38.p137==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t28, t30, t39, t101, t159, t175, t186, t190, t202, t204, t226, t228, t234, t236, t258, t260, ...994
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 504/504 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 204 transition count 462
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 204 transition count 462
Applied a total of 52 rules in 11 ms. Remains 204 /230 variables (removed 26) and now considering 462/504 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2461366271764621125.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11754142476187788933.kers'
[2026-05-25 09:27:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2461366271764621125.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11754142476187788933.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 462 rows 204 cols 2274 entries
Finished phase 1 with 196 SingleSign rule and 1 generalized
[2026-05-25 09:27:40] [INFO ] Computed 7 invariants in 5 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-11754142476187788933.kers
Total runtime 6 ms.
[2026-05-25 09:27:40] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-25 09:27:40] [INFO ] Invariant cache hit.
[2026-05-25 09:27:40] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2026-05-25 09:27:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 204/666 variables, and 53 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/204 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
At refinement iteration 8 (OVERLAPS) 462/666 variables, 204/265 constraints. Problems are: Problem set: 50 solved, 411 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/666 variables, 411/676 constraints. Problems are: Problem set: 50 solved, 411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 666/666 variables, and 676 constraints, problems are : Problem set: 50 solved, 411 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 411/461 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60203ms problems are : Problem set: 50 solved, 411 unsolved
Search for dead transitions found 50 dead transitions in 60205ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 204/230 places, 412/504 transitions.
Applied a total of 0 rules in 1 ms. Remains 204 /204 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60693 ms. Remains : 204/230 places, 412/504 transitions.
[2026-05-25 09:28:40] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:28:40] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:28:40] [INFO ] Input system was already deterministic with 412 transitions.
[2026-05-25 09:28:40] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:28:40] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:28:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality13171683711211112899.gal : 4 ms
[2026-05-25 09:28:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality13604094125830833557.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/CTLCardinality13171683711211112899.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13604094125830833557.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.
Detected timeout of ITS tools.
[2026-05-25 09:29:10] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:29:10] [INFO ] Applying decomposition
[2026-05-25 09:29:10] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2917218589258760884.txt' '-o' '/tmp/graph2917218589258760884.bin' '-w' '/tmp/graph2917218589258760884.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2917218589258760884.bin' '-l' '-1' '-v' '-w' '/tmp/graph2917218589258760884.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:29:11] [INFO ] Decomposing Gal with order
[2026-05-25 09:29:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:29:11] [INFO ] Removed a total of 928 redundant transitions.
[2026-05-25 09:29:11] [INFO ] Flatten gal took : 36 ms
[2026-05-25 09:29:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 20 ms.
[2026-05-25 09:29:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality9399591625233141394.gal : 8 ms
[2026-05-25 09:29:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality5920921222150076107.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/CTLCardinality9399591625233141394.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5920921222150076107.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.2074e+07,19.2588,369252,3043,44,281349,886,1060,3.36633e+06,86,3421,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 504/504 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 209 transition count 470
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 209 transition count 470
Applied a total of 42 rules in 9 ms. Remains 209 /230 variables (removed 21) and now considering 470/504 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11545229528425795181.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8730437715700662421.kers'
[2026-05-25 09:29:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11545229528425795181.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8730437715700662421.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 470 rows 209 cols 2290 entries
Finished phase 1 with 201 SingleSign rule and 1 generalized
[2026-05-25 09:29:41] [INFO ] Computed 7 invariants in 5 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8730437715700662421.kers
Total runtime 6 ms.
[2026-05-25 09:29:41] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-05-25 09:29:41] [INFO ] Invariant cache hit.
[2026-05-25 09:29:41] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 469 sub problems to find dead transitions.
[2026-05-25 09:29:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 469 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 209/679 variables, and 52 constraints, problems are : Problem set: 0 solved, 469 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/209 constraints, PredecessorRefiner: 469/469 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 469 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 469 unsolved
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
At refinement iteration 6 (OVERLAPS) 470/679 variables, 209/264 constraints. Problems are: Problem set: 50 solved, 419 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/679 variables, 419/683 constraints. Problems are: Problem set: 50 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 679/679 variables, and 683 constraints, problems are : Problem set: 50 solved, 419 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 419/469 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60186ms problems are : Problem set: 50 solved, 419 unsolved
Search for dead transitions found 50 dead transitions in 60190ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 209/230 places, 420/504 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60580 ms. Remains : 209/230 places, 420/504 transitions.
[2026-05-25 09:30:41] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:30:41] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:30:41] [INFO ] Input system was already deterministic with 420 transitions.
[2026-05-25 09:30:41] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:30:41] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:30:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality2836060737388670037.gal : 3 ms
[2026-05-25 09:30:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality1704895370108780409.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/CTLCardinality2836060737388670037.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1704895370108780409.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.
Detected timeout of ITS tools.
[2026-05-25 09:31:11] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:31:11] [INFO ] Applying decomposition
[2026-05-25 09:31:11] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8213331717897790610.txt' '-o' '/tmp/graph8213331717897790610.bin' '-w' '/tmp/graph8213331717897790610.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8213331717897790610.bin' '-l' '-1' '-v' '-w' '/tmp/graph8213331717897790610.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:31:12] [INFO ] Decomposing Gal with order
[2026-05-25 09:31:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:31:12] [INFO ] Removed a total of 936 redundant transitions.
[2026-05-25 09:31:12] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:31:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 4 ms.
[2026-05-25 09:31:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality4372979766315192071.gal : 3 ms
[2026-05-25 09:31:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality7902271594963155494.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/CTLCardinality4372979766315192071.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7902271594963155494.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.72952e+07,5.58296,174292,3197,41,139113,397,957,1.6036e+06,80,1092,0


Converting to forward existential form...Done !
original formula: (A(A(AG(EX(TRUE)) U (i3.u35.p126==1)) U ((EX((i0.u2.p6==1)) + EG(!(E((i10.u9.p47==0) U (i3.u47.p161==1))))) + !((EG(((i8.i0.i0.u71.p235==...529
=> equivalent forward existential formula: ([FwdG((EY((Init * !(!((E(!(((EX((i0.u2.p6==1)) + EG(!(E((i10.u9.p47==0) U (i3.u47.p161==1))))) + !((EG(((i8.i0....2545
Reverse transition relation is NOT exact ! Due to transitions t41, t59, t79, t81, t86, t100, t107, t191, t196, t198, t205, t238, t240, t246, t248, t270, t2...1157
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 504/504 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 206 transition count 465
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 206 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 205 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 205 transition count 464
Applied a total of 50 rules in 4 ms. Remains 205 /230 variables (removed 25) and now considering 464/504 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11598702243610334066.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2846805395650362845.kers'
[2026-05-25 09:31:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11598702243610334066.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2846805395650362845.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 464 rows 205 cols 2278 entries
Finished phase 1 with 197 SingleSign rule and 1 generalized
[2026-05-25 09:31:42] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2846805395650362845.kers
Total runtime 2 ms.
[2026-05-25 09:31:42] [INFO ] Implicit Places using invariants in 191 ms returned []
[2026-05-25 09:31:42] [INFO ] Invariant cache hit.
[2026-05-25 09:31:42] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
Running 463 sub problems to find dead transitions.
[2026-05-25 09:31:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 14/41 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 6 (OVERLAPS) 464/669 variables, 205/249 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 669/669 variables, and 249 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 463 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 37/44 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 669/669 variables, and 271 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 0/463 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60169ms problems are : Problem set: 0 solved, 463 unsolved
Search for dead transitions found 0 dead transitions in 60170ms
Starting structural reductions in LTL mode, iteration 1 : 205/230 places, 464/504 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60691 ms. Remains : 205/230 places, 464/504 transitions.
[2026-05-25 09:32:42] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:32:42] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:32:42] [INFO ] Input system was already deterministic with 464 transitions.
[2026-05-25 09:32:42] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:32:42] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:32:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality1878483898458027072.gal : 4 ms
[2026-05-25 09:32:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality14222833709905477552.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/CTLCardinality1878483898458027072.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14222833709905477552.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.
Detected timeout of ITS tools.
[2026-05-25 09:33:13] [INFO ] Flatten gal took : 26 ms
[2026-05-25 09:33:13] [INFO ] Applying decomposition
[2026-05-25 09:33:13] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9263223440585405138.txt' '-o' '/tmp/graph9263223440585405138.bin' '-w' '/tmp/graph9263223440585405138.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9263223440585405138.bin' '-l' '-1' '-v' '-w' '/tmp/graph9263223440585405138.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:33:13] [INFO ] Decomposing Gal with order
[2026-05-25 09:33:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:33:13] [INFO ] Removed a total of 1315 redundant transitions.
[2026-05-25 09:33:13] [INFO ] Flatten gal took : 41 ms
[2026-05-25 09:33:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 8 ms.
[2026-05-25 09:33:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality14322577447470821598.gal : 3 ms
[2026-05-25 09:33:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality8459203700284892306.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/CTLCardinality14322577447470821598.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8459203700284892306.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.17243e+07,10.6976,291192,4225,29,185363,406,1216,2.95061e+06,70,1347,0


Converting to forward existential form...Done !
original formula: AG((A((i2.i2.u39.p145!=0) U (((i1.i1.u10.p46==1) + AG((i2.i0.u30.p120==0))) + A(E(((i5.i0.u4.p7==0)||(i5.i0.u5.p13==1)) U ((i7.i1.u66.p21...328
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !(!((E(!((((i1.i1.u10.p46==1) + !(E(TRUE U !((i2.i0.u30.p120==0))))) + !((E(!(EX((i5.i1.u...3656
Reverse transition relation is NOT exact ! Due to transitions t49, t53, t57, t58, t83, t86, t124, t161, t177, t192, t194, t203, t206, t210, t234, t242, t26...1144
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 504/504 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 204 transition count 463
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 204 transition count 463
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 203 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 203 transition count 462
Applied a total of 54 rules in 5 ms. Remains 203 /230 variables (removed 27) and now considering 462/504 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13491029002046636313.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8723851122404436079.kers'
[2026-05-25 09:33:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13491029002046636313.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8723851122404436079.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 462 rows 203 cols 2274 entries
Finished phase 1 with 195 SingleSign rule and 1 generalized
[2026-05-25 09:33:43] [INFO ] Computed 7 invariants in 17 ms
Computed 7 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-8723851122404436079.kers
Total runtime 18 ms.
[2026-05-25 09:33:43] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-25 09:33:43] [INFO ] Invariant cache hit.
[2026-05-25 09:33:43] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2026-05-25 09:33:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 203/665 variables, and 48 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/203 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
At refinement iteration 6 (OVERLAPS) 462/665 variables, 203/256 constraints. Problems are: Problem set: 50 solved, 411 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 411/667 constraints. Problems are: Problem set: 50 solved, 411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 665/665 variables, and 667 constraints, problems are : Problem set: 50 solved, 411 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 411/461 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60197ms problems are : Problem set: 50 solved, 411 unsolved
Search for dead transitions found 50 dead transitions in 60212ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 203/230 places, 412/504 transitions.
Applied a total of 0 rules in 4 ms. Remains 203 /203 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60669 ms. Remains : 203/230 places, 412/504 transitions.
[2026-05-25 09:34:43] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:34:44] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:34:44] [INFO ] Input system was already deterministic with 412 transitions.
[2026-05-25 09:34:44] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:34:44] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:34:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality18087272187414074674.gal : 2 ms
[2026-05-25 09:34:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality17541305733008823100.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/CTLCardinality18087272187414074674.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17541305733008823100.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.
Detected timeout of ITS tools.
[2026-05-25 09:35:14] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:35:14] [INFO ] Applying decomposition
[2026-05-25 09:35:14] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6791566869060502847.txt' '-o' '/tmp/graph6791566869060502847.bin' '-w' '/tmp/graph6791566869060502847.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6791566869060502847.bin' '-l' '-1' '-v' '-w' '/tmp/graph6791566869060502847.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:35:14] [INFO ] Decomposing Gal with order
[2026-05-25 09:35:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:35:14] [INFO ] Removed a total of 957 redundant transitions.
[2026-05-25 09:35:14] [INFO ] Flatten gal took : 22 ms
[2026-05-25 09:35:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 5 ms.
[2026-05-25 09:35:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality4922217718090432506.gal : 3 ms
[2026-05-25 09:35:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality17051720150543505017.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/CTLCardinality4922217718090432506.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17051720150543505017.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.1977e+07,6.28781,176196,2815,28,133241,355,944,1.66745e+06,69,1025,0


Converting to forward existential form...Done !
original formula: E(!(AX((i0.u5.p6==1))) U (i9.i1.u10.p46==1))
=> equivalent forward existential formula: [(FwdU(Init,!(!(EX(!((i0.u5.p6==1)))))) * (i9.i1.u10.p46==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t28, t39, t52, t82, t85, t94, t188, t190, t192, t197, t230, t232, t238, t240, t262, t264, t27...1119
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 504/504 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 206 transition count 465
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 206 transition count 465
Applied a total of 48 rules in 8 ms. Remains 206 /230 variables (removed 24) and now considering 465/504 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10970489248110473099.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11889667805528468217.kers'
[2026-05-25 09:35:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10970489248110473099.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11889667805528468217.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 465 rows 206 cols 2280 entries
Finished phase 1 with 198 SingleSign rule and 1 generalized
[2026-05-25 09:35:44] [INFO ] Computed 7 invariants in 9 ms
Computed 7 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-11889667805528468217.kers
Total runtime 10 ms.
[2026-05-25 09:35:44] [INFO ] Implicit Places using invariants in 145 ms returned []
[2026-05-25 09:35:44] [INFO ] Invariant cache hit.
[2026-05-25 09:35:44] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2026-05-25 09:35:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 206/671 variables, and 55 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/206 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 48/55 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
At refinement iteration 6 (OVERLAPS) 465/671 variables, 206/265 constraints. Problems are: Problem set: 50 solved, 414 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/671 variables, 414/679 constraints. Problems are: Problem set: 50 solved, 414 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 671/671 variables, and 679 constraints, problems are : Problem set: 50 solved, 414 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 414/464 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60217ms problems are : Problem set: 50 solved, 414 unsolved
Search for dead transitions found 50 dead transitions in 60218ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 206/230 places, 415/504 transitions.
Applied a total of 0 rules in 2 ms. Remains 206 /206 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60660 ms. Remains : 206/230 places, 415/504 transitions.
[2026-05-25 09:36:44] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:36:45] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:36:45] [INFO ] Input system was already deterministic with 415 transitions.
[2026-05-25 09:36:45] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:36:45] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:36:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality17582658170424649282.gal : 2 ms
[2026-05-25 09:36:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality1344424884266826092.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/CTLCardinality17582658170424649282.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1344424884266826092.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.
Detected timeout of ITS tools.
[2026-05-25 09:37:15] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:37:15] [INFO ] Applying decomposition
[2026-05-25 09:37:15] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16214622097466929198.txt' '-o' '/tmp/graph16214622097466929198.bin' '-w' '/tmp/graph16214622097466929198.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16214622097466929198.bin' '-l' '-1' '-v' '-w' '/tmp/graph16214622097466929198.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:37:15] [INFO ] Decomposing Gal with order
[2026-05-25 09:37:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:37:15] [INFO ] Removed a total of 922 redundant transitions.
[2026-05-25 09:37:15] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:37:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 5 ms.
[2026-05-25 09:37:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality7613479829208507245.gal : 3 ms
[2026-05-25 09:37:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality12843360078851640289.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/CTLCardinality7613479829208507245.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12843360078851640289.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.37437e+07,6.18235,233952,2444,67,136282,667,888,2.55928e+06,95,2249,0


Converting to forward existential form...Done !
original formula: EX(((E(EX(AX(((i2.i1.u38.p141==0)||(i0.u19.p78==1)))) U (AF(((i0.u19.p88==0)||(i9.u42.p103==1))) * ((i4.u48.p184==0)||(i1.i1.u27.p116==1)...282
=> equivalent forward existential formula: ([FwdG((EY(Init) * (E(EX(!(EX(!(((i2.i1.u38.p141==0)||(i0.u19.p78==1)))))) U (!(EG(!(((i0.u19.p88==0)||(i9.u42.p...583
Reverse transition relation is NOT exact ! Due to transitions t19, t30, t59, t101, t110, t135, t188, t193, t195, t202, t207, t209, t232, t235, t240, t243, ...1033
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 504/504 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 209 transition count 470
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 209 transition count 470
Applied a total of 42 rules in 3 ms. Remains 209 /230 variables (removed 21) and now considering 470/504 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17833477328039773114.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3251191459707919976.kers'
[2026-05-25 09:37:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17833477328039773114.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3251191459707919976.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 470 rows 209 cols 2290 entries
Finished phase 1 with 201 SingleSign rule and 1 generalized
[2026-05-25 09:37:45] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3251191459707919976.kers
Total runtime 2 ms.
[2026-05-25 09:37:45] [INFO ] Implicit Places using invariants in 135 ms returned []
[2026-05-25 09:37:45] [INFO ] Invariant cache hit.
[2026-05-25 09:37:45] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 469 sub problems to find dead transitions.
[2026-05-25 09:37:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 469 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 209/679 variables, and 51 constraints, problems are : Problem set: 0 solved, 469 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/209 constraints, PredecessorRefiner: 469/469 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 469 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 44/51 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 469 unsolved
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
At refinement iteration 8 (OVERLAPS) 470/679 variables, 209/270 constraints. Problems are: Problem set: 13 solved, 456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 679/679 variables, and 726 constraints, problems are : Problem set: 13 solved, 456 unsolved in 30147 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 456/469 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60296ms problems are : Problem set: 13 solved, 456 unsolved
Search for dead transitions found 13 dead transitions in 60297ms
Found 13 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 13 transitions
Dead transitions reduction (with SMT) removed 13 transitions
Starting structural reductions in LTL mode, iteration 1 : 209/230 places, 457/504 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 457/457 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60643 ms. Remains : 209/230 places, 457/504 transitions.
[2026-05-25 09:38:46] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:38:46] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:38:46] [INFO ] Input system was already deterministic with 457 transitions.
[2026-05-25 09:38:46] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:38:46] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:38:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality1404172259723633435.gal : 3 ms
[2026-05-25 09:38:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality2085478894122752235.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/CTLCardinality1404172259723633435.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2085478894122752235.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.
Detected timeout of ITS tools.
[2026-05-25 09:39:16] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:39:16] [INFO ] Applying decomposition
[2026-05-25 09:39:16] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11095030503624021995.txt' '-o' '/tmp/graph11095030503624021995.bin' '-w' '/tmp/graph11095030503624021995.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11095030503624021995.bin' '-l' '-1' '-v' '-w' '/tmp/graph11095030503624021995.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:39:16] [INFO ] Decomposing Gal with order
[2026-05-25 09:39:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:39:16] [INFO ] Removed a total of 1198 redundant transitions.
[2026-05-25 09:39:16] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:39:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 6 ms.
[2026-05-25 09:39:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality5414057074384732799.gal : 4 ms
[2026-05-25 09:39:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality8103815969112208277.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/CTLCardinality5414057074384732799.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8103815969112208277.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.91083e+07,1.86587,63660,2673,79,105763,2172,1123,253141,101,10928,0


Converting to forward existential form...Done !
original formula: (EF(((EG((((i1.i0.u45.p102==0)||(i0.u6.p37==1))||((i2.i1.u18.p82==0)||(i1.i0.u45.p169==1)))) * (((i1.i0.u45.p170==0)&&(i3.i0.u25.p111==1)...648
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((EG((((i1.i0.u45.p102==0)||(i0.u6.p37==1))||((i2.i1.u18.p82==0)||(i1.i0.u45.p169==1)))) * ...2118
Reverse transition relation is NOT exact ! Due to transitions t31, t40, t98, t103, t107, t124, t202, t214, t216, t238, t240, t246, t248, t270, t272, t278, ...1265
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 230/230 places, 504/504 transitions.
Graph (trivial) has 249 edges and 230 vertex of which 13 / 230 are part of one of the 3 SCC in 2 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 219 transition count 442
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 55 rules applied. Total rules applied 107 place count 168 transition count 438
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 109 place count 166 transition count 438
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 109 place count 166 transition count 430
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 125 place count 158 transition count 430
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 151 place count 132 transition count 384
Iterating global reduction 3 with 26 rules applied. Total rules applied 177 place count 132 transition count 384
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 178 place count 132 transition count 383
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 179 place count 131 transition count 383
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 179 place count 131 transition count 381
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 183 place count 129 transition count 381
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 185 place count 127 transition count 363
Iterating global reduction 5 with 2 rules applied. Total rules applied 187 place count 127 transition count 363
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 188 place count 126 transition count 361
Iterating global reduction 5 with 1 rules applied. Total rules applied 189 place count 126 transition count 361
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 219 place count 111 transition count 346
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 221 place count 109 transition count 332
Iterating global reduction 5 with 2 rules applied. Total rules applied 223 place count 109 transition count 332
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 234 place count 109 transition count 321
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 234 place count 109 transition count 319
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 238 place count 107 transition count 319
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 248 place count 102 transition count 314
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 249 place count 101 transition count 310
Iterating global reduction 5 with 1 rules applied. Total rules applied 250 place count 101 transition count 310
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 251 place count 100 transition count 308
Iterating global reduction 5 with 1 rules applied. Total rules applied 252 place count 100 transition count 308
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 253 place count 100 transition count 308
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 254 place count 99 transition count 307
Iterating global reduction 5 with 1 rules applied. Total rules applied 255 place count 99 transition count 307
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 256 place count 99 transition count 306
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 257 place count 98 transition count 305
Applied a total of 257 rules in 155 ms. Remains 98 /230 variables (removed 132) and now considering 305/504 (removed 199) transitions.
[2026-05-25 09:39:46] [INFO ] Flow matrix only has 303 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14704918161579615181.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11453341973386845733.kers'
[2026-05-25 09:39:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14704918161579615181.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11453341973386845733.kers]
Normalized transition count is 302 out of 303 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 302 rows 98 cols 1344 entries
Finished phase 1 with 90 SingleSign rule and 1 generalized
[2026-05-25 09:39:46] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11453341973386845733.kers
Total runtime 5 ms.
[2026-05-25 09:39:46] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-25 09:39:46] [INFO ] Flow matrix only has 303 transitions (discarded 2 similar events)
[2026-05-25 09:39:46] [INFO ] Invariant cache hit.
[2026-05-25 09:39:46] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-25 09:39:46] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2026-05-25 09:39:46] [INFO ] Redundant transitions in 22 ms returned []
Running 300 sub problems to find dead transitions.
[2026-05-25 09:39:46] [INFO ] Flow matrix only has 303 transitions (discarded 2 similar events)
[2026-05-25 09:39:46] [INFO ] Invariant cache hit.
[2026-05-25 09:39:46] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 302/400 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 64/184 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 1/401 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/401 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 185 constraints, problems are : Problem set: 0 solved, 300 unsolved in 28551 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
At refinement iteration 4 (OVERLAPS) 302/400 variables, 98/121 constraints. Problems are: Problem set: 36 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 64/185 constraints. Problems are: Problem set: 36 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 264/449 constraints. Problems are: Problem set: 36 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 1/450 constraints. Problems are: Problem set: 36 solved, 264 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/401 variables, and 450 constraints, problems are : Problem set: 36 solved, 264 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 64/65 constraints, PredecessorRefiner: 264/300 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58704ms problems are : Problem set: 36 solved, 264 unsolved
Search for dead transitions found 36 dead transitions in 58706ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 98/230 places, 269/504 transitions.
Applied a total of 0 rules in 8 ms. Remains 98 /98 variables (removed 0) and now considering 269/269 (removed 0) transitions.
[2026-05-25 09:40:45] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 59262 ms. Remains : 98/230 places, 269/504 transitions.
[2026-05-25 09:40:45] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:40:45] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:40:45] [INFO ] Input system was already deterministic with 269 transitions.
[2026-05-25 09:40:45] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:40:45] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:40:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality7363478347214218581.gal : 1 ms
[2026-05-25 09:40:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality5550859699805939447.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/CTLCardinality7363478347214218581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5550859699805939447.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(AG(!(E((p142==1) U ((p185==0)||(p178==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(E((p142==1) U ((p185==0)||(p178==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t6, t7, t9, t12, t13, t17, t24, t32, t34, t36, t39, t40, t47, t50, t51, t53, t55, t57, t6...537
Detected timeout of ITS tools.
[2026-05-25 09:41:15] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:41:15] [INFO ] Applying decomposition
[2026-05-25 09:41:15] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14523893710633238135.txt' '-o' '/tmp/graph14523893710633238135.bin' '-w' '/tmp/graph14523893710633238135.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14523893710633238135.bin' '-l' '-1' '-v' '-w' '/tmp/graph14523893710633238135.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:41:15] [INFO ] Decomposing Gal with order
[2026-05-25 09:41:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:41:15] [INFO ] Removed a total of 373 redundant transitions.
[2026-05-25 09:41:15] [INFO ] Flatten gal took : 15 ms
[2026-05-25 09:41:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 2 ms.
[2026-05-25 09:41:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality12359989689320296533.gal : 1 ms
[2026-05-25 09:41:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality16102722566810176712.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/CTLCardinality12359989689320296533.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16102722566810176712.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.03754e+06,1.09327,42040,439,3080,16707,57470,505,41387,224,290050,0


Converting to forward existential form...Done !
original formula: AF(AG(!(E((i6.u17.p142==1) U ((i9.u23.p185==0)||(i8.i0.u21.p178==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(E((i6.u17.p142==1) U ((i9.u23.p185==0)||(i8.i0.u21.p178==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t36, t39, t47, t51, t61, t73, t75, t81, t83, t85, t86, t87, t89, t90, t91, t92, t121, t122, t...527
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,7.75888,244388,1,0,162260,241644,3260,603931,1767,2.21923e+06,347619
FORMULA MedleyA-PT-18-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 504/504 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 205 transition count 464
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 205 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 204 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 204 transition count 463
Applied a total of 52 rules in 12 ms. Remains 204 /230 variables (removed 26) and now considering 463/504 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1094430242836588522.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15215697107501233541.kers'
[2026-05-25 09:41:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1094430242836588522.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15215697107501233541.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 463 rows 204 cols 2276 entries
Finished phase 1 with 196 SingleSign rule and 1 generalized
[2026-05-25 09:41:23] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15215697107501233541.kers
Total runtime 3 ms.
[2026-05-25 09:41:23] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-25 09:41:23] [INFO ] Invariant cache hit.
[2026-05-25 09:41:24] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2026-05-25 09:41:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 204/667 variables, and 57 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/204 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
At refinement iteration 4 (OVERLAPS) 463/667 variables, 204/261 constraints. Problems are: Problem set: 50 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/667 variables, 412/673 constraints. Problems are: Problem set: 50 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 667/667 variables, and 673 constraints, problems are : Problem set: 50 solved, 412 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 412/462 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60196ms problems are : Problem set: 50 solved, 412 unsolved
Search for dead transitions found 50 dead transitions in 60197ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 204/230 places, 413/504 transitions.
Applied a total of 0 rules in 2 ms. Remains 204 /204 variables (removed 0) and now considering 413/413 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60578 ms. Remains : 204/230 places, 413/504 transitions.
[2026-05-25 09:42:24] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:42:24] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:42:24] [INFO ] Input system was already deterministic with 413 transitions.
[2026-05-25 09:42:24] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:42:24] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:42:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality12295069574538708683.gal : 2 ms
[2026-05-25 09:42:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality3989329819625088426.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/CTLCardinality12295069574538708683.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3989329819625088426.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.
Detected timeout of ITS tools.
[2026-05-25 09:42:54] [INFO ] Flatten gal took : 28 ms
[2026-05-25 09:42:54] [INFO ] Applying decomposition
[2026-05-25 09:42:54] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2521513187175580903.txt' '-o' '/tmp/graph2521513187175580903.bin' '-w' '/tmp/graph2521513187175580903.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2521513187175580903.bin' '-l' '-1' '-v' '-w' '/tmp/graph2521513187175580903.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:42:54] [INFO ] Decomposing Gal with order
[2026-05-25 09:42:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:42:54] [INFO ] Removed a total of 944 redundant transitions.
[2026-05-25 09:42:54] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:42:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 5 ms.
[2026-05-25 09:42:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality15168837341165381268.gal : 4 ms
[2026-05-25 09:42:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality13804766996729292672.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/CTLCardinality15168837341165381268.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13804766996729292672.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.19773e+07,1.31078,60684,2691,28,101028,392,993,324045,64,1006,0


Converting to forward existential form...Done !
original formula: (EF((EF((i10.i1.u72.p247==1)) * A((i10.i1.u70.p249==0) U (i4.i1.u40.p145==1)))) + (AG((AF((i9.i0.u59.p206==1)) + A(((i10.i0.u17.p71==0)||...293
=> equivalent forward existential formula: ([FwdG((FwdU((Init * !(E(TRUE U (E(TRUE U (i10.i1.u72.p247==1)) * !((E(!((i4.i1.u40.p145==1)) U (!((i10.i1.u70.p...685
Reverse transition relation is NOT exact ! Due to transitions t17, t20, t29, t36, t49, t83, t102, t115, t184, t200, t205, t207, t231, t233, t239, t241, t26...1190
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 230/230 places, 504/504 transitions.
Graph (trivial) has 231 edges and 230 vertex of which 13 / 230 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 219 transition count 446
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 99 place count 172 transition count 442
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 102 place count 170 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 103 place count 169 transition count 441
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 103 place count 169 transition count 433
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 119 place count 161 transition count 433
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 139 place count 141 transition count 397
Iterating global reduction 4 with 20 rules applied. Total rules applied 159 place count 141 transition count 397
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 160 place count 141 transition count 396
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 161 place count 140 transition count 396
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 161 place count 140 transition count 394
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 165 place count 138 transition count 394
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 168 place count 135 transition count 374
Iterating global reduction 6 with 3 rules applied. Total rules applied 171 place count 135 transition count 374
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 172 place count 134 transition count 372
Iterating global reduction 6 with 1 rules applied. Total rules applied 173 place count 134 transition count 372
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 203 place count 119 transition count 357
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 205 place count 117 transition count 343
Iterating global reduction 6 with 2 rules applied. Total rules applied 207 place count 117 transition count 343
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 221 place count 117 transition count 329
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 221 place count 117 transition count 326
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 227 place count 114 transition count 326
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 237 place count 109 transition count 321
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 238 place count 108 transition count 317
Iterating global reduction 6 with 1 rules applied. Total rules applied 239 place count 108 transition count 317
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 240 place count 107 transition count 315
Iterating global reduction 6 with 1 rules applied. Total rules applied 241 place count 107 transition count 315
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 242 place count 106 transition count 314
Applied a total of 242 rules in 48 ms. Remains 106 /230 variables (removed 124) and now considering 314/504 (removed 190) transitions.
[2026-05-25 09:43:24] [INFO ] Flow matrix only has 312 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17304699628245060502.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-473227555260550793.kers'
[2026-05-25 09:43:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17304699628245060502.kers, --Pflows, --basisKERS=/tmp/petrispot-output-473227555260550793.kers]
Normalized transition count is 311 out of 312 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 311 rows 106 cols 1419 entries
Finished phase 1 with 98 SingleSign rule and 1 generalized
[2026-05-25 09:43:24] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-473227555260550793.kers
Total runtime 2 ms.
[2026-05-25 09:43:24] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-25 09:43:24] [INFO ] Flow matrix only has 312 transitions (discarded 2 similar events)
[2026-05-25 09:43:24] [INFO ] Invariant cache hit.
[2026-05-25 09:43:24] [INFO ] State equation strengthened by 97 read => feed constraints.
[2026-05-25 09:43:25] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2026-05-25 09:43:25] [INFO ] Redundant transitions in 4 ms returned []
Running 311 sub problems to find dead transitions.
[2026-05-25 09:43:25] [INFO ] Flow matrix only has 312 transitions (discarded 2 similar events)
[2026-05-25 09:43:25] [INFO ] Invariant cache hit.
[2026-05-25 09:43:25] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (OVERLAPS) 311/417 variables, 106/130 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 96/226 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 10 (OVERLAPS) 1/418 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 12 (OVERLAPS) 0/418 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/418 variables, and 229 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 106/106 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Problem TDEAD93 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
At refinement iteration 6 (OVERLAPS) 311/417 variables, 106/132 constraints. Problems are: Problem set: 36 solved, 275 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 96/228 constraints. Problems are: Problem set: 36 solved, 275 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 275/503 constraints. Problems are: Problem set: 36 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/418 variables, and 504 constraints, problems are : Problem set: 36 solved, 275 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 106/106 constraints, ReadFeed: 96/97 constraints, PredecessorRefiner: 275/311 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60192ms problems are : Problem set: 36 solved, 275 unsolved
Search for dead transitions found 36 dead transitions in 60193ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 106/230 places, 278/504 transitions.
Applied a total of 0 rules in 7 ms. Remains 106 /106 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2026-05-25 09:44:25] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 60639 ms. Remains : 106/230 places, 278/504 transitions.
[2026-05-25 09:44:25] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:44:25] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:44:25] [INFO ] Input system was already deterministic with 278 transitions.
[2026-05-25 09:44:25] [INFO ] Flatten gal took : 23 ms
[2026-05-25 09:44:25] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:44:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality12750594186286222024.gal : 2 ms
[2026-05-25 09:44:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality9110654999537068633.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/CTLCardinality12750594186286222024.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9110654999537068633.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(A(((p71==0)||(p9==1)) U ((p225==0)||(p186==1))) U ((!(((p100==1) + AG(((p23==0)||(p64==1))))) * !((((p212==0)||(p107==1)) * E((p5==1) U...194
=> equivalent forward existential formula: ([(((FwdU(Init,!((E(!(((p225==0)||(p186==1))) U (!(((p71==0)||(p9==1))) * !(((p225==0)||(p186==1))))) + EG(!(((p...559
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t9, t12, t13, t23, t29, t30, t31, t33, t36, t37, t41, t46, t49, t51, t52, t54, t56, t...614
Detected timeout of ITS tools.
[2026-05-25 09:44:55] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:44:55] [INFO ] Applying decomposition
[2026-05-25 09:44:55] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6496878759566885054.txt' '-o' '/tmp/graph6496878759566885054.bin' '-w' '/tmp/graph6496878759566885054.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6496878759566885054.bin' '-l' '-1' '-v' '-w' '/tmp/graph6496878759566885054.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:44:55] [INFO ] Decomposing Gal with order
[2026-05-25 09:44:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:44:55] [INFO ] Removed a total of 482 redundant transitions.
[2026-05-25 09:44:55] [INFO ] Flatten gal took : 15 ms
[2026-05-25 09:44:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 4 ms.
[2026-05-25 09:44:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality14310471118130468289.gal : 2 ms
[2026-05-25 09:44:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality6029612475849431513.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/CTLCardinality14310471118130468289.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6029612475849431513.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.31632e+06,1.15409,40936,763,861,35355,17627,662,163885,144,148506,0


Converting to forward existential form...Done !
original formula: E(A(((i7.u33.p71==0)||(u1.p9==1)) U ((i6.i0.u31.p225==0)||(i5.i1.u25.p186==1))) U ((!(((i7.u13.p100==1) + AG(((i7.u2.p23==0)||(i2.u7.p64=...286
=> equivalent forward existential formula: ([(((FwdU(Init,!((E(!(((i6.i0.u31.p225==0)||(i5.i1.u25.p186==1))) U (!(((i7.u33.p71==0)||(u1.p9==1))) * !(((i6.i...793
Reverse transition relation is NOT exact ! Due to transitions t23, t77, t79, t90, t92, t93, t94, t95, t97, t98, t99, t127, t128, t131, t132, t133, t157, t1...791
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,26.4767,515804,1,0,384502,69686,4165,3.70138e+06,824,1.22376e+06,967329
FORMULA MedleyA-PT-18-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2026-05-25 09:45:22] [INFO ] Flatten gal took : 26 ms
[2026-05-25 09:45:22] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:45:22] [INFO ] Applying decomposition
[2026-05-25 09:45:22] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15731879982615092504.txt' '-o' '/tmp/graph15731879982615092504.bin' '-w' '/tmp/graph15731879982615092504.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15731879982615092504.bin' '-l' '-1' '-v' '-w' '/tmp/graph15731879982615092504.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:45:22] [INFO ] Decomposing Gal with order
[2026-05-25 09:45:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:45:22] [INFO ] Removed a total of 1248 redundant transitions.
[2026-05-25 09:45:22] [INFO ] Flatten gal took : 37 ms
[2026-05-25 09:45:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 5 ms.
[2026-05-25 09:45:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality8747568042398224492.gal : 3 ms
[2026-05-25 09:45:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality4453502367431643637.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/CTLCardinality8747568042398224492.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4453502367431643637.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.93735e+07,2.07021,67780,3818,154,87967,1100,1065,353132,105,5474,0


Converting to forward existential form...Done !
original formula: E((!((EF((i0.u9.p32==1)) * EX(((((i7.i1.u58.p199==0)||(i7.i1.u59.p200==1))&&((i8.i2.u67.p219==0)||(i2.i0.u2.p4==1)))&&(i9.i0.u54.p182==1)...520
=> equivalent forward existential formula: [(FwdU((FwdU(Init,(!((E(TRUE U (i0.u9.p32==1)) * EX(((((i7.i1.u58.p199==0)||(i7.i1.u59.p200==1))&&((i8.i2.u67.p2...860
Reverse transition relation is NOT exact ! Due to transitions t2, t18, t21, t35, t55, t92, t95, t99, t106, t117, t126, t212, t227, t272, t274, t280, t282, ...1691
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,67.9778,1362600,1,0,1.68281e+06,3597,9545,7.277e+06,690,18864,4466971
FORMULA MedleyA-PT-18-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(((AX(FALSE) + AF(AG((i7.i1.u59.p200==1)))) + (i6.i0.u37.p137==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((!(EX(!(FALSE))) + !(EG(!(!(E(TRUE U !((i7.i1.u59.p200==1)))))))) + (i6.i0.u37.p137==1))))] = FALS...156
(forward)formula 1,0,168.046,2205508,1,0,2.51067e+06,3723,2603,1.3971e+07,216,21113,2405025
FORMULA MedleyA-PT-18-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF((EX(((i8.i2.u67.p218==0)||(i5.i0.u44.p159==1))) * EF(EG(!(A((i8.i2.u63.p220==1) U ((i10.u74.p242==0)||(i7.i1.u69.p223==1))))))))
=> equivalent forward existential formula: [FwdG(Init,!((EX(((i8.i2.u67.p218==0)||(i5.i0.u44.p159==1))) * E(TRUE U EG(!(!((E(!(((i10.u74.p242==0)||(i7.i1.u...309
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 2,1,192.849,2205508,1,0,2.51067e+06,3723,4150,1.3971e+07,300,21113,4083530
FORMULA MedleyA-PT-18-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
ITS-tools command line returned an error code 139
[2026-05-25 09:50:44] [INFO ] Applying decomposition
[2026-05-25 09:50:44] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:50:44] [INFO ] Decomposing Gal with order
[2026-05-25 09:50:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:50:44] [INFO ] Removed a total of 838 redundant transitions.
[2026-05-25 09:50:44] [INFO ] Flatten gal took : 19 ms
[2026-05-25 09:50:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 218 labels/synchronizations in 3 ms.
[2026-05-25 09:50:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality203360247257992799.gal : 1 ms
[2026-05-25 09:50:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality13622235085086685198.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/CTLCardinality203360247257992799.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13622235085086685198.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.93735e+07,2.22158,83684,1238,3021,61253,66879,249,288373,559,705742,0


Converting to forward existential form...Done !
original formula: (A(A(AG(EX(TRUE)) U (i0.i1.u10.p126==1)) U ((EX((i0.i0.i0.u4.p6==1)) + EG(!(E((i0.i0.i0.u5.p47==0) U (i0.i1.u10.p161==1))))) + !((EG(((i0...589
=> equivalent forward existential formula: ([FwdG((EY((Init * !(!((E(!(((EX((i0.i0.i0.u4.p6==1)) + EG(!(E((i0.i0.i0.u5.p47==0) U (i0.i1.u10.p161==1))))) + ...2903
Reverse transition relation is NOT exact ! Due to transitions t255, t376, u12.t1, u12.t2, u12.t4, u12.t6, i0.t499, i0.t468, i0.t423, i0.i0.i0.u4.t229, i0.i...2154
Detected timeout of ITS tools.
[2026-05-25 10:18:57] [INFO ] Flatten gal took : 296 ms
[2026-05-25 10:18:58] [INFO ] Input system was already deterministic with 504 transitions.
[2026-05-25 10:18:58] [INFO ] Transformed 230 places.
[2026-05-25 10:18:58] [INFO ] Transformed 504 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-25 10:18:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality11495304203850875687.gal : 40 ms
[2026-05-25 10:18:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality6465619689844237043.ctl : 5 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/CTLCardinality11495304203850875687.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6465619689844237043.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CTLCardinality -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="MedleyA-PT-18"
export BK_EXAMINATION="CTLCardinality"
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 MedleyA-PT-18, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-oct2-177969020000233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-18.tgz
mv MedleyA-PT-18 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;