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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.5K Mar 7 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Mar 7 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 7 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 7 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 20K Mar 15 11:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Mar 7 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 7 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 7 18:20 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 90K 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-08-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779699443250

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-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-25 08:57:24] [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:57:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 08:57:25] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2026-05-25 08:57:25] [INFO ] Transformed 147 places.
[2026-05-25 08:57:25] [INFO ] Transformed 312 transitions.
[2026-05-25 08:57:25] [INFO ] Found NUPN structural information;
[2026-05-25 08:57:25] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 237 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
FORMULA MedleyA-PT-08-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 97 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 312/312 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 146 transition count 312
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 138 transition count 302
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 138 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 138 transition count 301
Applied a total of 18 rules in 41 ms. Remains 138 /147 variables (removed 9) and now considering 301/312 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3871836749880530536.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6370616073210936058.kers'
[2026-05-25 08:57:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3871836749880530536.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6370616073210936058.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 301 rows 138 cols 1355 entries
Finished phase 1 with 124 SingleSign rule and 4 generalized
[2026-05-25 08:57:25] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6370616073210936058.kers
Total runtime 2 ms.
[2026-05-25 08:57:25] [INFO ] Implicit Places using invariants in 336 ms returned []
[2026-05-25 08:57:25] [INFO ] Invariant cache hit.
[2026-05-25 08:57:26] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2026-05-25 08:57:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD263 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/137 variables, 6/10 constraints. Problems are: Problem set: 48 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 7/17 constraints. Problems are: Problem set: 48 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 5/22 constraints. Problems are: Problem set: 48 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 5/27 constraints. Problems are: Problem set: 48 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/27 constraints. Problems are: Problem set: 48 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 301/438 variables, 137/164 constraints. Problems are: Problem set: 48 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 1/165 constraints. Problems are: Problem set: 48 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 0/165 constraints. Problems are: Problem set: 48 solved, 252 unsolved
At refinement iteration 10 (OVERLAPS) 1/439 variables, 1/166 constraints. Problems are: Problem set: 48 solved, 252 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 1/167 constraints. Problems are: Problem set: 48 solved, 252 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/439 variables, and 168 constraints, problems are : Problem set: 48 solved, 252 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 48 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 4/4 constraints. Problems are: Problem set: 48 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 48 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 6/10 constraints. Problems are: Problem set: 48 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 18/28 constraints. Problems are: Problem set: 48 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/28 constraints. Problems are: Problem set: 48 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 301/438 variables, 137/165 constraints. Problems are: Problem set: 48 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 250/415 constraints. Problems are: Problem set: 48 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 9/424 constraints. Problems are: Problem set: 48 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 2/426 constraints. Problems are: Problem set: 48 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 1/427 constraints. Problems are: Problem set: 48 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/439 variables, and 427 constraints, problems are : Problem set: 48 solved, 252 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 137/138 constraints, PredecessorRefiner: 250/300 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60427ms problems are : Problem set: 48 solved, 252 unsolved
Search for dead transitions found 48 dead transitions in 60456ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in LTL mode, iteration 1 : 138/147 places, 253/312 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61190 ms. Remains : 138/147 places, 253/312 transitions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 253/253 transitions.
Applied a total of 0 rules in 3 ms. Remains 138 /138 variables (removed 0) and now considering 253/253 (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-6061214519052584689.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13470599593082696605.kers'
[2026-05-25 08:58:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6061214519052584689.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13470599593082696605.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 253 rows 138 cols 1003 entries
Finished phase 1 with 124 SingleSign rule and 4 generalized
[2026-05-25 08:58:26] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13470599593082696605.kers
Total runtime 1 ms.
[2026-05-25 08:58:26] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-25 08:58:26] [INFO ] Invariant cache hit.
[2026-05-25 08:58:26] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2026-05-25 08:58:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 253/390 variables, 137/160 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (OVERLAPS) 1/391 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 10/172 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 391/391 variables, and 172 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 253/390 variables, 137/171 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 250/421 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 5/426 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 4/430 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 390/391 variables, and 431 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 137/138 constraints, PredecessorRefiner: 250/252 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Finished structural reductions in LTL mode , in 1 iterations and 60311 ms. Remains : 138/138 places, 253/253 transitions.
Support contains 97 out of 138 places after structural reductions.
[2026-05-25 08:59:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-25 08:59:27] [INFO ] Flatten gal took : 67 ms
FORMULA MedleyA-PT-08-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 08:59:27] [INFO ] Flatten gal took : 22 ms
[2026-05-25 08:59:27] [INFO ] Input system was already deterministic with 253 transitions.
Support contains 87 out of 138 places (down from 97) after GAL structural reductions.
RANDOM walk for 40000 steps (1996 resets) in 1592 ms. (25 steps per ms) remains 27/57 properties
BEST_FIRST walk for 4002 steps (50 resets) in 65 ms. (60 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4003 steps (55 resets) in 58 ms. (67 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (49 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (57 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (53 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (45 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (49 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (49 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (52 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (52 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (56 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (53 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (50 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (53 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (51 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (51 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (48 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (48 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (52 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (51 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (47 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (54 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (48 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (54 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (57 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (54 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
[2026-05-25 08:59:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 71/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 12/128 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 243/371 variables, 128/142 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/371 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 13/384 variables, 6/151 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 16 (OVERLAPS) 5/389 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/389 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/389 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 19 (OVERLAPS) 2/391 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/391 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 21 (OVERLAPS) 0/391 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/391 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 23 (OVERLAPS) 0/391 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 160 constraints, problems are : Problem set: 0 solved, 26 unsolved in 4129 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 71/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 12/128 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Problem AtomicPropp55 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 12/22 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 3/25 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 243/371 variables, 128/153 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 22/175 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 4/179 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 2/181 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/371 variables, 3/184 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/371 variables, 1/185 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/371 variables, 1/186 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/371 variables, 2/188 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/371 variables, 1/189 constraints. Problems are: Problem set: 1 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/391 variables, and 189 constraints, problems are : Problem set: 1 solved, 25 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 128/138 constraints, PredecessorRefiner: 22/26 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 9160ms problems are : Problem set: 1 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 42 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 253/253 transitions.
Graph (complete) has 467 edges and 138 vertex of which 134 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
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 134 transition count 236
Reduce places removed 9 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 12 rules applied. Total rules applied 28 place count 125 transition count 233
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 32 place count 122 transition count 232
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 32 place count 122 transition count 230
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 36 place count 120 transition count 230
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 48 place count 108 transition count 215
Iterating global reduction 3 with 12 rules applied. Total rules applied 60 place count 108 transition count 215
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 60 place count 108 transition count 214
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 107 transition count 214
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 105 transition count 205
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 105 transition count 205
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 104 transition count 203
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 104 transition count 203
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 88 place count 94 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 89 place count 94 transition count 192
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 90 place count 93 transition count 191
Iterating global reduction 4 with 1 rules applied. Total rules applied 91 place count 93 transition count 191
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 99 place count 89 transition count 214
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 4 with 33 rules applied. Total rules applied 132 place count 89 transition count 181
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 135 place count 89 transition count 179
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 138 place count 86 transition count 179
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 139 place count 86 transition count 179
Applied a total of 139 rules in 107 ms. Remains 86 /138 variables (removed 52) and now considering 179/253 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 86/138 places, 179/253 transitions.
RANDOM walk for 40000 steps (3988 resets) in 614 ms. (65 steps per ms) remains 3/25 properties
BEST_FIRST walk for 40003 steps (949 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (932 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (958 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13204637773568408307.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17664358349829196378.kers'
[2026-05-25 08:59:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13204637773568408307.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17664358349829196378.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 179 rows 86 cols 714 entries
Finished phase 1 with 74 SingleSign rule and 3 generalized
[2026-05-25 08:59:37] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17664358349829196378.kers
Total runtime 1 ms.
[2026-05-25 08:59:37] [INFO ] State equation strengthened by 54 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 42/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/51 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 25/76 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 171/247 variables, 76/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 54/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 15/262 variables, 8/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/264 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/265 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/265 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 149 constraints, problems are : Problem set: 0 solved, 3 unsolved in 695 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 86/86 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 42/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/51 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 25/76 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 171/247 variables, 76/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 54/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 15/262 variables, 8/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/262 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/264 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/264 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1/265 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/265 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/265 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 153 constraints, problems are : Problem set: 0 solved, 3 unsolved in 773 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 86/86 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1496ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 2 properties in 105 ms.
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 179/179 transitions.
Graph (complete) has 322 edges and 86 vertex of which 84 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 84 transition count 164
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 25 place count 75 transition count 163
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 25 place count 75 transition count 162
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 74 transition count 162
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 36 place count 65 transition count 147
Iterating global reduction 2 with 9 rules applied. Total rules applied 45 place count 65 transition count 147
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 63 transition count 145
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 63 transition count 145
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 19 rules applied. Total rules applied 68 place count 53 transition count 136
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 51 transition count 134
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 51 transition count 134
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 86 place count 44 transition count 192
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 44 transition count 190
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 44 transition count 188
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 92 place count 42 transition count 188
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 42 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 42 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 98 place count 40 transition count 185
Applied a total of 98 rules in 51 ms. Remains 40 /86 variables (removed 46) and now considering 185/179 (removed -6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 40/86 places, 185/179 transitions.
RANDOM walk for 40000 steps (140 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (81 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 12307 steps, run visited all 1 properties in 52 ms. (steps per millisecond=236 )
Probabilistic random walk after 12307 steps, saw 3860 distinct states, run finished after 61 ms. (steps per millisecond=201 ) properties seen :1
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2026-05-25 08:59:39] [INFO ] Flatten gal took : 10 ms
[2026-05-25 08:59:39] [INFO ] Flatten gal took : 13 ms
[2026-05-25 08:59:39] [INFO ] Input system was already deterministic with 253 transitions.
Computed a total of 11 stabilizing places and 13 stable transitions
Graph (complete) has 467 edges and 138 vertex of which 132 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 253/253 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 253
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 107 transition count 216
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 107 transition count 216
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 64 place count 107 transition count 213
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 72 place count 99 transition count 191
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 99 transition count 191
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 83 place count 96 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 96 transition count 184
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 88 place count 94 transition count 178
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 94 transition count 178
Applied a total of 90 rules in 9 ms. Remains 94 /138 variables (removed 44) and now considering 178/253 (removed 75) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4595301572092262194.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13294176034429801196.kers'
[2026-05-25 08:59:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4595301572092262194.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13294176034429801196.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 178 rows 94 cols 772 entries
Finished phase 1 with 80 SingleSign rule and 4 generalized
[2026-05-25 08:59:39] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13294176034429801196.kers
Total runtime 1 ms.
[2026-05-25 08:59:39] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-25 08:59:39] [INFO ] Invariant cache hit.
[2026-05-25 08:59:39] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2026-05-25 08:59:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/272 variables, 94/107 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 0/272 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 11 (OVERLAPS) 0/272 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 110 constraints, problems are : Problem set: 0 solved, 177 unsolved in 12462 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/272 variables, 94/108 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 177/285 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 11 (OVERLAPS) 0/272 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 272/272 variables, and 292 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 42527ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 42529ms
Starting structural reductions in LTL mode, iteration 1 : 94/138 places, 178/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42683 ms. Remains : 94/138 places, 178/253 transitions.
[2026-05-25 09:00:22] [INFO ] Flatten gal took : 26 ms
[2026-05-25 09:00:22] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:00:22] [INFO ] Input system was already deterministic with 178 transitions.
[2026-05-25 09:00:22] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:00:22] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:00:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality3277605068503983875.gal : 4 ms
[2026-05-25 09:00:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality18112899134049114599.ctl : 11 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/CTLCardinality3277605068503983875.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18112899134049114599.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.68388e+06,1.2415,44340,2,7029,5,126114,6,0,554,180780,0


Converting to forward existential form...Done !
original formula: !(A(EX(!(AF((p32!=0)))) U !(AG(((EF(((p66==0)||(p55==1))) + EX((p72==1))) + ((p13==1)&&((p28==0)||(p146==1))))))))
=> equivalent forward existential formula: ([((FwdU(Init,!(!(!(E(TRUE U !(((E(TRUE U ((p66==0)||(p55==1))) + EX((p72==1))) + ((p13==1)&&((p28==0)||(p146==1...445
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t31, t32, t34, t3...450
Detected timeout of ITS tools.
[2026-05-25 09:00:52] [INFO ] Flatten gal took : 19 ms
[2026-05-25 09:00:52] [INFO ] Applying decomposition
[2026-05-25 09:00:52] [INFO ] Flatten gal took : 11 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/graph2476914746120618785.txt' '-o' '/tmp/graph2476914746120618785.bin' '-w' '/tmp/graph2476914746120618785.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2476914746120618785.bin' '-l' '-1' '-v' '-w' '/tmp/graph2476914746120618785.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:00:52] [INFO ] Decomposing Gal with order
[2026-05-25 09:00:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:00:52] [INFO ] Removed a total of 293 redundant transitions.
[2026-05-25 09:00:52] [INFO ] Flatten gal took : 199 ms
[2026-05-25 09:00:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 7 ms.
[2026-05-25 09:00:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality3488706686275943092.gal : 5 ms
[2026-05-25 09:00:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality7489026503038141197.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/CTLCardinality3488706686275943092.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7489026503038141197.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.68388e+06,0.256751,14460,430,132,17972,1019,389,40687,103,7500,0


Converting to forward existential form...Done !
original formula: !(A(EX(!(AF((i3.u6.p32!=0)))) U !(AG(((EF(((i4.u11.p66==0)||(i1.u9.p55==1))) + EX((i4.u11.p72==1))) + ((i2.u3.p13==1)&&((i3.u8.p28==0)||(...177
=> equivalent forward existential formula: ([((FwdU(Init,!(!(!(E(TRUE U !(((E(TRUE U ((i4.u11.p66==0)||(i1.u9.p55==1))) + EX((i4.u11.p72==1))) + ((i2.u3.p1...568
Reverse transition relation is NOT exact ! Due to transitions t26, t57, t88, t92, i1.u9.t56, i1.u9.t58, i1.u9.t59, i1.u9.t60, i1.u9.t61, i1.u9.t62, i1.u9.t...748
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
(forward)formula 0,1,5.47642,169484,1,0,253420,6628,2527,671083,584,70629,306671
FORMULA MedleyA-PT-08-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 138/138 places, 253/253 transitions.
Graph (complete) has 467 edges and 138 vertex of which 134 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 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 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 133 transition count 234
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 37 place count 117 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 116 transition count 230
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 38 place count 116 transition count 229
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 115 transition count 229
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 61 place count 94 transition count 203
Iterating global reduction 3 with 21 rules applied. Total rules applied 82 place count 94 transition count 203
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 82 place count 94 transition count 202
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 93 transition count 202
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 91 place count 86 transition count 184
Iterating global reduction 3 with 7 rules applied. Total rules applied 98 place count 86 transition count 184
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 101 place count 83 transition count 177
Iterating global reduction 3 with 3 rules applied. Total rules applied 104 place count 83 transition count 177
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 82 transition count 174
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 82 transition count 174
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 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 129 place count 70 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 131 place count 70 transition count 161
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 133 place count 68 transition count 159
Iterating global reduction 4 with 2 rules applied. Total rules applied 135 place count 68 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 140 place count 68 transition count 154
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 140 place count 68 transition count 152
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 144 place count 66 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 4 with 4 rules applied. Total rules applied 148 place count 64 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 63 transition count 149
Applied a total of 149 rules in 36 ms. Remains 63 /138 variables (removed 75) and now considering 149/253 (removed 104) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1658224439626549769.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18047566775783509428.kers'
[2026-05-25 09:00:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1658224439626549769.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18047566775783509428.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 149 rows 63 cols 574 entries
Finished phase 1 with 53 SingleSign rule and 2 generalized
[2026-05-25 09:00:58] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18047566775783509428.kers
Total runtime 1 ms.
[2026-05-25 09:00:58] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-25 09:00:58] [INFO ] Invariant cache hit.
[2026-05-25 09:00:58] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 09:00:58] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2026-05-25 09:00:58] [INFO ] Redundant transitions in 14 ms returned []
Running 141 sub problems to find dead transitions.
[2026-05-25 09:00:58] [INFO ] Invariant cache hit.
[2026-05-25 09:00:58] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (OVERLAPS) 1/61 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (OVERLAPS) 1/62 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 148/210 variables, 62/71 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 12/83 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 11 (OVERLAPS) 2/212 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 13 (OVERLAPS) 0/212 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 84 constraints, problems are : Problem set: 0 solved, 141 unsolved in 8908 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (OVERLAPS) 1/61 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (OVERLAPS) 1/62 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 148/210 variables, 62/71 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 12/83 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 138/221 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 12 (OVERLAPS) 2/212 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/212 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/212 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 15 (OVERLAPS) 0/212 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 225 constraints, problems are : Problem set: 0 solved, 141 unsolved in 11175 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20129ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 20130ms
Starting structural reductions in SI_CTL mode, iteration 1 : 63/138 places, 149/253 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20310 ms. Remains : 63/138 places, 149/253 transitions.
[2026-05-25 09:01:18] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:01:18] [INFO ] Flatten gal took : 19 ms
[2026-05-25 09:01:18] [INFO ] Input system was already deterministic with 149 transitions.
[2026-05-25 09:01:18] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:01:18] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:01:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality7847291900678251337.gal : 2 ms
[2026-05-25 09:01:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality5205965064353952818.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/CTLCardinality7847291900678251337.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5205965064353952818.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,998712,0.335996,17380,2,1586,5,41508,6,0,394,65330,0


Converting to forward existential form...Done !
original formula: A((AF(((AF((p140==0)) * (p35==1)) * ((p95==0)||(p26==1)))) + (A(EG((p6==1)) U !((((p82==1)||(p49==0))||(p41==1)))) * ((p131==0)||(p39==1)...185
=> equivalent forward existential formula: [((Init * !(EG(!(!(((p51==0)||(p11==1))))))) * !(E(!(!(((p51==0)||(p11==1)))) U (!((!(EG(!(((!(EG(!((p140==0))))...419
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t15, t16, t17, t20, t22, t24, t26...376
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-25 09:01:48] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:01:48] [INFO ] Applying decomposition
[2026-05-25 09:01:48] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9342627008179134563.txt' '-o' '/tmp/graph9342627008179134563.bin' '-w' '/tmp/graph9342627008179134563.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9342627008179134563.bin' '-l' '-1' '-v' '-w' '/tmp/graph9342627008179134563.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:01:48] [INFO ] Decomposing Gal with order
[2026-05-25 09:01:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:01:49] [INFO ] Removed a total of 229 redundant transitions.
[2026-05-25 09:01:49] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:01:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 5 ms.
[2026-05-25 09:01:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality1114942248116852717.gal : 2 ms
[2026-05-25 09:01:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality11848338669014541614.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/CTLCardinality1114942248116852717.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11848338669014541614.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,998712,0.168545,10552,333,299,8758,2114,261,26051,148,20044,0


Converting to forward existential form...Done !
original formula: A((AF(((AF((i5.u11.p140==0)) * (i1.u3.p35==1)) * ((i4.u6.p95==0)||(i0.u1.p26==1)))) + (A(EG((i1.u2.p6==1)) U !((((i3.u5.p82==1)||(u4.p49=...249
=> equivalent forward existential formula: [((Init * !(EG(!(!(((u4.p51==0)||(i0.u0.p11==1))))))) * !(E(!(!(((u4.p51==0)||(i0.u0.p11==1)))) U (!((!(EG(!(((!...525
Reverse transition relation is NOT exact ! Due to transitions u4.t27, u4.t28, u4.t29, u4.t30, u4.t31, u4.t32, u4.t34, u4.t35, u4.t36, u4.t38, u4.t39, u4.t4...590
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 5
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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,0,9.23445,333076,1,0,499590,24570,1632,1.08261e+06,809,198562,564143
FORMULA MedleyA-PT-08-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 253/253 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 107 transition count 215
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 107 transition count 215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 65 place count 107 transition count 212
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 74 place count 98 transition count 189
Iterating global reduction 1 with 9 rules applied. Total rules applied 83 place count 98 transition count 189
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 86 place count 95 transition count 182
Iterating global reduction 1 with 3 rules applied. Total rules applied 89 place count 95 transition count 182
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 91 place count 93 transition count 176
Iterating global reduction 1 with 2 rules applied. Total rules applied 93 place count 93 transition count 176
Applied a total of 93 rules in 17 ms. Remains 93 /138 variables (removed 45) and now considering 176/253 (removed 77) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3801431860299685427.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14481755476882290023.kers'
[2026-05-25 09:01:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3801431860299685427.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14481755476882290023.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 176 rows 93 cols 767 entries
Finished phase 1 with 79 SingleSign rule and 4 generalized
[2026-05-25 09:01:58] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14481755476882290023.kers
Total runtime 5 ms.
[2026-05-25 09:01:58] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-25 09:01:58] [INFO ] Invariant cache hit.
[2026-05-25 09:01:58] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2026-05-25 09:01:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/268 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 1/269 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (OVERLAPS) 0/269 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 109 constraints, problems are : Problem set: 0 solved, 175 unsolved in 15014 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/268 variables, 92/108 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 173/281 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 3/284 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 268/269 variables, and 289 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/93 constraints, PredecessorRefiner: 173/175 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 45072ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 45072ms
Starting structural reductions in LTL mode, iteration 1 : 93/138 places, 176/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45294 ms. Remains : 93/138 places, 176/253 transitions.
[2026-05-25 09:02:43] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:02:43] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:02:43] [INFO ] Input system was already deterministic with 176 transitions.
[2026-05-25 09:02:43] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:02:43] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:02:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality12913935471137965988.gal : 2 ms
[2026-05-25 09:02:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality11554765556481039870.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/CTLCardinality12913935471137965988.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11554765556481039870.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,5.69143e+06,1.0228,42336,2,6407,5,119395,6,0,546,176490,0


Converting to forward existential form...Done !
original formula: ((!(E((p132==0) U (EX(((p36==0)||(p13==1))) * EF((p93==1))))) * EX(((p22==0) + AF((p55==1))))) * (EG(EX(((E(((p37==0)||(p34==1)) U (p129=...259
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,(p132==0)) * EX(((p36==0)||(p13==1)))),TRUE) * (p93==1))] = FALSE * [(Init * !(EX(((p22==0) ...480
Reverse transition relation is NOT exact ! Due to transitions t1, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t31, t32, t34, t36, t...441
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 165/0/11
(forward)formula 0,0,22.7498,684408,1,0,828,4.0738e+06,397,383,5032,3.11434e+06,883
FORMULA MedleyA-PT-08-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 253/253 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 253
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 32 place count 106 transition count 215
Iterating global reduction 1 with 31 rules applied. Total rules applied 63 place count 106 transition count 215
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 106 transition count 213
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 72 place count 99 transition count 195
Iterating global reduction 2 with 7 rules applied. Total rules applied 79 place count 99 transition count 195
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 82 place count 96 transition count 188
Iterating global reduction 2 with 3 rules applied. Total rules applied 85 place count 96 transition count 188
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 94 transition count 182
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 94 transition count 182
Applied a total of 89 rules in 19 ms. Remains 94 /138 variables (removed 44) and now considering 182/253 (removed 71) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17213725684443922087.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16844865016215356987.kers'
[2026-05-25 09:03:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17213725684443922087.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16844865016215356987.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 182 rows 94 cols 796 entries
Finished phase 1 with 80 SingleSign rule and 4 generalized
[2026-05-25 09:03:06] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16844865016215356987.kers
Total runtime 1 ms.
[2026-05-25 09:03:06] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-25 09:03:06] [INFO ] Invariant cache hit.
[2026-05-25 09:03:06] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2026-05-25 09:03:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/276 variables, 94/108 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (OVERLAPS) 0/276 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 111 constraints, problems are : Problem set: 0 solved, 181 unsolved in 14190 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/276 variables, 94/109 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 181/290 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (OVERLAPS) 0/276 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 3/296 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 276/276 variables, and 296 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 44262ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 44262ms
Starting structural reductions in LTL mode, iteration 1 : 94/138 places, 182/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44503 ms. Remains : 94/138 places, 182/253 transitions.
[2026-05-25 09:03:51] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:03:51] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:03:51] [INFO ] Input system was already deterministic with 182 transitions.
[2026-05-25 09:03:51] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:03:51] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:03:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality13886535240263313181.gal : 2 ms
[2026-05-25 09:03:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality14454740603386990358.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/CTLCardinality13886535240263313181.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14454740603386990358.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.67817e+06,1.21026,42884,2,7476,5,121425,6,0,558,181105,0


Converting to forward existential form...Done !
original formula: A(!((AX(AG(!(((p28==0)||(p103==1))))) * (!(EG(EF(((p78==0)||(p12==1))))) + (p69==1)))) U (p114==1))
=> equivalent forward existential formula: [((Init * !(EG(!((p114==1))))) * !(E(!((p114==1)) U (!(!((!(EX(!(!(E(TRUE U !(!(((p28==0)||(p103==1))))))))) * (...236
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t29, t31, t33, t3...488
Detected timeout of ITS tools.
[2026-05-25 09:04:21] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:04:21] [INFO ] Applying decomposition
[2026-05-25 09:04:21] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15486497391713834592.txt' '-o' '/tmp/graph15486497391713834592.bin' '-w' '/tmp/graph15486497391713834592.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15486497391713834592.bin' '-l' '-1' '-v' '-w' '/tmp/graph15486497391713834592.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:04:21] [INFO ] Decomposing Gal with order
[2026-05-25 09:04:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:04:21] [INFO ] Removed a total of 320 redundant transitions.
[2026-05-25 09:04:21] [INFO ] Flatten gal took : 26 ms
[2026-05-25 09:04:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 3 ms.
[2026-05-25 09:04:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality5869913076606836058.gal : 2 ms
[2026-05-25 09:04:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality5027842792254196028.ctl : 19 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/CTLCardinality5869913076606836058.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5027842792254196028.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,6.67817e+06,0.328057,17544,462,164,22980,1897,362,53429,110,16926,0


Converting to forward existential form...Done !
original formula: A(!((AX(AG(!(((i2.u8.p28==0)||(i4.u19.p103==1))))) * (!(EG(EF(((i4.u13.p78==0)||(i3.u3.p12==1))))) + (i5.u12.p69==1)))) U (i4.u19.p114==1...157
=> equivalent forward existential formula: [((Init * !(EG(!((i4.u19.p114==1))))) * !(E(!((i4.u19.p114==1)) U (!(!((!(EX(!(!(E(TRUE U !(!(((i2.u8.p28==0)||(...290
Reverse transition relation is NOT exact ! Due to transitions t26, t61, t87, t90, t92, t166, t167, t168, t169, i1.u4.t82, i2.t76, i2.t72, i2.t71, i2.u5.t78...737
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
(forward)formula 0,0,10.5387,310728,1,0,433190,16481,2106,1.24353e+06,556,167311,476392
FORMULA MedleyA-PT-08-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 253/253 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 253
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 32 place count 106 transition count 215
Iterating global reduction 1 with 31 rules applied. Total rules applied 63 place count 106 transition count 215
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 106 transition count 213
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 74 place count 97 transition count 194
Iterating global reduction 2 with 9 rules applied. Total rules applied 83 place count 97 transition count 194
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 95 transition count 189
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 95 transition count 189
Applied a total of 87 rules in 5 ms. Remains 95 /138 variables (removed 43) and now considering 189/253 (removed 64) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3117670999200821045.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12904816088237528494.kers'
[2026-05-25 09:04:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3117670999200821045.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12904816088237528494.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 189 rows 95 cols 810 entries
Finished phase 1 with 81 SingleSign rule and 4 generalized
[2026-05-25 09:04:31] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12904816088237528494.kers
Total runtime 1 ms.
[2026-05-25 09:04:32] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-25 09:04:32] [INFO ] Invariant cache hit.
[2026-05-25 09:04:32] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 188 sub problems to find dead transitions.
[2026-05-25 09:04:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (OVERLAPS) 189/284 variables, 95/108 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 9 (OVERLAPS) 0/284 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 110 constraints, problems are : Problem set: 0 solved, 188 unsolved in 15141 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (OVERLAPS) 189/284 variables, 95/108 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 188/296 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 10 (OVERLAPS) 0/284 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 284/284 variables, and 303 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 45235ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 45236ms
Starting structural reductions in LTL mode, iteration 1 : 95/138 places, 189/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45422 ms. Remains : 95/138 places, 189/253 transitions.
[2026-05-25 09:05:17] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:05:17] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:05:17] [INFO ] Input system was already deterministic with 189 transitions.
[2026-05-25 09:05:17] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:05:17] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:05:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality14941779969541105777.gal : 2 ms
[2026-05-25 09:05:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality5547603819568620462.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/CTLCardinality14941779969541105777.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5547603819568620462.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.00449e+06,1.22153,41848,2,6421,5,114784,6,0,569,184878,0


Converting to forward existential form...Done !
original formula: E(EX(((p108==0)||(p64==1))) U !((AX(AG(EF(((p18==0)||(p36==1))))) * !(((!(((p0==1)||(p115==1))||(p116==0)))&&(!((p92!=1)&&(!((p50==0)||(p...171
=> equivalent forward existential formula: ([(FwdU(EY(FwdU(Init,EX(((p108==0)||(p64==1))))),TRUE) * !(E(TRUE U ((p18==0)||(p36==1)))))] != FALSE + [(FwdU(I...279
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t29, t31, t32, t3...538
Detected timeout of ITS tools.
[2026-05-25 09:05:47] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:05:47] [INFO ] Applying decomposition
[2026-05-25 09:05:47] [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/graph5695970155873663664.txt' '-o' '/tmp/graph5695970155873663664.bin' '-w' '/tmp/graph5695970155873663664.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5695970155873663664.bin' '-l' '-1' '-v' '-w' '/tmp/graph5695970155873663664.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:05:47] [INFO ] Decomposing Gal with order
[2026-05-25 09:05:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:05:47] [INFO ] Removed a total of 316 redundant transitions.
[2026-05-25 09:05:47] [INFO ] Flatten gal took : 42 ms
[2026-05-25 09:05:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 3 ms.
[2026-05-25 09:05:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality8261826692843420442.gal : 15 ms
[2026-05-25 09:05:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality2820945875901968866.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/CTLCardinality8261826692843420442.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2820945875901968866.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,7.00449e+06,0.259407,14572,419,261,17173,1968,340,40505,129,18184,0


Converting to forward existential form...Done !
original formula: E(EX(((i6.u18.p108==0)||(i0.u10.p64==1))) U !((AX(AG(EF(((i1.u2.p18==0)||(i3.u7.p36==1))))) * !(((!(((i0.u0.p0==1)||(i6.u18.p115==1))||(i...237
=> equivalent forward existential formula: ([(FwdU(EY(FwdU(Init,EX(((i6.u18.p108==0)||(i0.u10.p64==1))))),TRUE) * !(E(TRUE U ((i1.u2.p18==0)||(i3.u7.p36==1...359
Reverse transition relation is NOT exact ! Due to transitions t26, t64, t93, t99, t165, t166, t167, t168, i1.u2.t89, i1.u2.t90, i1.u9.t63, i1.u9.t65, i1.u9...872
(forward)formula 0,1,5.82577,189016,1,0,319067,7789,2088,733277,647,81416,451281
FORMULA MedleyA-PT-08-CTLCardinality-2024-04 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 : 138/138 places, 253/253 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 253
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 33 place count 105 transition count 214
Iterating global reduction 1 with 32 rules applied. Total rules applied 65 place count 105 transition count 214
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 68 place count 105 transition count 211
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 78 place count 95 transition count 187
Iterating global reduction 2 with 10 rules applied. Total rules applied 88 place count 95 transition count 187
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 91 place count 92 transition count 179
Iterating global reduction 2 with 3 rules applied. Total rules applied 94 place count 92 transition count 179
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 91 transition count 176
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 91 transition count 176
Applied a total of 96 rules in 13 ms. Remains 91 /138 variables (removed 47) and now considering 176/253 (removed 77) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18117188052523926431.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16250588384582639502.kers'
[2026-05-25 09:05:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18117188052523926431.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16250588384582639502.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 176 rows 91 cols 768 entries
Finished phase 1 with 77 SingleSign rule and 4 generalized
[2026-05-25 09:05:53] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16250588384582639502.kers
Total runtime 2 ms.
[2026-05-25 09:05:53] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-25 09:05:53] [INFO ] Invariant cache hit.
[2026-05-25 09:05:53] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2026-05-25 09:05:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/267 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/267 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 106 constraints, problems are : Problem set: 0 solved, 175 unsolved in 13965 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/267 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 175/279 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/267 variables, 3/284 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 267/267 variables, and 286 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 44033ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 44033ms
Starting structural reductions in LTL mode, iteration 1 : 91/138 places, 176/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44231 ms. Remains : 91/138 places, 176/253 transitions.
[2026-05-25 09:06:37] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:06:37] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:06:37] [INFO ] Input system was already deterministic with 176 transitions.
[2026-05-25 09:06:37] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:06:37] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:06:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality8381439621391415443.gal : 1 ms
[2026-05-25 09:06:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality12912517976937403490.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/CTLCardinality8381439621391415443.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12912517976937403490.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.4012e+06,0.874823,35780,2,5277,5,93386,6,0,540,164801,0


Converting to forward existential form...Done !
original formula: EG(EF(EX(((p48==0)||(p17==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U EX(((p48==0)||(p17==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t31, t32, t34, t3...450
Detected timeout of ITS tools.
[2026-05-25 09:07:07] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:07:07] [INFO ] Applying decomposition
[2026-05-25 09:07:07] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9990572320584674382.txt' '-o' '/tmp/graph9990572320584674382.bin' '-w' '/tmp/graph9990572320584674382.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9990572320584674382.bin' '-l' '-1' '-v' '-w' '/tmp/graph9990572320584674382.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:07:07] [INFO ] Decomposing Gal with order
[2026-05-25 09:07:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:07:07] [INFO ] Removed a total of 307 redundant transitions.
[2026-05-25 09:07:07] [INFO ] Flatten gal took : 22 ms
[2026-05-25 09:07:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 10 ms.
[2026-05-25 09:07:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality4879909895423525324.gal : 1 ms
[2026-05-25 09:07:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality6362634924608763614.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/CTLCardinality4879909895423525324.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6362634924608763614.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.4012e+06,0.259484,15016,405,129,17669,1194,369,48966,100,11313,0


Converting to forward existential form...Done !
original formula: EG(EF(EX(((i1.u9.p48==0)||(i1.u2.p17==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U EX(((i1.u9.p48==0)||(i1.u2.p17==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t26, t55, t84, t88, i1.t92, i1.t91, i1.u2.t80, i1.u2.t81, i1.u9.t54, i1.u9.t56, i1.u9.t57, i1...741
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
(forward)formula 0,1,5.98456,199492,1,0,343419,4884,2214,788324,492,57972,455130
FORMULA MedleyA-PT-08-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 138/138 places, 253/253 transitions.
Graph (complete) has 467 edges and 138 vertex of which 132 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 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 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 131 transition count 233
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 20 rules applied. Total rules applied 37 place count 115 transition count 229
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 39 place count 113 transition count 229
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 39 place count 113 transition count 226
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 45 place count 110 transition count 226
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 68 place count 87 transition count 196
Iterating global reduction 3 with 23 rules applied. Total rules applied 91 place count 87 transition count 196
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 91 place count 87 transition count 195
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 86 transition count 195
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 103 place count 76 transition count 171
Iterating global reduction 3 with 10 rules applied. Total rules applied 113 place count 76 transition count 171
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 116 place count 73 transition count 163
Iterating global reduction 3 with 3 rules applied. Total rules applied 119 place count 73 transition count 163
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 120 place count 73 transition count 162
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 122 place count 72 transition count 161
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 123 place count 71 transition count 158
Iterating global reduction 5 with 1 rules applied. Total rules applied 124 place count 71 transition count 158
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 142 place count 61 transition count 150
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 144 place count 59 transition count 148
Iterating global reduction 5 with 2 rules applied. Total rules applied 146 place count 59 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 150 place count 59 transition count 144
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 150 place count 59 transition count 142
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 154 place count 57 transition count 142
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 5 with 4 rules applied. Total rules applied 158 place count 55 transition count 140
Applied a total of 158 rules in 38 ms. Remains 55 /138 variables (removed 83) and now considering 140/253 (removed 113) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7905927720557039084.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15385885056467022073.kers'
[2026-05-25 09:07:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7905927720557039084.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15385885056467022073.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 140 rows 55 cols 540 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-25 09:07:13] [INFO ] Computed 6 invariants in 13 ms
Computed 6 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-15385885056467022073.kers
Total runtime 16 ms.
[2026-05-25 09:07:14] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-25 09:07:14] [INFO ] Invariant cache hit.
[2026-05-25 09:07:14] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-25 09:07:14] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2026-05-25 09:07:14] [INFO ] Redundant transitions in 13 ms returned []
Running 137 sub problems to find dead transitions.
[2026-05-25 09:07:14] [INFO ] Invariant cache hit.
[2026-05-25 09:07:14] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 139/193 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 50/116 constraints. Problems are: Problem set: 0 solved, 137 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 2/195 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 117 constraints, problems are : Problem set: 0 solved, 137 unsolved in 5178 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 139/193 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 50/116 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 134/250 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (OVERLAPS) 2/195 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 3/254 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 11 (OVERLAPS) 0/195 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/195 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 195/195 variables, and 255 constraints, problems are : Problem set: 0 solved, 137 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35223ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 35223ms
Starting structural reductions in SI_CTL mode, iteration 1 : 55/138 places, 140/253 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35483 ms. Remains : 55/138 places, 140/253 transitions.
[2026-05-25 09:07:49] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:07:49] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:07:49] [INFO ] Input system was already deterministic with 140 transitions.
[2026-05-25 09:07:49] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:07:49] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:07:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality268730825030663293.gal : 4 ms
[2026-05-25 09:07:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality13480188587320969535.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/CTLCardinality268730825030663293.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13480188587320969535.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,452516,0.180562,10848,2,1137,5,21096,6,0,349,35175,0


Converting to forward existential form...Done !
original formula: EG(AG((((p111==0)||(p23==0))||((p4==1)||(((p114==0)&&(p63==1))&&((p94==0)&&(p20==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((((p111==0)||(p23==0))||((p4==1)||(((p114==0)&&(p63==1))&&((p94==0)&&(p20==1)))))))))] !...162
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t9, t10, t11, t12, t13, t14, t15, t16, t18, t19, t20, t21, t2...420
(forward)formula 0,0,0.586247,21740,1,0,292,85403,308,94,3278,90280,325
FORMULA MedleyA-PT-08-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 253/253 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 253
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 33 place count 105 transition count 214
Iterating global reduction 1 with 32 rules applied. Total rules applied 65 place count 105 transition count 214
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 68 place count 105 transition count 211
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 78 place count 95 transition count 187
Iterating global reduction 2 with 10 rules applied. Total rules applied 88 place count 95 transition count 187
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 92 place count 91 transition count 177
Iterating global reduction 2 with 4 rules applied. Total rules applied 96 place count 91 transition count 177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 90 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 90 transition count 174
Applied a total of 98 rules in 4 ms. Remains 90 /138 variables (removed 48) and now considering 174/253 (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-10833095225120237672.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-138545726757934666.kers'
[2026-05-25 09:07:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10833095225120237672.kers, --Pflows, --basisKERS=/tmp/petrispot-output-138545726757934666.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 174 rows 90 cols 760 entries
Finished phase 1 with 76 SingleSign rule and 4 generalized
[2026-05-25 09:07:50] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-138545726757934666.kers
Total runtime 1 ms.
[2026-05-25 09:07:50] [INFO ] Implicit Places using invariants in 48 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 103 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2026-05-25 09:07:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 174/264 variables, 90/102 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/264 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (OVERLAPS) 0/264 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 104 constraints, problems are : Problem set: 0 solved, 173 unsolved in 11861 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 174/264 variables, 90/102 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 173/275 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (OVERLAPS) 0/264 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 264/264 variables, and 282 constraints, problems are : Problem set: 0 solved, 173 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 41924ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 41925ms
Starting structural reductions in LTL mode, iteration 1 : 90/138 places, 174/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42083 ms. Remains : 90/138 places, 174/253 transitions.
[2026-05-25 09:08:32] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:08:32] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:08:32] [INFO ] Input system was already deterministic with 174 transitions.
[2026-05-25 09:08:32] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:08:32] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:08:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality1685005228648701488.gal : 2 ms
[2026-05-25 09:08:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality3309950468872933171.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/CTLCardinality1685005228648701488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3309950468872933171.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.26439e+06,0.877459,32540,2,5485,5,90917,6,0,534,133376,0


Converting to forward existential form...Done !
original formula: AF((((p120==0) * AX(((p16==0)||(p135==1)))) * (EF((p76==1)) + EG((p28==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((((p120==0) * !(EX(!(((p16==0)||(p135==1)))))) * (E(TRUE U (p76==1)) + EG((p28==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t30, t31, t32, t3...430
(forward)formula 0,1,24.1156,607256,1,0,711,3.99808e+06,383,271,4748,3.03145e+06,814
FORMULA MedleyA-PT-08-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 253/253 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 253
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 29 place count 109 transition count 220
Iterating global reduction 1 with 28 rules applied. Total rules applied 57 place count 109 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 59 place count 109 transition count 218
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 66 place count 102 transition count 204
Iterating global reduction 2 with 7 rules applied. Total rules applied 73 place count 102 transition count 204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 101 transition count 202
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 101 transition count 202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 100 transition count 199
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 100 transition count 199
Applied a total of 77 rules in 11 ms. Remains 100 /138 variables (removed 38) and now considering 199/253 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14372759388163215336.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1891871441868049729.kers'
[2026-05-25 09:08:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14372759388163215336.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1891871441868049729.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 199 rows 100 cols 848 entries
Finished phase 1 with 86 SingleSign rule and 4 generalized
[2026-05-25 09:08:56] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1891871441868049729.kers
Total runtime 3 ms.
[2026-05-25 09:08:56] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-25 09:08:56] [INFO ] Invariant cache hit.
[2026-05-25 09:08:56] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2026-05-25 09:08:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 199/299 variables, 100/116 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/299 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 13 (OVERLAPS) 0/299 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 122 constraints, problems are : Problem set: 0 solved, 198 unsolved in 21383 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 199/299 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 198/318 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 299/299 variables, and 321 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 51456ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 51457ms
Starting structural reductions in LTL mode, iteration 1 : 100/138 places, 199/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51674 ms. Remains : 100/138 places, 199/253 transitions.
[2026-05-25 09:09:48] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:09:48] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:09:48] [INFO ] Input system was already deterministic with 199 transitions.
[2026-05-25 09:09:48] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:09:48] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:09:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality1471244349826491432.gal : 2 ms
[2026-05-25 09:09:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality470645556047922367.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/CTLCardinality1471244349826491432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality470645556047922367.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,8.45598e+06,1.48291,53752,2,7536,5,138119,6,0,599,242515,0


Converting to forward existential form...Done !
original formula: (AX(EF((p95==1))) * (!(A(((AF((p101==1)) * (p72==1)) * !(((p41==0)||(p47==1)))) U E(AG(((p55==0)||(p143==1))) U !(((p16==0)||(p60==1)))))...223
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U (p95==1))))] = FALSE * [(((Init * !(EG(((((p115==0)||(p63==1))&&(p142==1))&&((p86==0)&&...477
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t27, t28, t30, t31, t32, t33, t3...568
Detected timeout of ITS tools.
[2026-05-25 09:10:18] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:10:18] [INFO ] Applying decomposition
[2026-05-25 09:10:18] [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/graph9631132734327365385.txt' '-o' '/tmp/graph9631132734327365385.bin' '-w' '/tmp/graph9631132734327365385.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9631132734327365385.bin' '-l' '-1' '-v' '-w' '/tmp/graph9631132734327365385.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:10:18] [INFO ] Decomposing Gal with order
[2026-05-25 09:10:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:10:18] [INFO ] Removed a total of 379 redundant transitions.
[2026-05-25 09:10:18] [INFO ] Flatten gal took : 15 ms
[2026-05-25 09:10:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 4 ms.
[2026-05-25 09:10:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality17279641596364444911.gal : 1 ms
[2026-05-25 09:10:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality14893790468235144411.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/CTLCardinality17279641596364444911.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14893790468235144411.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.45598e+06,0.422857,21844,653,69,30264,521,463,79915,78,3443,0


Converting to forward existential form...Done !
original formula: (AX(EF((i5.u20.p95==1))) * (!(A(((AF((i6.u24.p101==1)) * (i4.u17.p72==1)) * !(((i3.u9.p41==0)||(i3.u11.p47==1)))) U E(AG(((i3.u13.p55==0)...325
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U (i5.u20.p95==1))))] = FALSE * [(((Init * !(EG(((((i6.u23.p115==0)||(i0.u15.p63==1))&&(i...639
Reverse transition relation is NOT exact ! Due to transitions t64, t99, t103, t189, t190, t191, t192, t193, t194, t195, t196, i1.u4.t94, i2.t87, i2.t84, i2...884
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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,18.3283,602528,1,0,914827,2517,2914,3.03363e+06,378,22033,917363
FORMULA MedleyA-PT-08-CTLCardinality-2024-09 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 : 138/138 places, 253/253 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 253
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 32 place count 106 transition count 216
Iterating global reduction 1 with 31 rules applied. Total rules applied 63 place count 106 transition count 216
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 66 place count 106 transition count 213
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 75 place count 97 transition count 194
Iterating global reduction 2 with 9 rules applied. Total rules applied 84 place count 97 transition count 194
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 87 place count 94 transition count 186
Iterating global reduction 2 with 3 rules applied. Total rules applied 90 place count 94 transition count 186
Applied a total of 90 rules in 5 ms. Remains 94 /138 variables (removed 44) and now considering 186/253 (removed 67) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5711136300743925046.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4838343677919137554.kers'
[2026-05-25 09:10:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5711136300743925046.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4838343677919137554.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 186 rows 94 cols 804 entries
Finished phase 1 with 80 SingleSign rule and 4 generalized
[2026-05-25 09:10:36] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4838343677919137554.kers
Total runtime 3 ms.
[2026-05-25 09:10:36] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-25 09:10:36] [INFO ] Invariant cache hit.
[2026-05-25 09:10:36] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2026-05-25 09:10:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 186/280 variables, 94/106 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 0/280 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 108 constraints, problems are : Problem set: 0 solved, 185 unsolved in 9864 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 186/280 variables, 94/106 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 185/291 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 3/294 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 280/280 variables, and 298 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 39959ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 39959ms
Starting structural reductions in LTL mode, iteration 1 : 94/138 places, 186/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40127 ms. Remains : 94/138 places, 186/253 transitions.
[2026-05-25 09:11:16] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:11:16] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:11:16] [INFO ] Input system was already deterministic with 186 transitions.
[2026-05-25 09:11:16] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:11:16] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:11:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality17609992812663095386.gal : 2 ms
[2026-05-25 09:11:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality16750082172099408130.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/CTLCardinality17609992812663095386.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16750082172099408130.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.41829e+06,1.10068,40792,2,6391,5,111445,6,0,562,167898,0


Converting to forward existential form...Done !
original formula: (AF(EX(TRUE)) + AX(EG(((EX((p108!=0)) * (p124!=0)) * (p59!=1)))))
=> equivalent forward existential formula: [(EY((Init * !(!(EG(!(EX(TRUE))))))) * !(EG(((EX((p108!=0)) * (p124!=0)) * (p59!=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t20, t21, t26, t27, t28, t29, t30, t31...506
Using saturation style SCC detection
(forward)formula 0,1,4.69385,134992,1,0,409,592812,401,138,5090,622513,427
FORMULA MedleyA-PT-08-CTLCardinality-2024-10 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 : 138/138 places, 253/253 transitions.
Graph (complete) has 467 edges and 138 vertex of which 132 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 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 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 131 transition count 232
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 39 place count 114 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 113 transition count 228
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 40 place count 113 transition count 226
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 44 place count 111 transition count 226
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 69 place count 86 transition count 194
Iterating global reduction 3 with 25 rules applied. Total rules applied 94 place count 86 transition count 194
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 94 place count 86 transition count 192
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 98 place count 84 transition count 192
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 108 place count 74 transition count 168
Iterating global reduction 3 with 10 rules applied. Total rules applied 118 place count 74 transition count 168
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 122 place count 70 transition count 157
Iterating global reduction 3 with 4 rules applied. Total rules applied 126 place count 70 transition count 157
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 127 place count 70 transition count 156
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 129 place count 69 transition count 155
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 131 place count 67 transition count 149
Iterating global reduction 5 with 2 rules applied. Total rules applied 133 place count 67 transition count 149
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 155 place count 55 transition count 139
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 157 place count 53 transition count 137
Iterating global reduction 5 with 2 rules applied. Total rules applied 159 place count 53 transition count 137
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 164 place count 53 transition count 132
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 164 place count 53 transition count 129
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 170 place count 50 transition count 129
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 5 with 4 rules applied. Total rules applied 174 place count 48 transition count 127
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 175 place count 47 transition count 126
Applied a total of 175 rules in 43 ms. Remains 47 /138 variables (removed 91) and now considering 126/253 (removed 127) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1458581534023495438.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15664638585387298530.kers'
[2026-05-25 09:11:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1458581534023495438.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15664638585387298530.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 126 rows 47 cols 487 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-25 09:11:21] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15664638585387298530.kers
Total runtime 1 ms.
[2026-05-25 09:11:21] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-25 09:11:21] [INFO ] Invariant cache hit.
[2026-05-25 09:11:21] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 09:11:21] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2026-05-25 09:11:21] [INFO ] Redundant transitions in 14 ms returned []
Running 118 sub problems to find dead transitions.
[2026-05-25 09:11:21] [INFO ] Invariant cache hit.
[2026-05-25 09:11:21] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 2/46 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 125/171 variables, 46/52 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 12/64 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 2/173 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 0/173 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 65 constraints, problems are : Problem set: 0 solved, 118 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 47/47 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 2/46 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 125/171 variables, 46/52 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 12/64 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 115/179 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 2/173 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (OVERLAPS) 0/173 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 183 constraints, problems are : Problem set: 0 solved, 118 unsolved in 6363 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 47/47 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11411ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 11411ms
Starting structural reductions in SI_CTL mode, iteration 1 : 47/138 places, 126/253 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11682 ms. Remains : 47/138 places, 126/253 transitions.
[2026-05-25 09:11:33] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:11:33] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:11:33] [INFO ] Input system was already deterministic with 126 transitions.
[2026-05-25 09:11:33] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:11:33] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:11:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality675981253383790366.gal : 1 ms
[2026-05-25 09:11:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality11721498385452774278.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/CTLCardinality675981253383790366.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11721498385452774278.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,255060,0.111333,7408,2,343,5,13311,6,0,302,16104,0


Converting to forward existential form...Done !
original formula: AG(EF(AG((p130==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !((p130==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t10, t11, t23, t24, t112, t114, t116, Intersection with reac...232
(forward)formula 0,1,0.766256,29716,1,0,201,136428,274,74,2887,105361,286
FORMULA MedleyA-PT-08-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 : 138/138 places, 253/253 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 113 transition count 222
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 113 transition count 222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 113 transition count 220
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 107 transition count 207
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 107 transition count 207
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 106 transition count 205
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 106 transition count 205
Applied a total of 66 rules in 7 ms. Remains 106 /138 variables (removed 32) and now considering 205/253 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6663840614362550903.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3107371726758471623.kers'
[2026-05-25 09:11:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6663840614362550903.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3107371726758471623.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 205 rows 106 cols 863 entries
Finished phase 1 with 92 SingleSign rule and 4 generalized
[2026-05-25 09:11:34] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3107371726758471623.kers
Total runtime 1 ms.
[2026-05-25 09:11:34] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-25 09:11:34] [INFO ] Invariant cache hit.
[2026-05-25 09:11:34] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2026-05-25 09:11:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/310 variables, 105/122 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 10 (OVERLAPS) 1/311 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 12 (OVERLAPS) 0/311 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 126 constraints, problems are : Problem set: 0 solved, 204 unsolved in 21559 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 205/310 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 202/326 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 11 (OVERLAPS) 1/311 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/311 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/311 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/311 variables, and 333 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 51642ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 51643ms
Starting structural reductions in LTL mode, iteration 1 : 106/138 places, 205/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51814 ms. Remains : 106/138 places, 205/253 transitions.
[2026-05-25 09:12:26] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:12:26] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:12:26] [INFO ] Input system was already deterministic with 205 transitions.
[2026-05-25 09:12:26] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:12:26] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:12:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality14056110743353309659.gal : 1 ms
[2026-05-25 09:12:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality12285954499870198961.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/CTLCardinality14056110743353309659.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12285954499870198961.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: A(((EF((AX((((p25==0)||(p110==1))&&((p25==0)||(p8==1)))) + A(AG(((p30==0)||(p106==1))) U ((p141==1)&&((p132==0)||(p49==1)))))) + !(A(!(EF...319
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(EX(((!(EX(!((p29==1)))) * ((p27==0)||(p139==1))) * ((p61==0)||(p60==1))))))))))) * !(E(!...867
Reverse transition relation is NOT exact ! Due to transitions t1, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t29, t30, t31, t32, t...601
Detected timeout of ITS tools.
[2026-05-25 09:12:56] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:12:56] [INFO ] Applying decomposition
[2026-05-25 09:12:56] [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/graph10642725653072930293.txt' '-o' '/tmp/graph10642725653072930293.bin' '-w' '/tmp/graph10642725653072930293.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10642725653072930293.bin' '-l' '-1' '-v' '-w' '/tmp/graph10642725653072930293.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:12:56] [INFO ] Decomposing Gal with order
[2026-05-25 09:12:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:12:56] [INFO ] Removed a total of 377 redundant transitions.
[2026-05-25 09:12:56] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:12:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 3 ms.
[2026-05-25 09:12:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality15367712646832280843.gal : 2 ms
[2026-05-25 09:12:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality5919906637716185129.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/CTLCardinality15367712646832280843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5919906637716185129.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.2079e+07,0.81592,34092,717,183,44889,3611,454,169525,102,20653,0


Converting to forward existential form...Done !
original formula: A(((EF((AX((((i1.u4.p25==0)||(i6.u23.p110==1))&&((i1.u4.p25==0)||(i3.u2.p8==1)))) + A(AG(((i2.u6.p30==0)||(i6.u20.p106==1))) U ((i7.u31.p...457
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(EX(((!(EX(!((i2.u5.p29==1)))) * ((i1.u4.p27==0)||(i7.u30.p139==1))) * ((i3.u11.p61==0)||...1177
Reverse transition relation is NOT exact ! Due to transitions t26, t64, t103, t109, t191, t192, t193, t194, t195, t196, t197, t198, i1.u3.t100, i1.u4.t97, ...936
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 138/138 places, 253/253 transitions.
Graph (complete) has 467 edges and 138 vertex of which 132 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 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 230
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 43 place count 112 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 111 transition count 226
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 44 place count 111 transition count 224
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 48 place count 109 transition count 224
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 72 place count 85 transition count 193
Iterating global reduction 3 with 24 rules applied. Total rules applied 96 place count 85 transition count 193
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 96 place count 85 transition count 192
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 84 transition count 192
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 108 place count 74 transition count 168
Iterating global reduction 3 with 10 rules applied. Total rules applied 118 place count 74 transition count 168
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 122 place count 70 transition count 157
Iterating global reduction 3 with 4 rules applied. Total rules applied 126 place count 70 transition count 157
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 127 place count 70 transition count 156
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 129 place count 69 transition count 155
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 130 place count 68 transition count 152
Iterating global reduction 5 with 1 rules applied. Total rules applied 131 place count 68 transition count 152
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 5 with 24 rules applied. Total rules applied 155 place count 55 transition count 141
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 157 place count 53 transition count 139
Iterating global reduction 5 with 2 rules applied. Total rules applied 159 place count 53 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 164 place count 53 transition count 134
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 164 place count 53 transition count 131
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 170 place count 50 transition count 131
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 5 with 4 rules applied. Total rules applied 174 place count 48 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 175 place count 47 transition count 128
Applied a total of 175 rules in 29 ms. Remains 47 /138 variables (removed 91) and now considering 128/253 (removed 125) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2069027154075860657.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1852426175779089248.kers'
[2026-05-25 09:13:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2069027154075860657.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1852426175779089248.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 128 rows 47 cols 493 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-25 09:13:26] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1852426175779089248.kers
Total runtime 0 ms.
[2026-05-25 09:13:26] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-25 09:13:26] [INFO ] Invariant cache hit.
[2026-05-25 09:13:26] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-25 09:13:26] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2026-05-25 09:13:26] [INFO ] Redundant transitions in 21 ms returned []
Running 120 sub problems to find dead transitions.
[2026-05-25 09:13:26] [INFO ] Invariant cache hit.
[2026-05-25 09:13:26] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 2/46 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 127/173 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 2/175 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/175 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 67 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5888 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 47/47 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 2/46 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 127/173 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 117/183 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 2/175 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/175 variables, 3/187 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/175 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (OVERLAPS) 0/175 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 187 constraints, problems are : Problem set: 0 solved, 120 unsolved in 7803 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 47/47 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13763ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 13763ms
Starting structural reductions in SI_CTL mode, iteration 1 : 47/138 places, 128/253 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14037 ms. Remains : 47/138 places, 128/253 transitions.
[2026-05-25 09:13:40] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:13:40] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:13:40] [INFO ] Input system was already deterministic with 128 transitions.
[2026-05-25 09:13:40] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:13:40] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:13:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality58748226953344187.gal : 1 ms
[2026-05-25 09:13:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality855740747937059025.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/CTLCardinality58748226953344187.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality855740747937059025.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 -...280
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,284650,0.120913,9008,2,734,5,18891,6,0,305,24993,0


Converting to forward existential form...Done !
original formula: EF(EG(AF(((p121==0)&&(p79==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!(((p121==0)&&(p79==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t17, t21, t23, t24, t25...314
(forward)formula 0,0,5.69451,186368,1,0,463,1.09671e+06,283,181,2911,1.02494e+06,553
FORMULA MedleyA-PT-08-CTLCardinality-2024-14 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 : 138/138 places, 253/253 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 253
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 33 place count 105 transition count 214
Iterating global reduction 1 with 32 rules applied. Total rules applied 65 place count 105 transition count 214
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 68 place count 105 transition count 211
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 78 place count 95 transition count 187
Iterating global reduction 2 with 10 rules applied. Total rules applied 88 place count 95 transition count 187
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 92 place count 91 transition count 177
Iterating global reduction 2 with 4 rules applied. Total rules applied 96 place count 91 transition count 177
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 89 transition count 171
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 89 transition count 171
Applied a total of 100 rules in 4 ms. Remains 89 /138 variables (removed 49) and now considering 171/253 (removed 82) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8555748708417985277.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9547801136476767977.kers'
[2026-05-25 09:13:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8555748708417985277.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9547801136476767977.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 171 rows 89 cols 754 entries
Finished phase 1 with 75 SingleSign rule and 4 generalized
[2026-05-25 09:13:46] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9547801136476767977.kers
Total runtime 3 ms.
[2026-05-25 09:13:46] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-25 09:13:46] [INFO ] Invariant cache hit.
[2026-05-25 09:13:46] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2026-05-25 09:13:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/260 variables, 89/101 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/260 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 103 constraints, problems are : Problem set: 0 solved, 170 unsolved in 10302 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/260 variables, 89/101 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 170/271 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/260 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (OVERLAPS) 0/260 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 274 constraints, problems are : Problem set: 0 solved, 170 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 40404ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 40405ms
Starting structural reductions in LTL mode, iteration 1 : 89/138 places, 171/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40646 ms. Remains : 89/138 places, 171/253 transitions.
[2026-05-25 09:14:26] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:14:26] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:14:26] [INFO ] Input system was already deterministic with 171 transitions.
[2026-05-25 09:14:26] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:14:26] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:14:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality3817930912628350170.gal : 2 ms
[2026-05-25 09:14:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality2918875844946028617.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/CTLCardinality3817930912628350170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2918875844946028617.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,4.59198e+06,0.963481,29652,2,4577,5,81401,6,0,527,118736,0


Converting to forward existential form...Done !
original formula: E(EX(TRUE) U (AG(!(((p34==0)||(p138==1)))) * ((EF((p142==1)) + (p25==0)) + (p97==1))))
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,EX(TRUE)) * !(E(TRUE U !(!(((p34==0)||(p138==1))))))),TRUE) * (p142==1))] != FALSE + [((FwdU...329
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t31, t32, t34, t3...410
(forward)formula 0,0,3.44365,83188,1,0,319,313424,366,116,4550,290543,355
FORMULA MedleyA-PT-08-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-25 09:14:30] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:14:30] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:14:30] [INFO ] Applying decomposition
[2026-05-25 09:14:30] [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/graph4860181093350131891.txt' '-o' '/tmp/graph4860181093350131891.bin' '-w' '/tmp/graph4860181093350131891.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4860181093350131891.bin' '-l' '-1' '-v' '-w' '/tmp/graph4860181093350131891.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:14:30] [INFO ] Decomposing Gal with order
[2026-05-25 09:14:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:14:30] [INFO ] Removed a total of 417 redundant transitions.
[2026-05-25 09:14:30] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:14:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 4 ms.
[2026-05-25 09:14:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality355737274495999414.gal : 1 ms
[2026-05-25 09:14:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality3899320470195522110.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/CTLCardinality355737274495999414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3899320470195522110.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.7937e+07,0.987259,28480,762,235,31063,2258,443,147117,118,11316,0


Converting to forward existential form...Done !
original formula: A(((EF((AX((((i1.u4.p25==0)||(i6.u22.p110==1))&&((i1.u4.p25==0)||(i2.u3.p8==1)))) + A(AG(((i2.u6.p30==0)||(i6.u21.p106==1))) U ((i7.u32.p...456
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(EX(((!(EX(!((i2.u5.p29==1)))) * ((i1.u4.p27==0)||(i7.u31.p139==1))) * ((i3.u12.p61==0)||...1176
Reverse transition relation is NOT exact ! Due to transitions t84, t140, t149, i1.u2.t131, i1.u2.t132, i1.u2.t133, i1.u2.t134, i1.u2.t135, i1.u4.t124, i1.u...1200
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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,0,68.7602,1261516,1,0,1.52985e+06,6942,2915,6.32796e+06,629,40940,1135679
FORMULA MedleyA-PT-08-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 1094341 ms.

BK_STOP 1779700539330

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

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

Sequence of Actions to be Executed by the VM

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

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

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