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-177969019900161.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-09, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969019900161
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.9K Mar 7 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 7 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 7 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 7 18:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 11:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 11:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Mar 7 18:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 7 18:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 7 18:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:27 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 99K 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-09-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779699543975

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-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-25 08:59:05] [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 08:59:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 08:59:05] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2026-05-25 08:59:05] [INFO ] Transformed 147 places.
[2026-05-25 08:59:05] [INFO ] Transformed 315 transitions.
[2026-05-25 08:59:05] [INFO ] Found NUPN structural information;
[2026-05-25 08:59:05] [INFO ] Parsed PT model containing 147 places and 315 transitions and 1583 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
Support contains 87 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 313/313 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 138 transition count 306
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 138 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 137 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 137 transition count 304
Applied a total of 16 rules in 25 ms. Remains 137 /145 variables (removed 8) and now considering 304/313 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17801451717236527947.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13029731645112739917.kers'
[2026-05-25 08:59:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17801451717236527947.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13029731645112739917.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 304 rows 137 cols 1561 entries
Finished phase 1 with 122 SingleSign rule and 3 generalized
[2026-05-25 08:59:05] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13029731645112739917.kers
Total runtime 3 ms.
[2026-05-25 08:59:06] [INFO ] Implicit Places using invariants in 353 ms returned []
[2026-05-25 08:59:06] [INFO ] Invariant cache hit.
[2026-05-25 08:59:06] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2026-05-25 08:59:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
At refinement iteration 2 (OVERLAPS) 3/137 variables, 9/12 constraints. Problems are: Problem set: 64 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 17/29 constraints. Problems are: Problem set: 64 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/29 constraints. Problems are: Problem set: 64 solved, 239 unsolved
At refinement iteration 5 (OVERLAPS) 304/441 variables, 137/166 constraints. Problems are: Problem set: 64 solved, 239 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 1/167 constraints. Problems are: Problem set: 64 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 2/169 constraints. Problems are: Problem set: 64 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 0/169 constraints. Problems are: Problem set: 64 solved, 239 unsolved
At refinement iteration 9 (OVERLAPS) 0/441 variables, 0/169 constraints. Problems are: Problem set: 64 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/441 variables, and 169 constraints, problems are : Problem set: 64 solved, 239 unsolved in 27511 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 64 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 3/3 constraints. Problems are: Problem set: 64 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 64 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 3/137 variables, 9/12 constraints. Problems are: Problem set: 64 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 17/29 constraints. Problems are: Problem set: 64 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 2/31 constraints. Problems are: Problem set: 64 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 2/33 constraints. Problems are: Problem set: 64 solved, 239 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/33 constraints. Problems are: Problem set: 64 solved, 239 unsolved
At refinement iteration 7 (OVERLAPS) 304/441 variables, 137/170 constraints. Problems are: Problem set: 64 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 239/409 constraints. Problems are: Problem set: 64 solved, 239 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 9/418 constraints. Problems are: Problem set: 64 solved, 239 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 4/422 constraints. Problems are: Problem set: 64 solved, 239 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 441/441 variables, and 424 constraints, problems are : Problem set: 64 solved, 239 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 239/303 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 57967ms problems are : Problem set: 64 solved, 239 unsolved
Search for dead transitions found 64 dead transitions in 57986ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in LTL mode, iteration 1 : 137/145 places, 240/313 transitions.
Applied a total of 0 rules in 3 ms. Remains 137 /137 variables (removed 0) and now considering 240/240 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58797 ms. Remains : 137/145 places, 240/313 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 240/240 transitions.
Applied a total of 0 rules in 2 ms. Remains 137 /137 variables (removed 0) and now considering 240/240 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15153635663721840526.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18132653052169679494.kers'
[2026-05-25 09:00:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15153635663721840526.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18132653052169679494.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 240 rows 137 cols 1049 entries
Finished phase 1 with 122 SingleSign rule and 3 generalized
[2026-05-25 09:00:04] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18132653052169679494.kers
Total runtime 1 ms.
[2026-05-25 09:00:04] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-25 09:00:04] [INFO ] Invariant cache hit.
[2026-05-25 09:00:04] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 239 sub problems to find dead transitions.
[2026-05-25 09:00:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 3/137 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 240/377 variables, 137/165 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 9 (OVERLAPS) 0/377 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 166 constraints, problems are : Problem set: 0 solved, 239 unsolved in 23917 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 3/137 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (OVERLAPS) 240/377 variables, 137/165 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 239/404 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 8/412 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 7/419 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/377 variables, 6/425 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 377/377 variables, and 428 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/1 constraints]
After SMT, in 54049ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 54050ms
Finished structural reductions in LTL mode , in 1 iterations and 54225 ms. Remains : 137/137 places, 240/240 transitions.
Support contains 87 out of 137 places after structural reductions.
[2026-05-25 09:00:59] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2026-05-25 09:00:59] [INFO ] Flatten gal took : 74 ms
FORMULA MedleyA-PT-09-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 09:00:59] [INFO ] Flatten gal took : 48 ms
[2026-05-25 09:00:59] [INFO ] Input system was already deterministic with 240 transitions.
Support contains 77 out of 137 places (down from 87) after GAL structural reductions.
RANDOM walk for 40000 steps (1322 resets) in 1631 ms. (24 steps per ms) remains 14/59 properties
BEST_FIRST walk for 40003 steps (299 resets) in 156 ms. (254 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (288 resets) in 317 ms. (125 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (295 resets) in 156 ms. (254 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (270 resets) in 243 ms. (163 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (299 resets) in 141 ms. (281 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (295 resets) in 152 ms. (261 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (280 resets) in 156 ms. (254 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (298 resets) in 140 ms. (283 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (296 resets) in 104 ms. (380 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (293 resets) in 81 ms. (487 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (287 resets) in 53 ms. (740 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (290 resets) in 43 ms. (909 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (289 resets) in 46 ms. (851 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (294 resets) in 40 ms. (975 steps per ms) remains 14/14 properties
[2026-05-25 09:01:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 104/131 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 6/137 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 240/377 variables, 137/149 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/377 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 149 constraints, problems are : Problem set: 0 solved, 14 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp47 is UNSAT
At refinement iteration 1 (OVERLAPS) 104/131 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 9/18 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 1/19 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 1/20 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 6/137 variables, 3/23 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 240/377 variables, 137/160 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/377 variables, 13/173 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 4/177 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 3/180 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 3/183 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/377 variables, 2/185 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/377 variables, 0/185 constraints. Problems are: Problem set: 1 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 377/377 variables, and 185 constraints, problems are : Problem set: 1 solved, 13 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 13/14 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 5495ms problems are : Problem set: 1 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 240/240 transitions.
Graph (complete) has 441 edges and 137 vertex of which 132 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 132 transition count 220
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 116 transition count 219
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 37 place count 115 transition count 218
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 49 place count 103 transition count 205
Iterating global reduction 3 with 12 rules applied. Total rules applied 61 place count 103 transition count 205
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 105 place count 81 transition count 182
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 81 transition count 180
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 127 place count 71 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 4 with 48 rules applied. Total rules applied 175 place count 71 transition count 177
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 177 place count 70 transition count 189
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 180 place count 70 transition count 186
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 183 place count 67 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 185 place count 67 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 187 place count 65 transition count 184
Applied a total of 187 rules in 90 ms. Remains 65 /137 variables (removed 72) and now considering 184/240 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 65/137 places, 184/240 transitions.
RANDOM walk for 33078 steps (3612 resets) in 303 ms. (108 steps per ms) remains 0/13 properties
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2026-05-25 09:01:06] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:01:06] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:01:06] [INFO ] Input system was already deterministic with 240 transitions.
Support contains 72 out of 137 places (down from 75) after GAL structural reductions.
Computed a total of 16 stabilizing places and 17 stable transitions
Graph (complete) has 441 edges and 137 vertex of which 132 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 240/240 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 135 transition count 240
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 29 place count 108 transition count 209
Iterating global reduction 1 with 27 rules applied. Total rules applied 56 place count 108 transition count 209
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 107 transition count 207
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 107 transition count 207
Applied a total of 58 rules in 7 ms. Remains 107 /137 variables (removed 30) and now considering 207/240 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16535071465628321814.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1183264875725303899.kers'
[2026-05-25 09:01:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16535071465628321814.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1183264875725303899.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 207 rows 107 cols 981 entries
Finished phase 1 with 93 SingleSign rule and 4 generalized
[2026-05-25 09:01:06] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1183264875725303899.kers
Total runtime 1 ms.
[2026-05-25 09:01:06] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-25 09:01:06] [INFO ] Invariant cache hit.
[2026-05-25 09:01:06] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2026-05-25 09:01:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 207/314 variables, 107/123 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 12 (OVERLAPS) 0/314 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 130 constraints, problems are : Problem set: 0 solved, 206 unsolved in 24921 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 207/314 variables, 107/129 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 206/335 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 5/340 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 314/314 variables, and 342 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 55040ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 55042ms
Starting structural reductions in LTL mode, iteration 1 : 107/137 places, 207/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55221 ms. Remains : 107/137 places, 207/240 transitions.
[2026-05-25 09:02:01] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:02:01] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:02:01] [INFO ] Input system was already deterministic with 207 transitions.
[2026-05-25 09:02:01] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:02:01] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:02:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality15826150050244909489.gal : 5 ms
[2026-05-25 09:02:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality6604608277427945194.ctl : 3 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/CTLCardinality15826150050244909489.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6604608277427945194.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (!(E(AF(!(((p11==1)||(p140==1)))) U (EF((p56!=1)) * EX(!(((p110==0)||(p22==1))))))) + !(A((p138==1) U AG(((p10==0)||(p56==1))))))
=> equivalent forward existential formula: [(EY((FwdU((Init * !(!(!((E(!(!(E(TRUE U !(((p10==0)||(p56==1)))))) U (!((p138==1)) * !(!(E(TRUE U !(((p10==0)||...317
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t31, t32, t33, t36, t38, t40, t41, t44, t45,...432
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-25 09:02:31] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:02:31] [INFO ] Applying decomposition
[2026-05-25 09:02:31] [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/graph9973828531540559987.txt' '-o' '/tmp/graph9973828531540559987.bin' '-w' '/tmp/graph9973828531540559987.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9973828531540559987.bin' '-l' '-1' '-v' '-w' '/tmp/graph9973828531540559987.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:02:31] [INFO ] Decomposing Gal with order
[2026-05-25 09:02:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:02:31] [INFO ] Removed a total of 372 redundant transitions.
[2026-05-25 09:02:31] [INFO ] Flatten gal took : 73 ms
[2026-05-25 09:02:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 7 ms.
[2026-05-25 09:02:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality17557853089886896556.gal : 2 ms
[2026-05-25 09:02:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality6980066405971585024.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/CTLCardinality17557853089886896556.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6980066405971585024.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,5.18392e+07,0.136506,10516,573,136,10566,1517,371,24633,112,7283,0


Converting to forward existential form...Done !
original formula: (!(E(AF(!(((i0.u1.p11==1)||(i6.u2.p140==1)))) U (EF((i2.u12.p56!=1)) * EX(!(((i5.u22.p110==0)||(i0.u3.p22==1))))))) + !(A((i7.i1.u28.p138...202
=> equivalent forward existential formula: [(EY((FwdU((Init * !(!(!((E(!(!(E(TRUE U !(((i0.u1.p10==0)||(i2.u12.p56==1)))))) U (!((i7.i1.u28.p138==1)) * !(!...398
Reverse transition relation is NOT exact ! Due to transitions t7, t24, t63, t71, t76, i0.u1.t95, i0.u1.t96, i0.u3.t91, i0.u3.t92, i1.t84, i1.t78, i1.u5.t61...667
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
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
(forward)formula 0,1,17.6723,441120,1,0,605379,29434,2092,2.40857e+06,591,279988,605091
FORMULA MedleyA-PT-09-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 240/240 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 135 transition count 240
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 29 place count 108 transition count 211
Iterating global reduction 1 with 27 rules applied. Total rules applied 56 place count 108 transition count 211
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 107 transition count 209
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 107 transition count 209
Applied a total of 58 rules in 18 ms. Remains 107 /137 variables (removed 30) and now considering 209/240 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9742451090904391397.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6512517517121619764.kers'
[2026-05-25 09:02:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9742451090904391397.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6512517517121619764.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 209 rows 107 cols 985 entries
Finished phase 1 with 93 SingleSign rule and 4 generalized
[2026-05-25 09:02:49] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6512517517121619764.kers
Total runtime 2 ms.
[2026-05-25 09:02:49] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-25 09:02:49] [INFO ] Invariant cache hit.
[2026-05-25 09:02:50] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2026-05-25 09:02:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 209/316 variables, 107/125 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 10 (OVERLAPS) 0/316 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 131 constraints, problems are : Problem set: 0 solved, 208 unsolved in 20001 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 209/316 variables, 107/129 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 208/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/316 variables, and 342 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 50097ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 50097ms
Starting structural reductions in LTL mode, iteration 1 : 107/137 places, 209/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50434 ms. Remains : 107/137 places, 209/240 transitions.
[2026-05-25 09:03:40] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:03:40] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:03:40] [INFO ] Input system was already deterministic with 209 transitions.
[2026-05-25 09:03:40] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:03:40] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:03:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality1414816258473747139.gal : 3 ms
[2026-05-25 09:03:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality15942627579719455970.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/CTLCardinality1414816258473747139.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15942627579719455970.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,6.34798e+07,2.81079,74864,2,6000,5,225370,6,0,637,302313,0


Converting to forward existential form...Done !
original formula: (EX(EG(((p86==0)&&(p39==0)))) + AG(((((p108==1)||((p101==0)&&(p114==1))) * !(A((p115==1) U ((p56==0)||(p125==1))))) * A((p131==1) U (p40=...162
=> equivalent forward existential formula: (([(FwdU((Init * !(EX(EG(((p86==0)&&(p39==0)))))),TRUE) * !(((p108==1)||((p101==0)&&(p114==1)))))] = FALSE * [((...529
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t17, t18, t23, t24, t25, t26, t27, t28, t30, t31, t33, t34, t35, t36, t37,...467
Detected timeout of ITS tools.
[2026-05-25 09:04:10] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:04:10] [INFO ] Applying decomposition
[2026-05-25 09:04:10] [INFO ] Flatten gal took : 9 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/graph16798772718306448161.txt' '-o' '/tmp/graph16798772718306448161.bin' '-w' '/tmp/graph16798772718306448161.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16798772718306448161.bin' '-l' '-1' '-v' '-w' '/tmp/graph16798772718306448161.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:04:10] [INFO ] Decomposing Gal with order
[2026-05-25 09:04:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:04:10] [INFO ] Removed a total of 342 redundant transitions.
[2026-05-25 09:04:10] [INFO ] Flatten gal took : 33 ms
[2026-05-25 09:04:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 4 ms.
[2026-05-25 09:04:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality14722391085795938097.gal : 12 ms
[2026-05-25 09:04:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality4490594938570582094.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/CTLCardinality14722391085795938097.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4490594938570582094.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,6.34798e+07,0.45989,22440,1037,279,30084,2572,396,83766,124,19169,0


Converting to forward existential form...Done !
original formula: (EX(EG(((i6.u18.p86==0)&&(i2.u9.p39==0)))) + AG(((((i7.u23.p108==1)||((i7.u22.p101==0)&&(i7.u23.p114==1))) * !(A((i7.u23.p115==1) U ((i3....233
=> equivalent forward existential formula: (([(FwdU((Init * !(EX(EG(((i6.u18.p86==0)&&(i2.u9.p39==0)))))),TRUE) * !(((i7.u23.p108==1)||((i7.u22.p101==0)&&(...679
Reverse transition relation is NOT exact ! Due to transitions t7, t25, t67, i0.i1.u27.t14, i0.i1.u27.t15, i1.u1.t98, i1.u4.t95, i2.t88, i2.t87, i2.t86, i2....773
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 240/240 transitions.
Graph (complete) has 441 edges and 137 vertex of which 132 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 131 transition count 217
Reduce places removed 19 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 21 rules applied. Total rules applied 41 place count 112 transition count 215
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 44 place count 111 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 110 transition count 213
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 45 place count 110 transition count 208
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 55 place count 105 transition count 208
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 75 place count 85 transition count 185
Iterating global reduction 4 with 20 rules applied. Total rules applied 95 place count 85 transition count 185
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 95 place count 85 transition count 184
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 97 place count 84 transition count 184
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 31 rules applied. Total rules applied 128 place count 68 transition count 169
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 130 place count 66 transition count 165
Iterating global reduction 4 with 2 rules applied. Total rules applied 132 place count 66 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 140 place count 66 transition count 157
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 143 place count 66 transition count 154
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 146 place count 63 transition count 154
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 146 place count 63 transition count 151
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 152 place count 60 transition count 151
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 156 place count 58 transition count 149
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 157 place count 58 transition count 149
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 159 place count 56 transition count 147
Applied a total of 159 rules in 69 ms. Remains 56 /137 variables (removed 81) and now considering 147/240 (removed 93) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17637759227060519065.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1852691273292924532.kers'
[2026-05-25 09:04:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17637759227060519065.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1852691273292924532.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 56 cols 635 entries
Finished phase 1 with 44 SingleSign rule and 3 generalized
[2026-05-25 09:04:40] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1852691273292924532.kers
Total runtime 0 ms.
[2026-05-25 09:04:40] [INFO ] Implicit Places using invariants in 80 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 55/137 places, 147/240 transitions.
Applied a total of 0 rules in 4 ms. Remains 55 /55 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 170 ms. Remains : 55/137 places, 147/240 transitions.
[2026-05-25 09:04:40] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:04:40] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:04:40] [INFO ] Input system was already deterministic with 147 transitions.
[2026-05-25 09:04:40] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:04:40] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:04:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality10868415394468626412.gal : 1 ms
[2026-05-25 09:04:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality5384541932551584538.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/CTLCardinality10868415394468626412.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5384541932551584538.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,690524,0.203919,12504,2,790,5,32673,6,0,366,33829,0


Converting to forward existential form...Done !
original formula: EG(EF(((AG(((p48==0)&&(p17==1))) + EF(((p53==0)||(p82==1)))) + ((p38==0)||(p50==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((!(E(TRUE U !(((p48==0)&&(p17==1))))) + E(TRUE U ((p53==0)||(p82==1)))) + ((p38==0)||(p50==...171
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t5, t8, t9, t12, t14, t15, t16, t17, t19, t24, t25, t28, t29, t31, t33, t43, t93,...286
(forward)formula 0,1,0.805848,30316,1,0,234,125209,322,77,3660,117120,320
FORMULA MedleyA-PT-09-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 240/240 transitions.
Graph (complete) has 441 edges and 137 vertex of which 135 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 135 transition count 218
Reduce places removed 22 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 26 rules applied. Total rules applied 49 place count 113 transition count 214
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 53 place count 111 transition count 212
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 53 place count 111 transition count 210
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 57 place count 109 transition count 210
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 79 place count 87 transition count 184
Iterating global reduction 3 with 22 rules applied. Total rules applied 101 place count 87 transition count 184
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 102 place count 87 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 103 place count 86 transition count 183
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 103 place count 86 transition count 181
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 107 place count 84 transition count 181
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 108 place count 83 transition count 179
Iterating global reduction 5 with 1 rules applied. Total rules applied 109 place count 83 transition count 179
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 31 rules applied. Total rules applied 140 place count 67 transition count 164
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 141 place count 66 transition count 162
Iterating global reduction 5 with 1 rules applied. Total rules applied 142 place count 66 transition count 162
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 148 place count 66 transition count 156
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 150 place count 66 transition count 154
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 152 place count 64 transition count 154
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 152 place count 64 transition count 152
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 156 place count 62 transition count 152
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 160 place count 60 transition count 150
Applied a total of 160 rules in 61 ms. Remains 60 /137 variables (removed 77) and now considering 150/240 (removed 90) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2109452165491543895.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9863808110230651251.kers'
[2026-05-25 09:04:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2109452165491543895.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9863808110230651251.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 150 rows 60 cols 648 entries
Finished phase 1 with 48 SingleSign rule and 3 generalized
[2026-05-25 09:04:41] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9863808110230651251.kers
Total runtime 1 ms.
[2026-05-25 09:04:41] [INFO ] Implicit Places using invariants in 50 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 59/137 places, 150/240 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 117 ms. Remains : 59/137 places, 150/240 transitions.
[2026-05-25 09:04:41] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:04:41] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:04:41] [INFO ] Input system was already deterministic with 150 transitions.
[2026-05-25 09:04:41] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:04:41] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:04:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality5311717860222607361.gal : 1 ms
[2026-05-25 09:04:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality14633665189099842956.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/CTLCardinality5311717860222607361.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14633665189099842956.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.09719e+06,0.247874,14240,2,1473,5,43234,6,0,385,36378,0


Converting to forward existential form...Done !
original formula: AF(!(A((((EF((p72==0)) * (p32!=0)) * ((p128==0)&&((p119==0)||(p54==1)))) * ((p25==0)||(p82==1))) U (!(((p120==0)||(p124==1))) + AG(((p108...175
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!((!(((p120==0)||(p124==1))) + !(E(TRUE U !(((p108==0)||(p54==1))))))) U (!((((E(TRUE U (p72...401
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t9, t10, t11, t13, t14, t16, t17, t19, t20, t22, t23, t24, t26, t27, t28, t31...336
Using saturation style SCC detection
(forward)formula 0,1,7.70715,189264,1,0,572,1.08969e+06,340,278,4072,776910,636
FORMULA MedleyA-PT-09-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 240/240 transitions.
Graph (complete) has 441 edges and 137 vertex of which 132 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 131 transition count 214
Reduce places removed 22 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 26 rules applied. Total rules applied 49 place count 109 transition count 210
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 53 place count 107 transition count 208
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 53 place count 107 transition count 204
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 61 place count 103 transition count 204
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 84 place count 80 transition count 176
Iterating global reduction 3 with 23 rules applied. Total rules applied 107 place count 80 transition count 176
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 108 place count 80 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 109 place count 79 transition count 175
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 109 place count 79 transition count 173
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 113 place count 77 transition count 173
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 114 place count 76 transition count 171
Iterating global reduction 5 with 1 rules applied. Total rules applied 115 place count 76 transition count 171
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 147 place count 59 transition count 156
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 148 place count 58 transition count 154
Iterating global reduction 5 with 1 rules applied. Total rules applied 149 place count 58 transition count 154
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 155 place count 58 transition count 148
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 157 place count 58 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 159 place count 56 transition count 146
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 159 place count 56 transition count 144
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 163 place count 54 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 167 place count 52 transition count 142
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 169 place count 50 transition count 140
Applied a total of 169 rules in 61 ms. Remains 50 /137 variables (removed 87) and now considering 140/240 (removed 100) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4016600781680500404.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11011777247391831175.kers'
[2026-05-25 09:04:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4016600781680500404.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11011777247391831175.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 140 rows 50 cols 592 entries
Finished phase 1 with 40 SingleSign rule and 2 generalized
[2026-05-25 09:04:49] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11011777247391831175.kers
Total runtime 2 ms.
[2026-05-25 09:04:49] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-25 09:04:49] [INFO ] Invariant cache hit.
[2026-05-25 09:04:49] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:04:49] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2026-05-25 09:04:49] [INFO ] Redundant transitions in 2 ms returned []
Running 134 sub problems to find dead transitions.
[2026-05-25 09:04:49] [INFO ] Invariant cache hit.
[2026-05-25 09:04:49] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 2/50 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 140/190 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (OVERLAPS) 0/190 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 75 constraints, problems are : Problem set: 0 solved, 134 unsolved in 5498 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 2/50 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 140/190 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 134/209 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 0/190 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 209 constraints, problems are : Problem set: 0 solved, 134 unsolved in 7764 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13296ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 13296ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/137 places, 140/240 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13532 ms. Remains : 50/137 places, 140/240 transitions.
[2026-05-25 09:05:03] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:05:03] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:05:03] [INFO ] Input system was already deterministic with 140 transitions.
[2026-05-25 09:05:03] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:05:03] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:05:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality3452922941454673043.gal : 1 ms
[2026-05-25 09:05:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality754670836955749202.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/CTLCardinality3452922941454673043.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality754670836955749202.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,456210,0.153685,8940,2,374,5,20350,6,0,336,19894,0


Converting to forward existential form...Done !
original formula: EG((p7==0))
=> equivalent forward existential formula: [FwdG(Init,(p7==0))] != FALSE
Hit Full ! (commute/partial/dont) 129/0/11
(forward)formula 0,1,0.353893,11756,1,0,9,37808,19,4,2296,31241,8
FORMULA MedleyA-PT-09-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 240/240 transitions.
Graph (complete) has 441 edges and 137 vertex of which 132 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 131 transition count 215
Reduce places removed 21 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 25 rules applied. Total rules applied 47 place count 110 transition count 211
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 51 place count 108 transition count 209
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 51 place count 108 transition count 204
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 61 place count 103 transition count 204
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 84 place count 80 transition count 176
Iterating global reduction 3 with 23 rules applied. Total rules applied 107 place count 80 transition count 176
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 108 place count 80 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 109 place count 79 transition count 175
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 109 place count 79 transition count 174
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 111 place count 78 transition count 174
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 112 place count 77 transition count 172
Iterating global reduction 5 with 1 rules applied. Total rules applied 113 place count 77 transition count 172
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 145 place count 60 transition count 157
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 146 place count 59 transition count 155
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 59 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 153 place count 59 transition count 149
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 155 place count 59 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 157 place count 57 transition count 147
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 157 place count 57 transition count 145
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 161 place count 55 transition count 145
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 165 place count 53 transition count 143
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 167 place count 51 transition count 141
Applied a total of 167 rules in 43 ms. Remains 51 /137 variables (removed 86) and now considering 141/240 (removed 99) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11810735243903717442.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9826971800569430204.kers'
[2026-05-25 09:05:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11810735243903717442.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9826971800569430204.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 141 rows 51 cols 610 entries
Finished phase 1 with 41 SingleSign rule and 2 generalized
[2026-05-25 09:05:03] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9826971800569430204.kers
Total runtime 1 ms.
[2026-05-25 09:05:03] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-25 09:05:03] [INFO ] Invariant cache hit.
[2026-05-25 09:05:03] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:05:03] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2026-05-25 09:05:03] [INFO ] Redundant transitions in 2 ms returned []
Running 135 sub problems to find dead transitions.
[2026-05-25 09:05:03] [INFO ] Invariant cache hit.
[2026-05-25 09:05:03] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 2/51 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 141/192 variables, 51/59 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 75 constraints, problems are : Problem set: 0 solved, 135 unsolved in 3229 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 2/51 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 141/192 variables, 51/59 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 135/210 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 210 constraints, problems are : Problem set: 0 solved, 135 unsolved in 7136 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10447ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 10448ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/137 places, 141/240 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10769 ms. Remains : 51/137 places, 141/240 transitions.
[2026-05-25 09:05:14] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:05:14] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:05:14] [INFO ] Input system was already deterministic with 141 transitions.
[2026-05-25 09:05:14] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:05:14] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:05:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2350866910143769244.gal : 1 ms
[2026-05-25 09:05:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9476248648854633075.prop : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2350866910143769244.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9476248648854633075.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 36202 steps (4619 resets) in 285 ms. (126 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-09-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
Loading property file /tmp/ReachabilityCardinality9476248648854633075.prop.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 240/240 transitions.
Graph (complete) has 441 edges and 137 vertex of which 132 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 132 transition count 219
Reduce places removed 18 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 20 rules applied. Total rules applied 39 place count 114 transition count 217
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 113 transition count 216
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 41 place count 113 transition count 212
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 49 place count 109 transition count 212
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 72 place count 86 transition count 184
Iterating global reduction 3 with 23 rules applied. Total rules applied 95 place count 86 transition count 184
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 96 place count 86 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 97 place count 85 transition count 183
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 97 place count 85 transition count 181
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 101 place count 83 transition count 181
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 131 place count 67 transition count 167
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 132 place count 66 transition count 165
Iterating global reduction 5 with 1 rules applied. Total rules applied 133 place count 66 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 139 place count 66 transition count 159
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 141 place count 66 transition count 157
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 143 place count 64 transition count 157
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 143 place count 64 transition count 154
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 149 place count 61 transition count 154
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 151 place count 60 transition count 153
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 153 place count 60 transition count 153
Applied a total of 153 rules in 35 ms. Remains 60 /137 variables (removed 77) and now considering 153/240 (removed 87) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2678819148124210715.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14576049775541483817.kers'
[2026-05-25 09:05:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2678819148124210715.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14576049775541483817.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 153 rows 60 cols 627 entries
Finished phase 1 with 50 SingleSign rule and 2 generalized
[2026-05-25 09:05:14] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14576049775541483817.kers
Total runtime 1 ms.
[2026-05-25 09:05:14] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-25 09:05:14] [INFO ] Invariant cache hit.
[2026-05-25 09:05:14] [INFO ] State equation strengthened by 74 read => feed constraints.
[2026-05-25 09:05:14] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2026-05-25 09:05:14] [INFO ] Redundant transitions in 6 ms returned []
Running 152 sub problems to find dead transitions.
[2026-05-25 09:05:14] [INFO ] Invariant cache hit.
[2026-05-25 09:05:14] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (OVERLAPS) 153/213 variables, 60/70 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 74/144 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 0/213 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (OVERLAPS) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 146 constraints, problems are : Problem set: 0 solved, 152 unsolved in 9757 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (OVERLAPS) 153/213 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 74/146 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 152/298 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (OVERLAPS) 0/213 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 213/213 variables, and 299 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39861ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 39862ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/137 places, 153/240 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40080 ms. Remains : 60/137 places, 153/240 transitions.
[2026-05-25 09:05:54] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:05:54] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:05:54] [INFO ] Input system was already deterministic with 153 transitions.
[2026-05-25 09:05:54] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:05:54] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:05:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality14527112417278564436.gal : 3 ms
[2026-05-25 09:05:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality15731671013929060466.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/CTLCardinality14527112417278564436.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15731671013929060466.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,626330,0.260985,14480,2,910,5,36536,6,0,391,41756,0


Converting to forward existential form...Done !
original formula: E((p59!=0) U !((((p63!=1) + ((p1==1) * A(((p27==0)||(p40==1)) U (p29==1)))) * EF((p43==1)))))
=> equivalent forward existential formula: (([((FwdU(Init,(p59!=0)) * !((p63!=1))) * !((p1==1)))] != FALSE + ([(FwdU((FwdU(Init,(p59!=0)) * !((p63!=1))),!(...347
Hit Full ! (commute/partial/dont) 151/0/2
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t5, t8, t9, t11, t14, t18, t24, t25, t30, t33, t34, t35, t39, t102, t117, t118, t...302
(forward)formula 0,0,1.75927,51980,1,0,282,232132,357,95,3552,181723,371
FORMULA MedleyA-PT-09-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 240/240 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 135 transition count 240
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 112 transition count 215
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 112 transition count 215
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 111 transition count 213
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 111 transition count 213
Applied a total of 50 rules in 8 ms. Remains 111 /137 variables (removed 26) and now considering 213/240 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12372177804664396713.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5365462599698984881.kers'
[2026-05-25 09:05:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12372177804664396713.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5365462599698984881.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 213 rows 111 cols 993 entries
Finished phase 1 with 97 SingleSign rule and 4 generalized
[2026-05-25 09:05:56] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5365462599698984881.kers
Total runtime 2 ms.
[2026-05-25 09:05:56] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-25 09:05:56] [INFO ] Invariant cache hit.
[2026-05-25 09:05:56] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2026-05-25 09:05:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/111 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 213/324 variables, 111/136 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 5/141 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/324 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/324 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 12 (OVERLAPS) 0/324 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 144 constraints, problems are : Problem set: 0 solved, 212 unsolved in 23782 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/111 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 213/324 variables, 111/142 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 212/354 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 6/360 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 324/324 variables, and 363 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 53872ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 53872ms
Starting structural reductions in LTL mode, iteration 1 : 111/137 places, 213/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54116 ms. Remains : 111/137 places, 213/240 transitions.
[2026-05-25 09:06:50] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:06:50] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:06:50] [INFO ] Input system was already deterministic with 213 transitions.
[2026-05-25 09:06:50] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:06:50] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:06:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality4485380611455242993.gal : 2 ms
[2026-05-25 09:06:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality14132116219217371934.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/CTLCardinality4485380611455242993.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14132116219217371934.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,7.70347e+07,6.92622,164836,2,11931,5,454489,6,0,657,712044,0


Converting to forward existential form...Done !
original formula: EG((AG(((p37==0)||(p77==1))) + (((AF((p133==1)) * EX((p74==1))) * ((p64==1)&&(p74==0))) * ((p46==0) + ((!(A(((p76==0)||(p49==1)) U (p102=...189
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(((p37==0)||(p77==1))))) + (((!(EG(!((p133==1)))) * EX((p74==1))) * ((p64==1)&&(p74==0))...297
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t30, t31, t32, t34, t35, t39, t40, t41, t42,...489
Detected timeout of ITS tools.
[2026-05-25 09:07:20] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:07:20] [INFO ] Applying decomposition
[2026-05-25 09:07:20] [INFO ] Flatten gal took : 9 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/graph14937444442002216266.txt' '-o' '/tmp/graph14937444442002216266.bin' '-w' '/tmp/graph14937444442002216266.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14937444442002216266.bin' '-l' '-1' '-v' '-w' '/tmp/graph14937444442002216266.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:07:20] [INFO ] Decomposing Gal with order
[2026-05-25 09:07:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:07:20] [INFO ] Removed a total of 397 redundant transitions.
[2026-05-25 09:07:20] [INFO ] Flatten gal took : 30 ms
[2026-05-25 09:07:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 4 ms.
[2026-05-25 09:07:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality15194062150033614656.gal : 2 ms
[2026-05-25 09:07:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality1005595891943059625.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/CTLCardinality15194062150033614656.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1005595891943059625.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,7.70347e+07,0.380205,17960,891,154,25238,840,458,50214,107,4549,0


Converting to forward existential form...Done !
original formula: EG((AG(((i1.u10.p37==0)||(i3.u17.p77==1))) + (((AF((i7.i1.u30.p133==1)) * EX((i3.u17.p74==1))) * ((i3.u15.p64==1)&&(i3.u17.p74==0))) * ((...276
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(((i1.u10.p37==0)||(i3.u17.p77==1))))) + (((!(EG(!((i7.i1.u30.p133==1)))) * EX((i3.u17.p...398
Reverse transition relation is NOT exact ! Due to transitions t7, t24, t69, t85, i0.u2.t102, i0.u4.t99, i1.t92, i1.t91, i1.t90, i1.t87, i1.t86, i1.u6.t67, ...823
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 240/240 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 136 transition count 240
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 29 place count 108 transition count 208
Iterating global reduction 1 with 28 rules applied. Total rules applied 57 place count 108 transition count 208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 107 transition count 206
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 107 transition count 206
Applied a total of 59 rules in 3 ms. Remains 107 /137 variables (removed 30) and now considering 206/240 (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-6584824965932058890.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7811820319325352407.kers'
[2026-05-25 09:07:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6584824965932058890.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7811820319325352407.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 206 rows 107 cols 980 entries
Finished phase 1 with 92 SingleSign rule and 4 generalized
[2026-05-25 09:07:50] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7811820319325352407.kers
Total runtime 1 ms.
[2026-05-25 09:07:50] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-25 09:07:50] [INFO ] Invariant cache hit.
[2026-05-25 09:07:50] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2026-05-25 09:07:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 2/107 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/313 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (OVERLAPS) 0/313 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 11 (OVERLAPS) 0/313 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 132 constraints, problems are : Problem set: 0 solved, 205 unsolved in 24624 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 2/107 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/313 variables, 107/130 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 205/335 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 11/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 349 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 54703ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 54703ms
Starting structural reductions in LTL mode, iteration 1 : 107/137 places, 206/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54908 ms. Remains : 107/137 places, 206/240 transitions.
[2026-05-25 09:08:45] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:08:45] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:08:45] [INFO ] Input system was already deterministic with 206 transitions.
[2026-05-25 09:08:45] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:08:45] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:08:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality5079815846772945860.gal : 3 ms
[2026-05-25 09:08:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality6945108600109763952.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/CTLCardinality5079815846772945860.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6945108600109763952.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,5.38147e+07,2.21429,68160,2,4949,5,204349,6,0,632,281698,0


Converting to forward existential form...Done !
original formula: EF(!(A(!(AG(EF((p27==1)))) U !((!(((p63==1)&&(p50==1))) * AX((p123==0)))))))
=> equivalent forward existential formula: ([(((FwdU(FwdU(Init,TRUE),!(!((!(((p63==1)&&(p50==1))) * !(EX(!((p123==0)))))))) * !(!(!(E(TRUE U !(E(TRUE U (p2...317
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t30, t31, t32, t35, t37, t39, t40, t43, t44,...426
(forward)formula 0,1,25.8134,670312,1,0,473,3.90492e+06,443,177,5823,2.66401e+06,554
FORMULA MedleyA-PT-09-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 240/240 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 135 transition count 240
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 29 place count 108 transition count 209
Iterating global reduction 1 with 27 rules applied. Total rules applied 56 place count 108 transition count 209
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 107 transition count 207
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 107 transition count 207
Applied a total of 58 rules in 9 ms. Remains 107 /137 variables (removed 30) and now considering 207/240 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9198254849648525038.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4123214335721310780.kers'
[2026-05-25 09:09:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9198254849648525038.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4123214335721310780.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 207 rows 107 cols 981 entries
Finished phase 1 with 93 SingleSign rule and 4 generalized
[2026-05-25 09:09:11] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4123214335721310780.kers
Total runtime 4 ms.
[2026-05-25 09:09:11] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-25 09:09:11] [INFO ] Invariant cache hit.
[2026-05-25 09:09:12] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2026-05-25 09:09:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 207/314 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 130 constraints, problems are : Problem set: 0 solved, 206 unsolved in 24804 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 207/314 variables, 107/128 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 206/334 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 4/338 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 314/314 variables, and 341 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 54947ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 54948ms
Starting structural reductions in LTL mode, iteration 1 : 107/137 places, 207/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55323 ms. Remains : 107/137 places, 207/240 transitions.
[2026-05-25 09:10:07] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:10:07] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:10:07] [INFO ] Input system was already deterministic with 207 transitions.
[2026-05-25 09:10:07] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:10:07] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:10:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality15668616006620223233.gal : 3 ms
[2026-05-25 09:10:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality10445981130877600818.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/CTLCardinality15668616006620223233.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10445981130877600818.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.22165e+07,2.05309,64048,2,4293,5,185739,6,0,635,268648,0


Converting to forward existential form...Done !
original formula: !(E(((p128==0)||(p114==1)) U (EF(((p135==0)||(p7==1))) * EF(((((p114==0)||(p140==1))&&(p127==1)) + EX((p54==0)))))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,((p128==0)||(p114==1))) * E(TRUE U ((p135==0)||(p7==1)))),TRUE) * (((p114==0)||(p140==1))&&(p...283
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t16, t17, t18, t24, t25, t26, t27, t29, t30, t32, t33, t34, t37, t39, t41, t45, t46,...437
Hit Full ! (commute/partial/dont) 202/0/5
(forward)formula 0,0,6.28774,156808,1,0,370,664609,444,135,5944,645803,431
FORMULA MedleyA-PT-09-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 240/240 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 135 transition count 240
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 29 place count 108 transition count 209
Iterating global reduction 1 with 27 rules applied. Total rules applied 56 place count 108 transition count 209
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 107 transition count 207
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 107 transition count 207
Applied a total of 58 rules in 2 ms. Remains 107 /137 variables (removed 30) and now considering 207/240 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4737448451743145351.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6365352551245085394.kers'
[2026-05-25 09:10:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4737448451743145351.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6365352551245085394.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 207 rows 107 cols 981 entries
Finished phase 1 with 93 SingleSign rule and 4 generalized
[2026-05-25 09:10:13] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6365352551245085394.kers
Total runtime 3 ms.
[2026-05-25 09:10:13] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-25 09:10:13] [INFO ] Invariant cache hit.
[2026-05-25 09:10:13] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 107/137 places, 207/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 263 ms. Remains : 107/137 places, 207/240 transitions.
[2026-05-25 09:10:13] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:10:13] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:10:13] [INFO ] Input system was already deterministic with 207 transitions.
[2026-05-25 09:10:13] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:10:13] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:10:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality2912652698793146077.gal : 1 ms
[2026-05-25 09:10:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality11613471865471823292.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/CTLCardinality2912652698793146077.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11613471865471823292.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: A(((p64==0)||(p119==1)) U (AX((AX(((p50==0)||(p146==1))) * !((((p105==0)||(p26==1))||((p124==0)||(!((p128==0)||(p1==1)))))))) * !(AX(EX((...167
=> equivalent forward existential formula: [((Init * !(EG(!((!(EX(!((!(EX(!(((p50==0)||(p146==1))))) * !((((p105==0)||(p26==1))||((p124==0)||(!((p128==0)||...542
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t16, t17, t23, t24, t25, t26, t28, t29, t31, t32, t33, t36, t38, t40, t41, t44, t45,...432
Detected timeout of ITS tools.
[2026-05-25 09:10:43] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:10:43] [INFO ] Applying decomposition
[2026-05-25 09:10:43] [INFO ] Flatten gal took : 9 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/graph6786942588373984631.txt' '-o' '/tmp/graph6786942588373984631.bin' '-w' '/tmp/graph6786942588373984631.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6786942588373984631.bin' '-l' '-1' '-v' '-w' '/tmp/graph6786942588373984631.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:10:43] [INFO ] Decomposing Gal with order
[2026-05-25 09:10:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:10:43] [INFO ] Removed a total of 374 redundant transitions.
[2026-05-25 09:10:44] [INFO ] Flatten gal took : 23 ms
[2026-05-25 09:10:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 7 ms.
[2026-05-25 09:10:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality3934206980665771816.gal : 3 ms
[2026-05-25 09:10:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality2066026183888668135.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/CTLCardinality3934206980665771816.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2066026183888668135.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,5.35071e+07,0.327255,16664,658,198,20495,2291,424,52504,105,14603,0


Converting to forward existential form...Done !
original formula: A(((i3.u14.p64==0)||(i5.u26.p119==1)) U (AX((AX(((i2.i1.u12.p50==0)||(i7.u15.p146==1))) * !((((i5.u23.p105==0)||(i6.i0.u4.p26==1))||((i7....247
=> equivalent forward existential formula: [((Init * !(EG(!((!(EX(!((!(EX(!(((i2.i1.u12.p50==0)||(i7.u15.p146==1))))) * !((((i5.u23.p105==0)||(i6.i0.u4.p26...754
Reverse transition relation is NOT exact ! Due to transitions t25, t33, t38, t58, t64, i0.u1.t96, i0.u3.t93, i1.t84, i1.t80, i1.u5.t62, i1.u5.t91, i1.u5.t9...715
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 240/240 transitions.
Graph (complete) has 441 edges and 137 vertex of which 133 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 132 transition count 223
Reduce places removed 14 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 16 rules applied. Total rules applied 31 place count 118 transition count 221
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 36 place count 117 transition count 217
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 40 place count 114 transition count 216
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 40 place count 114 transition count 213
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 46 place count 111 transition count 213
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 67 place count 90 transition count 188
Iterating global reduction 4 with 21 rules applied. Total rules applied 88 place count 90 transition count 188
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 89 place count 90 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 90 place count 89 transition count 187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 90 place count 89 transition count 186
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 92 place count 88 transition count 186
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 93 place count 87 transition count 184
Iterating global reduction 6 with 1 rules applied. Total rules applied 94 place count 87 transition count 184
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 118 place count 74 transition count 173
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 124 place count 74 transition count 167
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 6 with 2 rules applied. Total rules applied 126 place count 74 transition count 165
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 128 place count 72 transition count 165
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 128 place count 72 transition count 163
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 132 place count 70 transition count 163
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 8 with 4 rules applied. Total rules applied 136 place count 68 transition count 161
Applied a total of 136 rules in 46 ms. Remains 68 /137 variables (removed 69) and now considering 161/240 (removed 79) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17362045462593740330.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9672626242097028959.kers'
[2026-05-25 09:11:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17362045462593740330.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9672626242097028959.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 161 rows 68 cols 648 entries
Finished phase 1 with 58 SingleSign rule and 2 generalized
[2026-05-25 09:11:14] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9672626242097028959.kers
Total runtime 2 ms.
[2026-05-25 09:11:14] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-25 09:11:14] [INFO ] Invariant cache hit.
[2026-05-25 09:11:14] [INFO ] State equation strengthened by 74 read => feed constraints.
[2026-05-25 09:11:14] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2026-05-25 09:11:14] [INFO ] Redundant transitions in 4 ms returned []
Running 159 sub problems to find dead transitions.
[2026-05-25 09:11:14] [INFO ] Invariant cache hit.
[2026-05-25 09:11:14] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (OVERLAPS) 161/228 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 159 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 74/152 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 1/229 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 11 (OVERLAPS) 0/229 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 155 constraints, problems are : Problem set: 0 solved, 159 unsolved in 10193 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (OVERLAPS) 161/228 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 74/152 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 159/311 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (OVERLAPS) 1/229 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 229/229 variables, and 315 constraints, problems are : Problem set: 0 solved, 159 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40281ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 40282ms
Starting structural reductions in SI_CTL mode, iteration 1 : 68/137 places, 161/240 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40597 ms. Remains : 68/137 places, 161/240 transitions.
[2026-05-25 09:11:54] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:11:54] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:11:54] [INFO ] Input system was already deterministic with 161 transitions.
[2026-05-25 09:11:54] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:11:54] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:11:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality1686582176806058805.gal : 1 ms
[2026-05-25 09:11:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality9275685872873388074.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/CTLCardinality1686582176806058805.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9275685872873388074.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.44768e+06,0.3451,14528,2,2046,5,39674,6,0,428,42095,0


Converting to forward existential form...Done !
original formula: EG(((!(A(((!((p4==0)||(p112==1)))&&(((p128==0)||(p137==1))||((p116==0)||(p132==1)))) U E((p79==1) U ((p110==0)||(p89==1))))) + AG(((p61==...200
=> equivalent forward existential formula: [FwdG(Init,((!(!((E(!(E((p79==1) U ((p110==0)||(p89==1)))) U (!(((!((p4==0)||(p112==1)))&&(((p128==0)||(p137==1)...360
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t7, t8, t10, t11, t12, t13, t15, t16, t19, t20, t21, t23, t24, t26, t27, t29, t31, t3...416
Using saturation style SCC detection
(forward)formula 0,1,27.2168,630368,1,0,833,3.85896e+06,367,376,4127,3.11074e+06,945
FORMULA MedleyA-PT-09-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 240/240 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 135 transition count 240
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 30 place count 107 transition count 208
Iterating global reduction 1 with 28 rules applied. Total rules applied 58 place count 107 transition count 208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 106 transition count 206
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 106 transition count 206
Applied a total of 60 rules in 6 ms. Remains 106 /137 variables (removed 31) and now considering 206/240 (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-1587349651196693870.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12536922036611922159.kers'
[2026-05-25 09:12:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1587349651196693870.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12536922036611922159.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 206 rows 106 cols 979 entries
Finished phase 1 with 92 SingleSign rule and 4 generalized
[2026-05-25 09:12:22] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12536922036611922159.kers
Total runtime 3 ms.
[2026-05-25 09:12:22] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-25 09:12:22] [INFO ] Invariant cache hit.
[2026-05-25 09:12:22] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2026-05-25 09:12:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/312 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (OVERLAPS) 0/312 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/312 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 13 (OVERLAPS) 0/312 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/312 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 15 (OVERLAPS) 0/312 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 133 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/312 variables, 106/131 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 205/336 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (OVERLAPS) 0/312 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Int declared 312/312 variables, and 341 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 106/137 places, 206/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60478 ms. Remains : 106/137 places, 206/240 transitions.
[2026-05-25 09:13:22] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:13:22] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:13:22] [INFO ] Input system was already deterministic with 206 transitions.
[2026-05-25 09:13:22] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:13:22] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:13:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality2082205663674464421.gal : 2 ms
[2026-05-25 09:13:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality7007779686731471869.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/CTLCardinality2082205663674464421.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7007779686731471869.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,5.72749e+07,3.20544,73492,2,4966,5,194539,6,0,630,328504,0


Converting to forward existential form...Done !
original formula: EX(AG(((p6==0) * EG((p14==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(((p6==0) * EG((p14==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t30, t31, t32, t35, t37, t39, t40, t43, t44,...447
Detected timeout of ITS tools.
[2026-05-25 09:13:52] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:13:52] [INFO ] Applying decomposition
[2026-05-25 09:13:52] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9317066060630735398.txt' '-o' '/tmp/graph9317066060630735398.bin' '-w' '/tmp/graph9317066060630735398.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9317066060630735398.bin' '-l' '-1' '-v' '-w' '/tmp/graph9317066060630735398.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:13:52] [INFO ] Decomposing Gal with order
[2026-05-25 09:13:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:13:52] [INFO ] Removed a total of 423 redundant transitions.
[2026-05-25 09:13:52] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:13:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 4 ms.
[2026-05-25 09:13:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality1567646013526254273.gal : 1 ms
[2026-05-25 09:13:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality8723831832980786395.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/CTLCardinality1567646013526254273.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8723831832980786395.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,5.72749e+07,0.167206,11004,645,82,11082,314,396,37821,80,1116,0


Converting to forward existential form...Done !
original formula: EX(AG(((i2.u2.p6==0) * EG((i2.u3.p14==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(((i2.u2.p6==0) * EG((i2.u3.p14==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t24, t62, i0.u1.t94, i0.u4.t90, i1.t83, i1.t82, i1.t81, i1.t78, i1.t77, i1.u6.t60, i1.u6....742
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 6
(forward)formula 0,0,10.8877,360476,1,0,534640,1445,2353,2.07944e+06,372,8332,384086
FORMULA MedleyA-PT-09-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 240/240 transitions.
Graph (complete) has 441 edges and 137 vertex of which 132 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 131 transition count 218
Reduce places removed 18 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 20 rules applied. Total rules applied 39 place count 113 transition count 216
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 42 place count 112 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 111 transition count 214
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 43 place count 111 transition count 209
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 53 place count 106 transition count 209
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 75 place count 84 transition count 182
Iterating global reduction 4 with 22 rules applied. Total rules applied 97 place count 84 transition count 182
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 98 place count 84 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 99 place count 83 transition count 181
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 99 place count 83 transition count 180
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 101 place count 82 transition count 180
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 102 place count 81 transition count 178
Iterating global reduction 6 with 1 rules applied. Total rules applied 103 place count 81 transition count 178
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 29 rules applied. Total rules applied 132 place count 66 transition count 164
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 133 place count 65 transition count 162
Iterating global reduction 6 with 1 rules applied. Total rules applied 134 place count 65 transition count 162
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 142 place count 65 transition count 154
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 3 rules applied. Total rules applied 145 place count 65 transition count 151
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 148 place count 62 transition count 151
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 148 place count 62 transition count 148
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 154 place count 59 transition count 148
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 158 place count 57 transition count 146
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 159 place count 57 transition count 146
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 161 place count 55 transition count 144
Applied a total of 161 rules in 19 ms. Remains 55 /137 variables (removed 82) and now considering 144/240 (removed 96) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4832895346967166269.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9279142168596960355.kers'
[2026-05-25 09:14:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4832895346967166269.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9279142168596960355.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 144 rows 55 cols 632 entries
Finished phase 1 with 43 SingleSign rule and 3 generalized
[2026-05-25 09:14:03] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9279142168596960355.kers
Total runtime 2 ms.
[2026-05-25 09:14:03] [INFO ] Implicit Places using invariants in 100 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 54/137 places, 144/240 transitions.
Applied a total of 0 rules in 8 ms. Remains 54 /54 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 130 ms. Remains : 54/137 places, 144/240 transitions.
[2026-05-25 09:14:03] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:14:03] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:14:03] [INFO ] Input system was already deterministic with 144 transitions.
[2026-05-25 09:14:03] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:14:03] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:14:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality1860096711066203125.gal : 1 ms
[2026-05-25 09:14:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality4198368914033651086.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/CTLCardinality1860096711066203125.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4198368914033651086.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,887592,0.249353,12256,2,853,5,30196,6,0,358,31358,0


Converting to forward existential form...Done !
original formula: EF((EF(((p131==1)||((p97==0)&&(p18==1)))) * (((p72==0)&&(p46==1)) + (EG(((p141==0)&&(p70==1))) * EG((p18==0))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * E(TRUE U ((p131==1)||((p97==0)&&(p18==1))))) * ((p72==0)&&(p46==1)))] != FALSE + [FwdG(((F...266
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t14, t17, t18, t20, t30, t107, t130, t132, t134, Intersection with reachable at ...223
(forward)formula 0,1,1.85718,51420,1,0,218,244304,310,71,3438,185942,317
FORMULA MedleyA-PT-09-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 09:14:05] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:14:05] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:14:05] [INFO ] Applying decomposition
[2026-05-25 09:14:05] [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/graph16664119108854057538.txt' '-o' '/tmp/graph16664119108854057538.bin' '-w' '/tmp/graph16664119108854057538.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16664119108854057538.bin' '-l' '-1' '-v' '-w' '/tmp/graph16664119108854057538.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:14:05] [INFO ] Decomposing Gal with order
[2026-05-25 09:14:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:14:05] [INFO ] Removed a total of 508 redundant transitions.
[2026-05-25 09:14:05] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:14:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 3 ms.
[2026-05-25 09:14:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality3490117053137934714.gal : 2 ms
[2026-05-25 09:14:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality6021958117220562281.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/CTLCardinality3490117053137934714.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6021958117220562281.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 3 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.0377e+08,0.515229,24212,781,59,33321,334,512,98063,76,1333,0


Converting to forward existential form...Done !
original formula: (EX(EG(((i6.u22.p86==0)&&(i3.u10.p39==0)))) + AG(((((i7.u29.p108==1)||((i7.u27.p101==0)&&(i7.u29.p114==1))) * !(A((i7.u29.p115==1) U ((i4...237
=> equivalent forward existential formula: (([(FwdU((Init * !(EX(EG(((i6.u22.p86==0)&&(i3.u10.p39==0)))))),TRUE) * !(((i7.u29.p108==1)||((i7.u27.p101==0)&&...692
Reverse transition relation is NOT exact ! Due to transitions t27, i0.i1.u37.t8, i0.i1.u37.t16, i1.u2.t125, i1.u2.t126, i1.u6.t116, i1.u6.t117, i2.t119, i2...1043
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,33.1344,846624,1,0,1.27281e+06,895,3483,3.74787e+06,401,4580,1060323
FORMULA MedleyA-PT-09-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG((AG(((i3.u10.p37==0)||(i5.u18.p77==1))) + (((AF((i8.i1.u35.p133==1)) * EX((i5.u18.p74==1))) * ((i5.u17.p64==1)&&(i5.u18.p74==0))) * ((...276
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(((i3.u10.p37==0)||(i5.u18.p77==1))))) + (((!(EG(!((i8.i1.u35.p133==1)))) * EX((i5.u18.p...398
(forward)formula 1,0,110.039,2200124,1,0,3.18825e+06,946,1132,9.08157e+06,161,4833,28429
FORMULA MedleyA-PT-09-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(((i5.u17.p64==0)||(i7.u30.p119==1)) U (AX((AX(((i4.u14.p50==0)||(i8.i1.u41.p146==1))) * !((((i7.u27.p105==0)||(i0.i0.u5.p26==1))||((i8....250
=> equivalent forward existential formula: [((Init * !(EG(!((!(EX(!((!(EX(!(((i4.u14.p50==0)||(i8.i1.u41.p146==1))))) * !((((i7.u27.p105==0)||(i0.i0.u5.p26...763
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
(forward)formula 2,0,147.244,2200124,1,0,3.18825e+06,946,1276,9.08157e+06,180,4833,1022529
FORMULA MedleyA-PT-09-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 1048111 ms.

BK_STOP 1779700593670

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-09"
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-09, 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-177969019900161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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