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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 5.7K Mar 7 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 7 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 7 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 11:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 11:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Mar 7 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 7 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 7 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Mar 7 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:28 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 107K 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-10-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779699641292

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-25 09:00:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 09:00:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:00:43] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2026-05-25 09:00:43] [INFO ] Transformed 149 places.
[2026-05-25 09:00:43] [INFO ] Transformed 340 transitions.
[2026-05-25 09:00:43] [INFO ] Found NUPN structural information;
[2026-05-25 09:00:43] [INFO ] Parsed PT model containing 149 places and 340 transitions and 1721 arcs in 239 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Initial state reduction rules removed 2 formulas.
FORMULA MedleyA-PT-10-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-10-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-10-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 59 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 340/340 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 146 transition count 340
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 16 place count 133 transition count 325
Iterating global reduction 1 with 13 rules applied. Total rules applied 29 place count 133 transition count 325
Applied a total of 29 rules in 27 ms. Remains 133 /149 variables (removed 16) and now considering 325/340 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11921063259385607129.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17990040473699804002.kers'
[2026-05-25 09:00:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11921063259385607129.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17990040473699804002.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 325 rows 133 cols 1689 entries
Finished phase 1 with 119 SingleSign rule and 4 generalized
[2026-05-25 09:00:43] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17990040473699804002.kers
Total runtime 2 ms.
[2026-05-25 09:00:44] [INFO ] Implicit Places using invariants in 965 ms returned []
[2026-05-25 09:00:44] [INFO ] Invariant cache hit.
[2026-05-25 09:00:44] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 1299 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2026-05-25 09:00:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Problem TDEAD144 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/133 variables, 6/10 constraints. Problems are: Problem set: 64 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 11/21 constraints. Problems are: Problem set: 64 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 1/22 constraints. Problems are: Problem set: 64 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 1/23 constraints. Problems are: Problem set: 64 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 1/24 constraints. Problems are: Problem set: 64 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 64 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 325/458 variables, 133/157 constraints. Problems are: Problem set: 64 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 1/158 constraints. Problems are: Problem set: 64 solved, 260 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 3/161 constraints. Problems are: Problem set: 64 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 9/170 constraints. Problems are: Problem set: 64 solved, 260 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 1/171 constraints. Problems are: Problem set: 64 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/458 variables, and 171 constraints, problems are : Problem set: 64 solved, 260 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 64 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 4/4 constraints. Problems are: Problem set: 64 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/4 constraints. Problems are: Problem set: 64 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 6/10 constraints. Problems are: Problem set: 64 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 28/38 constraints. Problems are: Problem set: 64 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/38 constraints. Problems are: Problem set: 64 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 325/458 variables, 133/171 constraints. Problems are: Problem set: 64 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 260/431 constraints. Problems are: Problem set: 64 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 4/435 constraints. Problems are: Problem set: 64 solved, 260 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 436 constraints, problems are : Problem set: 64 solved, 260 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 260/324 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60604ms problems are : Problem set: 64 solved, 260 unsolved
Search for dead transitions found 64 dead transitions in 60620ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in LTL mode, iteration 1 : 133/149 places, 261/340 transitions.
Applied a total of 0 rules in 4 ms. Remains 133 /133 variables (removed 0) and now considering 261/261 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61987 ms. Remains : 133/149 places, 261/340 transitions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 261/261 transitions.
Applied a total of 0 rules in 3 ms. Remains 133 /133 variables (removed 0) and now considering 261/261 (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-15105859252633801103.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-491919861859444236.kers'
[2026-05-25 09:01:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15105859252633801103.kers, --Pflows, --basisKERS=/tmp/petrispot-output-491919861859444236.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 261 rows 133 cols 1177 entries
Finished phase 1 with 119 SingleSign rule and 4 generalized
[2026-05-25 09:01:45] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-491919861859444236.kers
Total runtime 2 ms.
[2026-05-25 09:01:45] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-25 09:01:45] [INFO ] Invariant cache hit.
[2026-05-25 09:01:45] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2026-05-25 09:01:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/394 variables, 133/158 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/394 variables, and 165 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/394 variables, 133/163 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 260/423 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 2/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 2/427 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 2/429 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 429 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60226ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60228ms
Finished structural reductions in LTL mode , in 1 iterations and 60528 ms. Remains : 133/133 places, 261/261 transitions.
Support contains 59 out of 133 places after structural reductions.
[2026-05-25 09:02:46] [INFO ] Flatten gal took : 57 ms
[2026-05-25 09:02:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-10-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 09:02:46] [INFO ] Flatten gal took : 22 ms
[2026-05-25 09:02:46] [INFO ] Input system was already deterministic with 261 transitions.
Support contains 54 out of 133 places (down from 59) after GAL structural reductions.
RANDOM walk for 40000 steps (1766 resets) in 1909 ms. (20 steps per ms) remains 14/31 properties
BEST_FIRST walk for 40002 steps (428 resets) in 125 ms. (317 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (430 resets) in 202 ms. (197 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (430 resets) in 244 ms. (163 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40003 steps (446 resets) in 165 ms. (240 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (435 resets) in 165 ms. (240 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (435 resets) in 176 ms. (226 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (427 resets) in 251 ms. (158 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (390 resets) in 86 ms. (459 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (428 resets) in 71 ms. (555 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (467 resets) in 146 ms. (272 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (427 resets) in 131 ms. (303 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40003 steps (428 resets) in 63 ms. (625 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (432 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
[2026-05-25 09:02:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 85/109 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 5/114 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 250/364 variables, 114/122 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 22/386 variables, 14/136 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 7/393 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 1/394 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 0/394 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 143 constraints, problems are : Problem set: 0 solved, 12 unsolved in 532 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 85/109 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 18/24 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 5/114 variables, 2/27 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 1/28 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 250/364 variables, 114/142 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 9/151 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 2/153 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/364 variables, 1/154 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/364 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 22/386 variables, 14/168 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/386 variables, 2/170 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/386 variables, 2/172 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/386 variables, 0/172 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 7/393 variables, 4/176 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/393 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 177 constraints, problems are : Problem set: 1 solved, 11 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 11/12 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 5555ms problems are : Problem set: 1 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 261/261 transitions.
Graph (complete) has 491 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 132 transition count 244
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 35 place count 117 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 116 transition count 241
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 36 place count 116 transition count 239
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 114 transition count 239
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 55 place count 99 transition count 220
Iterating global reduction 3 with 15 rules applied. Total rules applied 70 place count 99 transition count 220
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 98 transition count 215
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 98 transition count 215
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 97 transition count 213
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 97 transition count 213
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 112 place count 78 transition count 194
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 116 place count 78 transition count 190
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 118 place count 76 transition count 188
Iterating global reduction 4 with 2 rules applied. Total rules applied 120 place count 76 transition count 188
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 138 place count 67 transition count 268
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 154 place count 67 transition count 252
Drop transitions (Redundant composition of simpler transitions.) removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 5 with 50 rules applied. Total rules applied 204 place count 67 transition count 202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 206 place count 66 transition count 213
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 208 place count 66 transition count 216
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 210 place count 64 transition count 216
Applied a total of 210 rules in 111 ms. Remains 64 /133 variables (removed 69) and now considering 216/261 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 64/133 places, 216/261 transitions.
RANDOM walk for 40000 steps (5551 resets) in 1191 ms. (33 steps per ms) remains 0/11 properties
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2026-05-25 09:02:53] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:02:53] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:02:53] [INFO ] Input system was already deterministic with 261 transitions.
Computed a total of 12 stabilizing places and 13 stable transitions
Graph (complete) has 491 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 133/133 places, 261/261 transitions.
Graph (complete) has 491 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 131 transition count 241
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 40 place count 113 transition count 238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 112 transition count 238
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 41 place count 112 transition count 236
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 45 place count 110 transition count 236
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 65 place count 90 transition count 210
Iterating global reduction 3 with 20 rules applied. Total rules applied 85 place count 90 transition count 210
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 85 place count 90 transition count 209
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 87 place count 89 transition count 209
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 96 place count 80 transition count 186
Iterating global reduction 3 with 9 rules applied. Total rules applied 105 place count 80 transition count 186
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 109 place count 76 transition count 174
Iterating global reduction 3 with 4 rules applied. Total rules applied 113 place count 76 transition count 174
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 115 place count 76 transition count 172
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 119 place count 74 transition count 170
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 120 place count 73 transition count 167
Iterating global reduction 5 with 1 rules applied. Total rules applied 121 place count 73 transition count 167
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 149 place count 58 transition count 154
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 151 place count 56 transition count 152
Iterating global reduction 5 with 2 rules applied. Total rules applied 153 place count 56 transition count 152
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 157 place count 56 transition count 148
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 157 place count 56 transition count 146
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 161 place count 54 transition count 146
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 165 place count 52 transition count 144
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 167 place count 50 transition count 142
Applied a total of 167 rules in 71 ms. Remains 50 /133 variables (removed 83) and now considering 142/261 (removed 119) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3729317389433800168.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8232024913054493584.kers'
[2026-05-25 09:02:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3729317389433800168.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8232024913054493584.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 142 rows 50 cols 631 entries
Finished phase 1 with 40 SingleSign rule and 2 generalized
[2026-05-25 09:02:53] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8232024913054493584.kers
Total runtime 0 ms.
[2026-05-25 09:02:53] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-25 09:02:53] [INFO ] Invariant cache hit.
[2026-05-25 09:02:53] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:02:53] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2026-05-25 09:02:53] [INFO ] Redundant transitions in 3 ms returned []
Running 134 sub problems to find dead transitions.
[2026-05-25 09:02:53] [INFO ] Invariant cache hit.
[2026-05-25 09:02:53] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 2/49 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 141/190 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 2/192 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 74 constraints, problems are : Problem set: 0 solved, 134 unsolved in 6796 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 2/49 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 141/190 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 133/206 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (OVERLAPS) 2/192 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 12 (OVERLAPS) 0/192 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 208 constraints, problems are : Problem set: 0 solved, 134 unsolved in 10906 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17803ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 17804ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/133 places, 142/261 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18116 ms. Remains : 50/133 places, 142/261 transitions.
[2026-05-25 09:03:11] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:03:11] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:03:11] [INFO ] Input system was already deterministic with 142 transitions.
[2026-05-25 09:03:11] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:03:11] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:03:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality6353348728615227074.gal : 5 ms
[2026-05-25 09:03:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality8929894828075415712.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6353348728615227074.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8929894828075415712.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,567192,0.209674,11548,2,1038,5,31815,6,0,339,33032,0


Converting to forward existential form...Done !
original formula: AF(AG(((!(A((p148==0) U (p79==1))) * (p130==1)) * (p120==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((!(!((E(!((p79==1)) U (!((p148==0)) * !((p79==1)))) + EG(!((p79==1)))))) * (p130==1))...182
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t5, t6, t8, t9, t10, t11, t12, t13, t18, t20, t21, t22, t23, t24, t25, t27, t...382
(forward)formula 0,0,7.35899,223664,1,0,583,1.23287e+06,320,240,3518,1.19973e+06,686
FORMULA MedleyA-PT-10-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 133/133 places, 261/261 transitions.
Graph (complete) has 491 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 242
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 37 place count 114 transition count 240
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 37 place count 114 transition count 237
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 43 place count 111 transition count 237
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 61 place count 93 transition count 214
Iterating global reduction 2 with 18 rules applied. Total rules applied 79 place count 93 transition count 214
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 79 place count 93 transition count 213
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 81 place count 92 transition count 213
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 88 place count 85 transition count 195
Iterating global reduction 2 with 7 rules applied. Total rules applied 95 place count 85 transition count 195
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 98 place count 82 transition count 187
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 82 transition count 187
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 2 with 1 rules applied. Total rules applied 102 place count 82 transition count 186
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 104 place count 81 transition count 185
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 106 place count 79 transition count 179
Iterating global reduction 4 with 2 rules applied. Total rules applied 108 place count 79 transition count 179
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 29 rules applied. Total rules applied 137 place count 64 transition count 165
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 139 place count 64 transition count 163
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 141 place count 62 transition count 161
Iterating global reduction 5 with 2 rules applied. Total rules applied 143 place count 62 transition count 161
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 147 place count 62 transition count 157
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 147 place count 62 transition count 155
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 151 place count 60 transition count 155
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 155 place count 58 transition count 153
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 157 place count 56 transition count 151
Applied a total of 157 rules in 57 ms. Remains 56 /133 variables (removed 77) and now considering 151/261 (removed 110) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5148900599389706490.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3454885458317718244.kers'
[2026-05-25 09:03:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5148900599389706490.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3454885458317718244.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 151 rows 56 cols 657 entries
Finished phase 1 with 44 SingleSign rule and 3 generalized
[2026-05-25 09:03:19] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3454885458317718244.kers
Total runtime 1 ms.
[2026-05-25 09:03:19] [INFO ] Implicit Places using invariants in 57 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 55/133 places, 151/261 transitions.
Applied a total of 0 rules in 4 ms. Remains 55 /55 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 120 ms. Remains : 55/133 places, 151/261 transitions.
[2026-05-25 09:03:19] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:03:19] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:03:19] [INFO ] Input system was already deterministic with 151 transitions.
[2026-05-25 09:03:19] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:03:19] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:03:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality163118708526887441.gal : 3 ms
[2026-05-25 09:03:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality1277068680902758678.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/CTLCardinality163118708526887441.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1277068680902758678.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,625148,0.236573,13064,2,1033,5,30459,6,0,367,41639,0


Converting to forward existential form...Done !
original formula: EF(((AG(((p36==0)||(p18==1))) * (p134==1)) * ((p16==0)&&((p4==0)||(p51==1)))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((p16==0)&&((p4==0)||(p51==1)))) * (p134==1)) * !(E(TRUE U !(((p36==0)||(p18==1))))))] != ...160
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t4, t5, t6, t7, t9, t10, t11, t14, t16, t17, t18, t19, t21, t22, t23, t24, t26, t27, ...319
(forward)formula 0,1,4.32663,111244,1,0,278,575284,326,92,3520,395683,357
FORMULA MedleyA-PT-10-CTLCardinality-2024-01 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 : 133/133 places, 261/261 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 105 transition count 228
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 105 transition count 228
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 105 transition count 225
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 65 place count 99 transition count 209
Iterating global reduction 1 with 6 rules applied. Total rules applied 71 place count 99 transition count 209
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 97 transition count 204
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 97 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 96 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 96 transition count 201
Applied a total of 77 rules in 14 ms. Remains 96 /133 variables (removed 37) and now considering 201/261 (removed 60) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11578321377477969279.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18350076945269290648.kers'
[2026-05-25 09:03:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11578321377477969279.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18350076945269290648.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 201 rows 96 cols 997 entries
Finished phase 1 with 82 SingleSign rule and 4 generalized
[2026-05-25 09:03:23] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18350076945269290648.kers
Total runtime 1 ms.
[2026-05-25 09:03:23] [INFO ] Implicit Places using invariants in 165 ms returned []
[2026-05-25 09:03:23] [INFO ] Invariant cache hit.
[2026-05-25 09:03:24] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2026-05-25 09:03:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 201/297 variables, 96/111 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (OVERLAPS) 0/297 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 11 (OVERLAPS) 0/297 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 116 constraints, problems are : Problem set: 0 solved, 200 unsolved in 18440 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 201/297 variables, 96/114 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 200/314 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 297/297 variables, and 316 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 48517ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 48517ms
Starting structural reductions in LTL mode, iteration 1 : 96/133 places, 201/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48886 ms. Remains : 96/133 places, 201/261 transitions.
[2026-05-25 09:04:12] [INFO ] Flatten gal took : 23 ms
[2026-05-25 09:04:12] [INFO ] Flatten gal took : 20 ms
[2026-05-25 09:04:12] [INFO ] Input system was already deterministic with 201 transitions.
[2026-05-25 09:04:12] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:04:12] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:04:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality15092675227661429598.gal : 3 ms
[2026-05-25 09:04:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality11770635854352182738.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/CTLCardinality15092675227661429598.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11770635854352182738.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.68449e+07,2.33368,61780,2,6734,5,166546,6,0,585,256562,0


Converting to forward existential form...Done !
original formula: EF((AX(((p54==0)||((p7==0)&&(p56==1)))) * AG(!(E(((p65==0)||(p137==1)) U (p34==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EX(!(((p54==0)||((p7==0)&&(p56==1))))))) * !(E(TRUE U !(!(E(((p65==0)||(p137==1)) U (p34=...174
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t22, t23, t25, t27, t28, t31, t32, t34, t35, t36, t37, ...456
Detected timeout of ITS tools.
[2026-05-25 09:04:42] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:04:42] [INFO ] Applying decomposition
[2026-05-25 09:04:42] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6413647038083317531.txt' '-o' '/tmp/graph6413647038083317531.bin' '-w' '/tmp/graph6413647038083317531.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6413647038083317531.bin' '-l' '-1' '-v' '-w' '/tmp/graph6413647038083317531.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:04:42] [INFO ] Decomposing Gal with order
[2026-05-25 09:04:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:04:42] [INFO ] Removed a total of 404 redundant transitions.
[2026-05-25 09:04:43] [INFO ] Flatten gal took : 111 ms
[2026-05-25 09:04:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 45 ms.
[2026-05-25 09:04:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality15998789140945172956.gal : 12 ms
[2026-05-25 09:04:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality16395795989883204704.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/CTLCardinality15998789140945172956.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16395795989883204704.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.68449e+07,0.156686,8740,602,146,8818,797,394,18122,113,2752,0


Converting to forward existential form...Done !
original formula: EF((AX(((i2.u9.p54==0)||((i2.u2.p7==0)&&(i2.u10.p56==1)))) * AG(!(E(((i3.u11.p65==0)||(i0.i1.u23.p137==1)) U (i1.u6.p34==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EX(!(((i2.u9.p54==0)||((i2.u2.p7==0)&&(i2.u10.p56==1))))))) * !(E(TRUE U !(!(E(((i3.u11.p...216
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t47, t84, t191, t192, t193, t194, i0.t135, i0.i0.t89, i0.i0.u4.t79, i0.i0.u21.t10, i...674
(forward)formula 0,1,1.44888,57552,1,0,87608,5436,2114,203579,535,31656,140128
FORMULA MedleyA-PT-10-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 133/133 places, 261/261 transitions.
Graph (complete) has 491 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 131 transition count 241
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 113 transition count 239
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 39 place count 113 transition count 237
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 111 transition count 237
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 65 place count 89 transition count 209
Iterating global reduction 2 with 22 rules applied. Total rules applied 87 place count 89 transition count 209
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 87 place count 89 transition count 207
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 91 place count 87 transition count 207
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 99 place count 79 transition count 188
Iterating global reduction 2 with 8 rules applied. Total rules applied 107 place count 79 transition count 188
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 110 place count 76 transition count 180
Iterating global reduction 2 with 3 rules applied. Total rules applied 113 place count 76 transition count 180
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 2 with 1 rules applied. Total rules applied 114 place count 76 transition count 179
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 116 place count 75 transition count 178
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 117 place count 74 transition count 175
Iterating global reduction 4 with 1 rules applied. Total rules applied 118 place count 74 transition count 175
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 146 place count 59 transition count 162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 148 place count 59 transition count 160
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 150 place count 57 transition count 158
Iterating global reduction 5 with 2 rules applied. Total rules applied 152 place count 57 transition count 158
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 156 place count 57 transition count 154
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 156 place count 57 transition count 152
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 160 place count 55 transition count 152
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 164 place count 53 transition count 150
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 166 place count 51 transition count 148
Applied a total of 166 rules in 27 ms. Remains 51 /133 variables (removed 82) and now considering 148/261 (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-1841456544386788399.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3230593941505177663.kers'
[2026-05-25 09:04:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1841456544386788399.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3230593941505177663.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 51 cols 619 entries
Finished phase 1 with 41 SingleSign rule and 2 generalized
[2026-05-25 09:04:44] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3230593941505177663.kers
Total runtime 1 ms.
[2026-05-25 09:04:44] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-25 09:04:44] [INFO ] Invariant cache hit.
[2026-05-25 09:04:44] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:04:44] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2026-05-25 09:04:44] [INFO ] Redundant transitions in 2 ms returned []
Running 140 sub problems to find dead transitions.
[2026-05-25 09:04:44] [INFO ] Invariant cache hit.
[2026-05-25 09:04:44] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 2/50 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 147/197 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 2/199 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (OVERLAPS) 0/199 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 75 constraints, problems are : Problem set: 0 solved, 140 unsolved in 6483 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 2/50 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 147/197 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 139/213 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 2/199 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 12 (OVERLAPS) 0/199 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 215 constraints, problems are : Problem set: 0 solved, 140 unsolved in 11025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17558ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 17558ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/133 places, 148/261 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17754 ms. Remains : 51/133 places, 148/261 transitions.
[2026-05-25 09:05:02] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:05:02] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:05:02] [INFO ] Input system was already deterministic with 148 transitions.
[2026-05-25 09:05:02] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:05:02] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:05:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality6077248596398363849.gal : 1 ms
[2026-05-25 09:05:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality9713900029911982426.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/CTLCardinality6077248596398363849.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9713900029911982426.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,419404,0.22637,13436,2,1363,5,32465,6,0,347,38012,0


Converting to forward existential form...Done !
original formula: AG(E(((p59==0)||(p103==1)) U !(AF((p49==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((p59==0)||(p103==1)) U !(!(EG(!((p49==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t5, t7, t8, t10, t11, t14, t16, t17, t18, t19, t21, t22, t23, t25, t26, t27, ...338
(forward)formula 0,1,10.7322,333340,1,0,436,1.98968e+06,323,159,3379,1.62684e+06,538
FORMULA MedleyA-PT-10-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 261/261 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 103 transition count 225
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 103 transition count 225
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 64 place count 103 transition count 221
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 73 place count 94 transition count 198
Iterating global reduction 1 with 9 rules applied. Total rules applied 82 place count 94 transition count 198
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 86 place count 90 transition count 188
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 90 transition count 188
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 89 transition count 185
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 89 transition count 185
Applied a total of 92 rules in 23 ms. Remains 89 /133 variables (removed 44) and now considering 185/261 (removed 76) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5340268894313373424.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15952234112169372916.kers'
[2026-05-25 09:05:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5340268894313373424.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15952234112169372916.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 185 rows 89 cols 941 entries
Finished phase 1 with 75 SingleSign rule and 4 generalized
[2026-05-25 09:05:13] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15952234112169372916.kers
Total runtime 2 ms.
[2026-05-25 09:05:13] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-25 09:05:13] [INFO ] Invariant cache hit.
[2026-05-25 09:05:13] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2026-05-25 09:05:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 185/274 variables, 89/103 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 0/274 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (OVERLAPS) 0/274 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 12 (OVERLAPS) 0/274 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 107 constraints, problems are : Problem set: 0 solved, 184 unsolved in 17224 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 185/274 variables, 89/105 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 184/289 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (OVERLAPS) 0/274 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 274/274 variables, and 294 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 47326ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 47327ms
Starting structural reductions in LTL mode, iteration 1 : 89/133 places, 185/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47627 ms. Remains : 89/133 places, 185/261 transitions.
[2026-05-25 09:06:00] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:06:00] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:06:00] [INFO ] Input system was already deterministic with 185 transitions.
[2026-05-25 09:06:00] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:06:00] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:06:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality16498014801923355185.gal : 3 ms
[2026-05-25 09:06:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality15402288522907161856.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/CTLCardinality16498014801923355185.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15402288522907161856.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.15177e+07,1.47084,44612,2,5610,5,123882,6,0,541,166096,0


Converting to forward existential form...Done !
original formula: AF((AF((((p74!=0)&&(p121!=1))&&(p140==1))) * EX(EF(((p25==0)||(p62==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!((((p74!=0)&&(p121!=1))&&(p140==1))))) * EX(E(TRUE U ((p25==0)||(p62==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t28, t30, t31, t34, ...402
Detected timeout of ITS tools.
[2026-05-25 09:06:31] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:06:31] [INFO ] Applying decomposition
[2026-05-25 09:06:31] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14919444262519587426.txt' '-o' '/tmp/graph14919444262519587426.bin' '-w' '/tmp/graph14919444262519587426.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14919444262519587426.bin' '-l' '-1' '-v' '-w' '/tmp/graph14919444262519587426.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:06:31] [INFO ] Decomposing Gal with order
[2026-05-25 09:06:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:06:31] [INFO ] Removed a total of 373 redundant transitions.
[2026-05-25 09:06:31] [INFO ] Flatten gal took : 20 ms
[2026-05-25 09:06:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 7 ms.
[2026-05-25 09:06:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality18347018789840803333.gal : 3 ms
[2026-05-25 09:06:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality391518252674187146.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/CTLCardinality18347018789840803333.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality391518252674187146.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15177e+07,0.149697,10652,458,194,12372,1773,397,23910,114,8845,0


Converting to forward existential form...Done !
original formula: AF((AF((((i5.u13.p74!=0)&&(i4.u20.p121!=1))&&(i7.i0.u24.p140==1))) * EX(EF(((i1.u5.p25==0)||(i3.u11.p62==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!((((i5.u13.p74!=0)&&(i4.u20.p121!=1))&&(i7.i0.u24.p140==1))))) * EX(E(TRUE U ((i1.u5.p25==0)...187
Reverse transition relation is NOT exact ! Due to transitions t17, t50, t75, t79, i1.u5.t71, i2.t64, i2.t61, i2.t60, i2.u6.t67, i2.u6.t68, i2.u9.t48, i2.u9...637
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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,11.3881,275808,1,0,407422,15065,2131,1.4853e+06,570,200286,500807
FORMULA MedleyA-PT-10-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 261/261 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 103 transition count 225
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 103 transition count 225
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 64 place count 103 transition count 221
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 72 place count 95 transition count 199
Iterating global reduction 1 with 8 rules applied. Total rules applied 80 place count 95 transition count 199
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 84 place count 91 transition count 189
Iterating global reduction 1 with 4 rules applied. Total rules applied 88 place count 91 transition count 189
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 90 place count 89 transition count 183
Iterating global reduction 1 with 2 rules applied. Total rules applied 92 place count 89 transition count 183
Applied a total of 92 rules in 5 ms. Remains 89 /133 variables (removed 44) and now considering 183/261 (removed 78) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2804084283713582077.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4044276837453830213.kers'
[2026-05-25 09:06:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2804084283713582077.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4044276837453830213.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 183 rows 89 cols 939 entries
Finished phase 1 with 75 SingleSign rule and 4 generalized
[2026-05-25 09:06:42] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4044276837453830213.kers
Total runtime 2 ms.
[2026-05-25 09:06:42] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 09:06:42] [INFO ] Invariant cache hit.
[2026-05-25 09:06:43] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2026-05-25 09:06:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 183/272 variables, 89/102 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (OVERLAPS) 0/272 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 105 constraints, problems are : Problem set: 0 solved, 182 unsolved in 13197 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 183/272 variables, 89/103 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 182/285 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 272/272 variables, and 291 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 43329ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 43330ms
Starting structural reductions in LTL mode, iteration 1 : 89/133 places, 183/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43723 ms. Remains : 89/133 places, 183/261 transitions.
[2026-05-25 09:07:26] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:07:26] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:07:26] [INFO ] Input system was already deterministic with 183 transitions.
[2026-05-25 09:07:26] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:07:26] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:07:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality13806409832483691937.gal : 1 ms
[2026-05-25 09:07:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality7204702590224157090.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/CTLCardinality13806409832483691937.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7204702590224157090.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (AG(AF((AX(FALSE) + (((p80==0)&&(p98==0))&&(p7==1))))) + AF(AX((p28==1))))
=> equivalent forward existential formula: [FwdG((Init * !(!(E(TRUE U !(!(EG(!((!(EX(!(FALSE))) + (((p80==0)&&(p98==0))&&(p7==1))))))))))),!(!(EX(!((p28==1...170
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t22, t23, t25, t27, t28, t31, t32, t34, t35, t36, t37, ...377
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-25 09:07:56] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:07:56] [INFO ] Applying decomposition
[2026-05-25 09:07:56] [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/graph15376431043302609797.txt' '-o' '/tmp/graph15376431043302609797.bin' '-w' '/tmp/graph15376431043302609797.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15376431043302609797.bin' '-l' '-1' '-v' '-w' '/tmp/graph15376431043302609797.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:07:56] [INFO ] Decomposing Gal with order
[2026-05-25 09:07:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:07:56] [INFO ] Removed a total of 383 redundant transitions.
[2026-05-25 09:07:56] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:07:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 5 ms.
[2026-05-25 09:07:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality7888624345728235406.gal : 2 ms
[2026-05-25 09:07:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality16355226990006103507.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/CTLCardinality7888624345728235406.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16355226990006103507.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.27639e+07,0.16288,10964,617,112,14304,1054,372,23752,93,3298,0


Converting to forward existential form...Done !
original formula: (AG(AF((AX(FALSE) + (((i6.u12.p80==0)&&(i5.u16.p98==0))&&(i1.u1.p7==1))))) + AF(AX((i2.u5.p28==1))))
=> equivalent forward existential formula: [FwdG((Init * !(!(E(TRUE U !(!(EG(!((!(EX(!(FALSE))) + (((i6.u12.p80==0)&&(i5.u16.p98==0))&&(i1.u1.p7==1))))))))...196
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t47, t72, t121, i0.i1.u25.t3, i1.t77, i1.u3.t68, i1.u22.t10, i1.u22.t120, i2.t62, i2...546
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
Fast SCC detection found an SCC at level 6
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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,16.9321,452620,1,0,769688,7374,2125,1.61214e+06,462,45380,895437
FORMULA MedleyA-PT-10-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 133/133 places, 261/261 transitions.
Graph (complete) has 491 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 240
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 42 place count 112 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 111 transition count 237
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 43 place count 111 transition count 235
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 47 place count 109 transition count 235
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 68 place count 88 transition count 208
Iterating global reduction 3 with 21 rules applied. Total rules applied 89 place count 88 transition count 208
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 89 place count 88 transition count 207
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 91 place count 87 transition count 207
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 99 place count 79 transition count 188
Iterating global reduction 3 with 8 rules applied. Total rules applied 107 place count 79 transition count 188
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 76 transition count 180
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 76 transition count 180
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 114 place count 76 transition count 179
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 116 place count 75 transition count 178
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 117 place count 74 transition count 175
Iterating global reduction 5 with 1 rules applied. Total rules applied 118 place count 74 transition count 175
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 148 place count 58 transition count 161
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 150 place count 58 transition count 159
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 152 place count 56 transition count 157
Iterating global reduction 6 with 2 rules applied. Total rules applied 154 place count 56 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 158 place count 56 transition count 153
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 158 place count 56 transition count 151
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 162 place count 54 transition count 151
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 166 place count 52 transition count 149
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 168 place count 50 transition count 147
Applied a total of 168 rules in 50 ms. Remains 50 /133 variables (removed 83) and now considering 147/261 (removed 114) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3715148113326090733.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3685770089167448000.kers'
[2026-05-25 09:08:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3715148113326090733.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3685770089167448000.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 50 cols 619 entries
Finished phase 1 with 40 SingleSign rule and 2 generalized
[2026-05-25 09:08:13] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3685770089167448000.kers
Total runtime 1 ms.
[2026-05-25 09:08:13] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-25 09:08:13] [INFO ] Invariant cache hit.
[2026-05-25 09:08:13] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:08:13] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2026-05-25 09:08:13] [INFO ] Redundant transitions in 3 ms returned []
Running 139 sub problems to find dead transitions.
[2026-05-25 09:08:13] [INFO ] Invariant cache hit.
[2026-05-25 09:08:13] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 2/49 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (OVERLAPS) 146/195 variables, 49/59 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 9 (OVERLAPS) 2/197 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 11 (OVERLAPS) 0/197 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 76 constraints, problems are : Problem set: 0 solved, 139 unsolved in 7116 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 2/49 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 146/195 variables, 49/59 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 138/213 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 11 (OVERLAPS) 2/197 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 14 (OVERLAPS) 0/197 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 215 constraints, problems are : Problem set: 0 solved, 139 unsolved in 10850 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18009ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 18010ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/133 places, 147/261 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18293 ms. Remains : 50/133 places, 147/261 transitions.
[2026-05-25 09:08:31] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:08:31] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:08:31] [INFO ] Input system was already deterministic with 147 transitions.
[2026-05-25 09:08:31] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:08:31] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:08:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality15947645952313240407.gal : 2 ms
[2026-05-25 09:08:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality9465793781467452030.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/CTLCardinality15947645952313240407.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9465793781467452030.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,382916,0.107246,7940,2,602,5,17766,6,0,343,16141,0


Converting to forward existential form...Done !
original formula: (EF((p103!=0)) + EG(((p17==0)&&(p121==1))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (p103!=0))] != FALSE + [FwdG(Init,((p17==0)&&(p121==1)))] != FALSE)
(forward)formula 0,1,0.108023,8204,1,0,7,17766,8,1,346,16141,1
FORMULA MedleyA-PT-10-CTLCardinality-2024-07 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 : 133/133 places, 261/261 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 103 transition count 225
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 103 transition count 225
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 64 place count 103 transition count 221
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 72 place count 95 transition count 199
Iterating global reduction 1 with 8 rules applied. Total rules applied 80 place count 95 transition count 199
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 94 transition count 197
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 94 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 93 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 93 transition count 194
Applied a total of 84 rules in 5 ms. Remains 93 /133 variables (removed 40) and now considering 194/261 (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-321121302870963506.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4944633952931702615.kers'
[2026-05-25 09:08:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-321121302870963506.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4944633952931702615.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 194 rows 93 cols 965 entries
Finished phase 1 with 79 SingleSign rule and 4 generalized
[2026-05-25 09:08:32] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4944633952931702615.kers
Total runtime 1 ms.
[2026-05-25 09:08:32] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-25 09:08:32] [INFO ] Invariant cache hit.
[2026-05-25 09:08:32] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2026-05-25 09:08:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/287 variables, 93/106 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 6/114 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 114 constraints, problems are : Problem set: 0 solved, 193 unsolved in 16411 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/287 variables, 93/113 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 193/306 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 287/287 variables, and 308 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 46507ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 46507ms
Starting structural reductions in LTL mode, iteration 1 : 93/133 places, 194/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46748 ms. Remains : 93/133 places, 194/261 transitions.
[2026-05-25 09:09:18] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:09:18] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:09:18] [INFO ] Input system was already deterministic with 194 transitions.
[2026-05-25 09:09:18] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:09:18] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:09:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality13765835165829706449.gal : 2 ms
[2026-05-25 09:09:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality6781145598915280036.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/CTLCardinality13765835165829706449.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6781145598915280036.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (AX(((p99==0)||(p36==1))) * (AG(((p125==0)||(p48==1))) + AF(EG((((((p137==0)&&(p69==1))||(p116==0))&&(p45==0))&&(p22==1))))))
=> equivalent forward existential formula: ([(EY(Init) * !(((p99==0)||(p36==1))))] = FALSE * [FwdG((Init * !(!(E(TRUE U !(((p125==0)||(p48==1))))))),!(EG((...225
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t20, t21, t22, t25, t26, t27, t28, t29, t30, t31, t34, ...457
(forward)formula 0,0,13.023,262196,1,0,504,1.25311e+06,419,178,5861,1.10784e+06,599
FORMULA MedleyA-PT-10-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 133/133 places, 261/261 transitions.
Graph (complete) has 491 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 240
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 112 transition count 238
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 41 place count 112 transition count 235
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 47 place count 109 transition count 235
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 67 place count 89 transition count 211
Iterating global reduction 2 with 20 rules applied. Total rules applied 87 place count 89 transition count 211
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 87 place count 89 transition count 209
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 91 place count 87 transition count 209
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 99 place count 79 transition count 190
Iterating global reduction 2 with 8 rules applied. Total rules applied 107 place count 79 transition count 190
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 110 place count 76 transition count 182
Iterating global reduction 2 with 3 rules applied. Total rules applied 113 place count 76 transition count 182
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 114 place count 76 transition count 181
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 116 place count 75 transition count 180
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 118 place count 73 transition count 174
Iterating global reduction 4 with 2 rules applied. Total rules applied 120 place count 73 transition count 174
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 146 place count 59 transition count 162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 148 place count 59 transition count 160
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 150 place count 57 transition count 158
Iterating global reduction 5 with 2 rules applied. Total rules applied 152 place count 57 transition count 158
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 156 place count 57 transition count 154
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 156 place count 57 transition count 152
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 160 place count 55 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 5 with 4 rules applied. Total rules applied 164 place count 53 transition count 150
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 166 place count 51 transition count 148
Applied a total of 166 rules in 57 ms. Remains 51 /133 variables (removed 82) and now considering 148/261 (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-14168977555509108912.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6825026010561139101.kers'
[2026-05-25 09:09:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14168977555509108912.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6825026010561139101.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 51 cols 620 entries
Finished phase 1 with 41 SingleSign rule and 2 generalized
[2026-05-25 09:09:32] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6825026010561139101.kers
Total runtime 2 ms.
[2026-05-25 09:09:32] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-25 09:09:32] [INFO ] Invariant cache hit.
[2026-05-25 09:09:32] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:09:32] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2026-05-25 09:09:32] [INFO ] Redundant transitions in 1 ms returned []
Running 142 sub problems to find dead transitions.
[2026-05-25 09:09:32] [INFO ] Invariant cache hit.
[2026-05-25 09:09:32] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 2/50 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 147/197 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 2/199 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (OVERLAPS) 0/199 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 75 constraints, problems are : Problem set: 0 solved, 142 unsolved in 7609 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 2/50 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 147/197 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 141/215 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (OVERLAPS) 2/199 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 12 (OVERLAPS) 0/199 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 217 constraints, problems are : Problem set: 0 solved, 142 unsolved in 14813 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22464ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 22465ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/133 places, 148/261 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22850 ms. Remains : 51/133 places, 148/261 transitions.
[2026-05-25 09:09:54] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:09:54] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:09:54] [INFO ] Input system was already deterministic with 148 transitions.
[2026-05-25 09:09:54] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:09:54] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:09:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality18296232866518118845.gal : 2 ms
[2026-05-25 09:09:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality6267374141157811617.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/CTLCardinality18296232866518118845.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6267374141157811617.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,343912,0.130257,8780,2,764,5,19253,6,0,346,20313,0


Converting to forward existential form...Done !
original formula: EG(((p40==0)||(p102==1)))
=> equivalent forward existential formula: [FwdG(Init,((p40==0)||(p102==1)))] != FALSE
Hit Full ! (commute/partial/dont) 139/0/9
(forward)formula 0,1,0.353865,14688,1,0,21,47042,19,4,2372,43713,21
FORMULA MedleyA-PT-10-CTLCardinality-2024-11 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 : 133/133 places, 261/261 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 104 transition count 226
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 104 transition count 226
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 61 place count 104 transition count 223
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 69 place count 96 transition count 205
Iterating global reduction 1 with 8 rules applied. Total rules applied 77 place count 96 transition count 205
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 94 transition count 200
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 94 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 93 transition count 197
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 93 transition count 197
Applied a total of 83 rules in 9 ms. Remains 93 /133 variables (removed 40) and now considering 197/261 (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-3643373950172811815.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-544340571539864343.kers'
[2026-05-25 09:09:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3643373950172811815.kers, --Pflows, --basisKERS=/tmp/petrispot-output-544340571539864343.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 197 rows 93 cols 985 entries
Finished phase 1 with 79 SingleSign rule and 4 generalized
[2026-05-25 09:09:55] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-544340571539864343.kers
Total runtime 2 ms.
[2026-05-25 09:09:55] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-25 09:09:55] [INFO ] Invariant cache hit.
[2026-05-25 09:09:55] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2026-05-25 09:09:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/290 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (OVERLAPS) 0/290 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (OVERLAPS) 0/290 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 115 constraints, problems are : Problem set: 0 solved, 196 unsolved in 21021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/290 variables, 93/113 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 196/309 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (OVERLAPS) 0/290 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/290 variables, and 313 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 51148ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 51150ms
Starting structural reductions in LTL mode, iteration 1 : 93/133 places, 197/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51434 ms. Remains : 93/133 places, 197/261 transitions.
[2026-05-25 09:10:46] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:10:46] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:10:46] [INFO ] Input system was already deterministic with 197 transitions.
[2026-05-25 09:10:46] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:10:46] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:10:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality3537216960730549318.gal : 2 ms
[2026-05-25 09:10:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality17342249584401468502.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/CTLCardinality3537216960730549318.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17342249584401468502.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(EX((AG((p105!=0)) * (((p57==0)||(p132==1))||(p105==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX((!(E(TRUE U !((p105!=0)))) * (((p57==0)||(p132==1))||(p105==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t10, t11, t16, t17, t18, t19, t20, t21, t22, t23, t26, t27, t29, t30, t31, t32, t33, ...464
(forward)formula 0,0,7.42952,180100,1,0,391,729896,421,125,5638,755914,443
FORMULA MedleyA-PT-10-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 133/133 places, 261/261 transitions.
Graph (complete) has 491 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 243
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 239
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 239
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 39 place count 113 transition count 237
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 43 place count 111 transition count 237
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 60 place count 94 transition count 214
Iterating global reduction 3 with 17 rules applied. Total rules applied 77 place count 94 transition count 214
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 82 place count 89 transition count 195
Iterating global reduction 3 with 5 rules applied. Total rules applied 87 place count 89 transition count 195
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 86 transition count 187
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 86 transition count 187
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 94 place count 86 transition count 186
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 96 place count 85 transition count 185
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 97 place count 84 transition count 182
Iterating global reduction 5 with 1 rules applied. Total rules applied 98 place count 84 transition count 182
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 124 place count 71 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 125 place count 71 transition count 168
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 127 place count 69 transition count 166
Iterating global reduction 6 with 2 rules applied. Total rules applied 129 place count 69 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 133 place count 69 transition count 162
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 133 place count 69 transition count 160
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 137 place count 67 transition count 160
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 141 place count 65 transition count 158
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 142 place count 64 transition count 157
Applied a total of 142 rules in 22 ms. Remains 64 /133 variables (removed 69) and now considering 157/261 (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-16145967385894476683.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2269072093551438036.kers'
[2026-05-25 09:10:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16145967385894476683.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2269072093551438036.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 157 rows 64 cols 676 entries
Finished phase 1 with 50 SingleSign rule and 4 generalized
[2026-05-25 09:10:54] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2269072093551438036.kers
Total runtime 2 ms.
[2026-05-25 09:10:54] [INFO ] Implicit Places using invariants in 118 ms returned [9, 37]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 131 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 62/133 places, 157/261 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 157/157 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 155 ms. Remains : 62/133 places, 157/261 transitions.
[2026-05-25 09:10:54] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:10:54] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:10:54] [INFO ] Input system was already deterministic with 157 transitions.
[2026-05-25 09:10:54] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:10:54] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:10:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality18234465289232612535.gal : 1 ms
[2026-05-25 09:10:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality8737496962487973210.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/CTLCardinality18234465289232612535.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8737496962487973210.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,886624,0.572286,21396,2,3598,5,55808,6,0,401,65302,0


Converting to forward existential form...Done !
original formula: AF((EG(((EF(((p6==0)&&(p60==1))) * ((p55==0) + EG(((p20==0)||(p3==1))))) * ((p72==1)&&(((p66==0)||(p79==1))||((p133==0)||(p67==1)))))) * ...189
=> equivalent forward existential formula: [FwdG(Init,!((EG(((E(TRUE U ((p6==0)&&(p60==1))) * ((p55==0) + EG(((p20==0)||(p3==1))))) * ((p72==1)&&(((p66==0)...240
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t5, t6, t7, t8, t10, t11, t12, t14, t15, t17, t19, t20, t21, t22, t23, t24, t25, ...402
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-25 09:11:24] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:11:24] [INFO ] Applying decomposition
[2026-05-25 09:11:24] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2323502977017068828.txt' '-o' '/tmp/graph2323502977017068828.bin' '-w' '/tmp/graph2323502977017068828.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2323502977017068828.bin' '-l' '-1' '-v' '-w' '/tmp/graph2323502977017068828.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:11:24] [INFO ] Decomposing Gal with order
[2026-05-25 09:11:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:11:24] [INFO ] Removed a total of 321 redundant transitions.
[2026-05-25 09:11:24] [INFO ] Flatten gal took : 25 ms
[2026-05-25 09:11:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 2 ms.
[2026-05-25 09:11:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality10571792235853614253.gal : 1 ms
[2026-05-25 09:11:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality14553266841244190621.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/CTLCardinality10571792235853614253.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14553266841244190621.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,886624,0.126864,8960,362,211,7872,1610,278,18928,130,7367,0


Converting to forward existential form...Done !
original formula: AF((EG(((EF(((i0.u2.p6==0)&&(u5.p60==1))) * ((u5.p55==0) + EG(((i1.u1.p20==0)||(i1.u1.p3==1))))) * ((i0.u8.p72==1)&&(((i3.u6.p66==0)||(i3...256
=> equivalent forward existential formula: [FwdG(Init,!((EG(((E(TRUE U ((i0.u2.p6==0)&&(u5.p60==1))) * ((u5.p55==0) + EG(((i1.u1.p20==0)||(i1.u1.p3==1)))))...307
Reverse transition relation is NOT exact ! Due to transitions t14, t107, t110, t138, t151, t155, u5.t20, u5.t21, u5.t22, u5.t23, u5.t24, u5.t25, u5.t26, u5...535
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
(forward)formula 0,0,2.07678,80640,1,0,116962,6399,1758,338799,719,29222,187823
FORMULA MedleyA-PT-10-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 133/133 places, 261/261 transitions.
Graph (complete) has 491 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 240
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 112 transition count 238
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 41 place count 112 transition count 236
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 45 place count 110 transition count 236
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 66 place count 89 transition count 210
Iterating global reduction 2 with 21 rules applied. Total rules applied 87 place count 89 transition count 210
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 87 place count 89 transition count 208
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 91 place count 87 transition count 208
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 99 place count 79 transition count 190
Iterating global reduction 2 with 8 rules applied. Total rules applied 107 place count 79 transition count 190
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 110 place count 76 transition count 180
Iterating global reduction 2 with 3 rules applied. Total rules applied 113 place count 76 transition count 180
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 115 place count 76 transition count 178
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 119 place count 74 transition count 176
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 120 place count 73 transition count 173
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 73 transition count 173
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 147 place count 59 transition count 161
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 149 place count 57 transition count 159
Iterating global reduction 4 with 2 rules applied. Total rules applied 151 place count 57 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 155 place count 57 transition count 155
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 155 place count 57 transition count 153
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 159 place count 55 transition count 153
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 163 place count 53 transition count 151
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 165 place count 51 transition count 149
Applied a total of 165 rules in 45 ms. Remains 51 /133 variables (removed 82) and now considering 149/261 (removed 112) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17252751969695437633.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9595998993522538786.kers'
[2026-05-25 09:11:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17252751969695437633.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9595998993522538786.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 149 rows 51 cols 623 entries
Finished phase 1 with 41 SingleSign rule and 2 generalized
[2026-05-25 09:11:26] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9595998993522538786.kers
Total runtime 1 ms.
[2026-05-25 09:11:26] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-25 09:11:26] [INFO ] Invariant cache hit.
[2026-05-25 09:11:26] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:11:27] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2026-05-25 09:11:27] [INFO ] Redundant transitions in 1 ms returned []
Running 141 sub problems to find dead transitions.
[2026-05-25 09:11:27] [INFO ] Invariant cache hit.
[2026-05-25 09:11:27] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 2/50 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 148/198 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 2/200 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 75 constraints, problems are : Problem set: 0 solved, 141 unsolved in 6057 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 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/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 2/50 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 148/198 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 140/214 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (OVERLAPS) 2/200 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 12 (OVERLAPS) 0/200 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 216 constraints, problems are : Problem set: 0 solved, 141 unsolved in 18323 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24450ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 24450ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/133 places, 149/261 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24683 ms. Remains : 51/133 places, 149/261 transitions.
[2026-05-25 09:11:51] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:11:51] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:11:51] [INFO ] Input system was already deterministic with 149 transitions.
[2026-05-25 09:11:51] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:11:51] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:11:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality7152268789714619976.gal : 1 ms
[2026-05-25 09:11:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality17188715802916675531.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/CTLCardinality7152268789714619976.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17188715802916675531.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,401788,0.126461,8176,2,658,5,17887,6,0,348,18075,0


Converting to forward existential form...Done !
original formula: EG(((p110==0)||(p117==1)))
=> equivalent forward existential formula: [FwdG(Init,((p110==0)||(p117==1)))] != FALSE
Hit Full ! (commute/partial/dont) 141/0/8
(forward)formula 0,1,0.255668,11704,1,0,8,37228,19,4,2399,29936,8
FORMULA MedleyA-PT-10-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-25 09:11:51] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:11:51] [INFO ] Flatten gal took : 11 ms
Total runtime 668912 ms.

BK_STOP 1779700311897

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

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

Sequence of Actions to be Executed by the VM

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

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

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