Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r034-tall-177946842000497.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is BusinessProcesses-PT-07, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842000497
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 9.1K Mar 5 17:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Mar 5 17:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 5 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 5 17:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Mar 5 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 5 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Mar 5 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 5 17:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:44 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 100K 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 BusinessProcesses-PT-07-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779612500059

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-24 08:48:21] [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-24 08:48:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 08:48:21] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2026-05-24 08:48:21] [INFO ] Transformed 386 places.
[2026-05-24 08:48:21] [INFO ] Transformed 360 transitions.
[2026-05-24 08:48:21] [INFO ] Found NUPN structural information;
[2026-05-24 08:48:21] [INFO ] Parsed PT model containing 386 places and 360 transitions and 1110 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Support contains 156 out of 386 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 360/360 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 385 transition count 360
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 27 place count 359 transition count 334
Iterating global reduction 1 with 26 rules applied. Total rules applied 53 place count 359 transition count 334
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 60 place count 352 transition count 327
Iterating global reduction 1 with 7 rules applied. Total rules applied 67 place count 352 transition count 327
Applied a total of 67 rules in 75 ms. Remains 352 /386 variables (removed 34) and now considering 327/360 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1705824211216178386.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11175316717638069601.kers'
[2026-05-24 08:48:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1705824211216178386.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11175316717638069601.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 327 rows 352 cols 1043 entries
Finished phase 1 with 243 SingleSign rule and 48 generalized
[2026-05-24 08:48:21] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11175316717638069601.kers
Total runtime 2 ms.
[2026-05-24 08:48:21] [INFO ] Implicit Places using invariants in 365 ms returned []
[2026-05-24 08:48:21] [INFO ] Invariant cache hit.
[2026-05-24 08:48:22] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
Running 326 sub problems to find dead transitions.
[2026-05-24 08:48:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 326 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/679 variables, and 181 constraints, problems are : Problem set: 0 solved, 326 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/352 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 120/120 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 326 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 120/181 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 20/301 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 20/321 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 20/341 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 326 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/679 variables, and 361 constraints, problems are : Problem set: 0 solved, 326 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/352 constraints, PredecessorRefiner: 0/326 constraints, Known Traps: 300/300 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60154ms problems are : Problem set: 0 solved, 326 unsolved
Search for dead transitions found 0 dead transitions in 60169ms
Starting structural reductions in LTL mode, iteration 1 : 352/386 places, 327/360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61135 ms. Remains : 352/386 places, 327/360 transitions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 327/327 transitions.
Applied a total of 0 rules in 4 ms. Remains 352 /352 variables (removed 0) and now considering 327/327 (removed 0) transitions.
[2026-05-24 08:49:22] [INFO ] Invariant cache hit.
[2026-05-24 08:49:22] [INFO ] Implicit Places using invariants in 146 ms returned []
[2026-05-24 08:49:22] [INFO ] Invariant cache hit.
[2026-05-24 08:49:23] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 566 ms. Remains : 352/352 places, 327/327 transitions.
Support contains 156 out of 352 places after structural reductions.
[2026-05-24 08:49:23] [INFO ] Flatten gal took : 88 ms
[2026-05-24 08:49:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-07-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 08:49:23] [INFO ] Flatten gal took : 26 ms
[2026-05-24 08:49:23] [INFO ] Input system was already deterministic with 327 transitions.
Support contains 138 out of 352 places (down from 156) after GAL structural reductions.
RANDOM walk for 40000 steps (437 resets) in 1478 ms. (27 steps per ms) remains 7/86 properties
BEST_FIRST walk for 40003 steps (82 resets) in 187 ms. (212 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (76 resets) in 143 ms. (277 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (81 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (79 resets) in 149 ms. (266 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (80 resets) in 265 ms. (150 steps per ms) remains 3/3 properties
[2026-05-24 08:49:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 105/118 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 142/260 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 83/343 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 6/349 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 325/674 variables, 349/410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/674 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 5/679 variables, 3/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/679 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/679 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 679/679 variables, and 413 constraints, problems are : Problem set: 0 solved, 3 unsolved in 539 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 105/118 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 142/260 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 83/343 variables, 15/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 5580ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 327/327 transitions.
Graph (trivial) has 170 edges and 352 vertex of which 7 / 352 are part of one of the 1 SCC in 7 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 769 edges and 346 vertex of which 345 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 345 transition count 269
Reduce places removed 49 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 296 transition count 267
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 104 place count 294 transition count 267
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 104 place count 294 transition count 208
Deduced a syphon composed of 59 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 127 rules applied. Total rules applied 231 place count 226 transition count 208
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 258 place count 199 transition count 181
Iterating global reduction 3 with 27 rules applied. Total rules applied 285 place count 199 transition count 181
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 285 place count 199 transition count 179
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 289 place count 197 transition count 179
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 419 place count 131 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 421 place count 130 transition count 118
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 423 place count 130 transition count 116
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 425 place count 128 transition count 116
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 426 place count 128 transition count 116
Applied a total of 426 rules in 85 ms. Remains 128 /352 variables (removed 224) and now considering 116/327 (removed 211) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 128/352 places, 116/327 transitions.
RANDOM walk for 40000 steps (2046 resets) in 389 ms. (102 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40001 steps (556 resets) in 100 ms. (396 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40001 steps (532 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11231033506847551422.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-436870259479651792.kers'
[2026-05-24 08:49:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11231033506847551422.kers, --Pflows, --basisKERS=/tmp/petrispot-output-436870259479651792.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 116 rows 127 cols 635 entries
Finished phase 1 with 36 SingleSign rule and 42 generalized
[2026-05-24 08:49:30] [INFO ] Computed 50 invariants in 0 ms
Computed 50 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-436870259479651792.kers
Total runtime 1 ms.
[2026-05-24 08:49:30] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/35 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/124 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/127 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 116/243 variables, 127/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 10/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/244 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/244 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/244 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 188 constraints, problems are : Problem set: 0 solved, 1 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 128/128 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/35 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/124 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp77 is UNSAT
After SMT solving in domain Int declared 124/244 variables, and 67 constraints, problems are : Problem set: 1 solved, 0 unsolved in 1264 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 13/16 constraints, State Equation: 0/128 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1409ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2026-05-24 08:49:31] [INFO ] Flatten gal took : 24 ms
[2026-05-24 08:49:31] [INFO ] Flatten gal took : 18 ms
[2026-05-24 08:49:31] [INFO ] Input system was already deterministic with 327 transitions.
Computed a total of 220 stabilizing places and 222 stable transitions
Graph (complete) has 777 edges and 352 vertex of which 351 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 327/327 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 319 transition count 294
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 319 transition count 294
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 79 place count 306 transition count 281
Iterating global reduction 0 with 13 rules applied. Total rules applied 92 place count 306 transition count 281
Applied a total of 92 rules in 28 ms. Remains 306 /352 variables (removed 46) and now considering 281/327 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6076677365038875064.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-995983356449103988.kers'
[2026-05-24 08:49:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6076677365038875064.kers, --Pflows, --basisKERS=/tmp/petrispot-output-995983356449103988.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 281 rows 306 cols 951 entries
Finished phase 1 with 197 SingleSign rule and 48 generalized
[2026-05-24 08:49:31] [INFO ] Computed 61 invariants in 4 ms
Computed 61 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-995983356449103988.kers
Total runtime 4 ms.
[2026-05-24 08:49:31] [INFO ] Implicit Places using invariants in 180 ms returned []
[2026-05-24 08:49:31] [INFO ] Invariant cache hit.
[2026-05-24 08:49:32] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
Running 280 sub problems to find dead transitions.
[2026-05-24 08:49:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 1/306 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Problem TDEAD210 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD252 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 20/81 constraints. Problems are: Problem set: 3 solved, 277 unsolved
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 20/101 constraints. Problems are: Problem set: 10 solved, 270 unsolved
Problem TDEAD211 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD253 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 20/121 constraints. Problems are: Problem set: 15 solved, 265 unsolved
Problem TDEAD212 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD259 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 20/141 constraints. Problems are: Problem set: 31 solved, 249 unsolved
Problem TDEAD242 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 11/152 constraints. Problems are: Problem set: 36 solved, 244 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 20/172 constraints. Problems are: Problem set: 36 solved, 244 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 17/189 constraints. Problems are: Problem set: 36 solved, 244 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/587 variables, and 191 constraints, problems are : Problem set: 36 solved, 244 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/306 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 130/130 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 36 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 15/15 constraints. Problems are: Problem set: 36 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 0/15 constraints. Problems are: Problem set: 36 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 1/306 variables, 43/58 constraints. Problems are: Problem set: 36 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 3/61 constraints. Problems are: Problem set: 36 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 130/191 constraints. Problems are: Problem set: 36 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 20/211 constraints. Problems are: Problem set: 36 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 19/230 constraints. Problems are: Problem set: 36 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 4/234 constraints. Problems are: Problem set: 36 solved, 244 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 9/243 constraints. Problems are: Problem set: 36 solved, 244 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 20/263 constraints. Problems are: Problem set: 36 solved, 244 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 2/265 constraints. Problems are: Problem set: 36 solved, 244 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 8/273 constraints. Problems are: Problem set: 36 solved, 244 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 8/281 constraints. Problems are: Problem set: 36 solved, 244 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 1/282 constraints. Problems are: Problem set: 36 solved, 244 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/587 variables, and 282 constraints, problems are : Problem set: 36 solved, 244 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/306 constraints, PredecessorRefiner: 0/280 constraints, Known Traps: 221/221 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60056ms problems are : Problem set: 36 solved, 244 unsolved
Search for dead transitions found 36 dead transitions in 60059ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 306/352 places, 245/327 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 303 transition count 245
Applied a total of 3 rules in 6 ms. Remains 303 /306 variables (removed 3) and now considering 245/245 (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-10004473048965072824.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11539425503070388821.kers'
[2026-05-24 08:50:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10004473048965072824.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11539425503070388821.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 245 rows 303 cols 729 entries
Finished phase 1 with 198 SingleSign rule and 38 generalized
[2026-05-24 08:50:32] [INFO ] Computed 67 invariants in 2 ms
Computed 67 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11539425503070388821.kers
Total runtime 3 ms.
[2026-05-24 08:50:32] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-24 08:50:32] [INFO ] Invariant cache hit.
[2026-05-24 08:50:32] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 303/352 places, 245/327 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61045 ms. Remains : 303/352 places, 245/327 transitions.
[2026-05-24 08:50:32] [INFO ] Flatten gal took : 12 ms
[2026-05-24 08:50:32] [INFO ] Flatten gal took : 10 ms
[2026-05-24 08:50:32] [INFO ] Input system was already deterministic with 245 transitions.
[2026-05-24 08:50:32] [INFO ] Flatten gal took : 10 ms
[2026-05-24 08:50:32] [INFO ] Flatten gal took : 10 ms
[2026-05-24 08:50:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality17068073402190624038.gal : 5 ms
[2026-05-24 08:50:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality17343119436304503563.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17068073402190624038.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17343119436304503563.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 08:51:02] [INFO ] Flatten gal took : 10 ms
[2026-05-24 08:51:02] [INFO ] Applying decomposition
[2026-05-24 08:51:02] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4188690278629156449.txt' '-o' '/tmp/graph4188690278629156449.bin' '-w' '/tmp/graph4188690278629156449.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4188690278629156449.bin' '-l' '-1' '-v' '-w' '/tmp/graph4188690278629156449.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:51:03] [INFO ] Decomposing Gal with order
[2026-05-24 08:51:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:51:03] [INFO ] Removed a total of 66 redundant transitions.
[2026-05-24 08:51:03] [INFO ] Flatten gal took : 63 ms
[2026-05-24 08:51:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 7 ms.
[2026-05-24 08:51:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality8642886492087259452.gal : 5 ms
[2026-05-24 08:51:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality9476835727230646063.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/CTLCardinality8642886492087259452.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9476835727230646063.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 327/327 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 319 transition count 294
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 319 transition count 294
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 79 place count 306 transition count 281
Iterating global reduction 0 with 13 rules applied. Total rules applied 92 place count 306 transition count 281
Applied a total of 92 rules in 19 ms. Remains 306 /352 variables (removed 46) and now considering 281/327 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-507400301286967760.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7128930221635474067.kers'
[2026-05-24 08:51:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-507400301286967760.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7128930221635474067.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 281 rows 306 cols 951 entries
Finished phase 1 with 197 SingleSign rule and 48 generalized
[2026-05-24 08:51:33] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7128930221635474067.kers
Total runtime 2 ms.
[2026-05-24 08:51:33] [INFO ] Implicit Places using invariants in 167 ms returned []
[2026-05-24 08:51:33] [INFO ] Invariant cache hit.
[2026-05-24 08:51:33] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
Running 280 sub problems to find dead transitions.
[2026-05-24 08:51:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (OVERLAPS) 1/306 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Problem TDEAD216 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD261 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 20/81 constraints. Problems are: Problem set: 6 solved, 274 unsolved
Problem TDEAD211 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD253 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 20/101 constraints. Problems are: Problem set: 9 solved, 271 unsolved
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 20/121 constraints. Problems are: Problem set: 13 solved, 267 unsolved
Problem TDEAD224 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 20/141 constraints. Problems are: Problem set: 17 solved, 263 unsolved
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 20/161 constraints. Problems are: Problem set: 29 solved, 251 unsolved
Problem TDEAD217 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD245 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 20/181 constraints. Problems are: Problem set: 33 solved, 247 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 20/201 constraints. Problems are: Problem set: 33 solved, 247 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/587 variables, and 201 constraints, problems are : Problem set: 33 solved, 247 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/306 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 140/140 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 33 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 15/15 constraints. Problems are: Problem set: 33 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 0/15 constraints. Problems are: Problem set: 33 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 1/306 variables, 43/58 constraints. Problems are: Problem set: 33 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 3/61 constraints. Problems are: Problem set: 33 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 140/201 constraints. Problems are: Problem set: 33 solved, 247 unsolved
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD215 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 15/216 constraints. Problems are: Problem set: 36 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 20/236 constraints. Problems are: Problem set: 36 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 12/248 constraints. Problems are: Problem set: 36 solved, 244 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 1/249 constraints. Problems are: Problem set: 36 solved, 244 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 14/263 constraints. Problems are: Problem set: 36 solved, 244 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 10/273 constraints. Problems are: Problem set: 36 solved, 244 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 8/281 constraints. Problems are: Problem set: 36 solved, 244 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 9/290 constraints. Problems are: Problem set: 36 solved, 244 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/587 variables, and 291 constraints, problems are : Problem set: 36 solved, 244 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/306 constraints, PredecessorRefiner: 0/280 constraints, Known Traps: 230/230 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60060ms problems are : Problem set: 36 solved, 244 unsolved
Search for dead transitions found 36 dead transitions in 60063ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 306/352 places, 245/327 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 303 transition count 245
Applied a total of 3 rules in 6 ms. Remains 303 /306 variables (removed 3) and now considering 245/245 (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-16012354718340825825.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5173871971207987076.kers'
[2026-05-24 08:52:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16012354718340825825.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5173871971207987076.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 245 rows 303 cols 729 entries
Finished phase 1 with 198 SingleSign rule and 38 generalized
[2026-05-24 08:52:33] [INFO ] Computed 67 invariants in 1 ms
Computed 67 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5173871971207987076.kers
Total runtime 2 ms.
[2026-05-24 08:52:34] [INFO ] Implicit Places using invariants in 135 ms returned []
[2026-05-24 08:52:34] [INFO ] Invariant cache hit.
[2026-05-24 08:52:34] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 303/352 places, 245/327 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61069 ms. Remains : 303/352 places, 245/327 transitions.
[2026-05-24 08:52:34] [INFO ] Flatten gal took : 9 ms
[2026-05-24 08:52:34] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:52:34] [INFO ] Input system was already deterministic with 245 transitions.
[2026-05-24 08:52:34] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:52:34] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:52:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality9225657849094323980.gal : 2 ms
[2026-05-24 08:52:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality16801338900822275080.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/CTLCardinality9225657849094323980.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16801338900822275080.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 08:53:04] [INFO ] Flatten gal took : 13 ms
[2026-05-24 08:53:04] [INFO ] Applying decomposition
[2026-05-24 08:53:04] [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/graph15728378526901935280.txt' '-o' '/tmp/graph15728378526901935280.bin' '-w' '/tmp/graph15728378526901935280.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15728378526901935280.bin' '-l' '-1' '-v' '-w' '/tmp/graph15728378526901935280.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:53:04] [INFO ] Decomposing Gal with order
[2026-05-24 08:53:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:53:04] [INFO ] Removed a total of 68 redundant transitions.
[2026-05-24 08:53:04] [INFO ] Flatten gal took : 15 ms
[2026-05-24 08:53:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2026-05-24 08:53:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality3763559164699520911.gal : 4 ms
[2026-05-24 08:53:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality16057592749206330126.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/CTLCardinality3763559164699520911.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16057592749206330126.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,4.98884e+17,2.26743,62296,5238,37,112435,417,683,146622,61,1060,0


Converting to forward existential form...Done !
original formula: (EF(AG(EX(AG(((i8.u49.p146==0)&&(i3.i1.u23.p68==1)))))) + AG(AF(EG((i17.u92.p342==1)))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(E(TRUE U !(E(TRUE U !(EX(!(E(TRUE U !(((i8.u49.p146==0)&&(i3.i1.u23.p68==1)))))))))))),TRUE...191
Reverse transition relation is NOT exact ! Due to transitions t7, t108, t132, t160, t164, t170, t202, t206, t228, t230, t237, t238, t239, i0.u18.t163, i1.t...847
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,0,17.9782,455640,1,0,934230,521,4952,1.18822e+06,319,1639,1976543
FORMULA BusinessProcesses-PT-07-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 327/327 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 321 transition count 296
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 321 transition count 296
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 73 place count 310 transition count 285
Iterating global reduction 0 with 11 rules applied. Total rules applied 84 place count 310 transition count 285
Applied a total of 84 rules in 13 ms. Remains 310 /352 variables (removed 42) and now considering 285/327 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15205207025979228862.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14353897683494373117.kers'
[2026-05-24 08:53:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15205207025979228862.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14353897683494373117.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 285 rows 310 cols 959 entries
Finished phase 1 with 201 SingleSign rule and 48 generalized
[2026-05-24 08:53:22] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14353897683494373117.kers
Total runtime 2 ms.
[2026-05-24 08:53:22] [INFO ] Implicit Places using invariants in 271 ms returned []
[2026-05-24 08:53:22] [INFO ] Invariant cache hit.
[2026-05-24 08:53:23] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2026-05-24 08:53:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 20/81 constraints. Problems are: Problem set: 3 solved, 281 unsolved
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 20/101 constraints. Problems are: Problem set: 7 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 20/121 constraints. Problems are: Problem set: 7 solved, 277 unsolved
Problem TDEAD246 is UNSAT
Problem TDEAD249 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 20/141 constraints. Problems are: Problem set: 9 solved, 275 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 20/161 constraints. Problems are: Problem set: 9 solved, 275 unsolved
Problem TDEAD224 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 20/181 constraints. Problems are: Problem set: 17 solved, 267 unsolved
Problem TDEAD244 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD240 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 19/200 constraints. Problems are: Problem set: 21 solved, 263 unsolved
SMT process timed out in 30063ms, After SMT, problems are : Problem set: 21 solved, 263 unsolved
Search for dead transitions found 21 dead transitions in 30072ms
Found 21 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 21 transitions
Dead transitions reduction (with SMT) removed 21 transitions
Starting structural reductions in LTL mode, iteration 1 : 310/352 places, 264/327 transitions.
Applied a total of 0 rules in 8 ms. Remains 310 /310 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30777 ms. Remains : 310/352 places, 264/327 transitions.
[2026-05-24 08:53:53] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:53:53] [INFO ] Flatten gal took : 6 ms
[2026-05-24 08:53:53] [INFO ] Input system was already deterministic with 264 transitions.
[2026-05-24 08:53:53] [INFO ] Flatten gal took : 6 ms
[2026-05-24 08:53:53] [INFO ] Flatten gal took : 6 ms
[2026-05-24 08:53:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality15027703704945104756.gal : 2 ms
[2026-05-24 08:53:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality10473399722603934411.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/CTLCardinality15027703704945104756.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10473399722603934411.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 08:54:23] [INFO ] Flatten gal took : 6 ms
[2026-05-24 08:54:23] [INFO ] Applying decomposition
[2026-05-24 08:54:23] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3999399791696717819.txt' '-o' '/tmp/graph3999399791696717819.bin' '-w' '/tmp/graph3999399791696717819.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3999399791696717819.bin' '-l' '-1' '-v' '-w' '/tmp/graph3999399791696717819.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:54:23] [INFO ] Decomposing Gal with order
[2026-05-24 08:54:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:54:23] [INFO ] Removed a total of 130 redundant transitions.
[2026-05-24 08:54:23] [INFO ] Flatten gal took : 18 ms
[2026-05-24 08:54:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-24 08:54:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality14583210076262055655.gal : 3 ms
[2026-05-24 08:54:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality15272952657718992953.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/CTLCardinality14583210076262055655.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15272952657718992953.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,4.49596e+17,3.9813,105600,3314,54,175905,696,860,356150,72,1911,0


Converting to forward existential form...Done !
original formula: (E((i14.u83.p269!=1) U !(EF(((i10.i0.u11.p36==0)||(i14.u82.p326==1))))) + AX((((((((i12.i1.u77.p250==0)||(i13.i2.u81.p260==1)) * AG((i5.i...413
=> equivalent forward existential formula: (([(FwdU(((EY((Init * !(E((i14.u83.p269!=1) U !(E(TRUE U ((i10.i0.u11.p36==0)||(i14.u82.p326==1)))))))) * !(((((...715
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t7, t8, t10, t137, t156, t168, t180, t206, t247, t249, t256, t257, t258, i0.u44.t...906
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 352/352 places, 327/327 transitions.
Graph (trivial) has 179 edges and 352 vertex of which 7 / 352 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 770 edges and 346 vertex of which 345 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 344 transition count 264
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 290 transition count 264
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 110 place count 290 transition count 201
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 135 rules applied. Total rules applied 245 place count 218 transition count 201
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 274 place count 189 transition count 172
Iterating global reduction 2 with 29 rules applied. Total rules applied 303 place count 189 transition count 172
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 303 place count 189 transition count 170
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 307 place count 187 transition count 170
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 121 rules applied. Total rules applied 428 place count 125 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 430 place count 124 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 431 place count 123 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 432 place count 122 transition count 109
Applied a total of 432 rules in 55 ms. Remains 122 /352 variables (removed 230) and now considering 109/327 (removed 218) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8288326236034814189.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7132268870267908335.kers'
[2026-05-24 08:54:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8288326236034814189.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7132268870267908335.kers]
Normalized transition count is 108 out of 109 initially.
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 108 rows 111 cols 521 entries
Finished phase 1 with 62 SingleSign rule and 12 generalized
[2026-05-24 08:54:53] [INFO ] Computed 48 invariants in 0 ms
Computed 48 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7132268870267908335.kers
Total runtime 1 ms.
[2026-05-24 08:54:53] [INFO ] Implicit Places using invariants in 96 ms returned [0, 1, 9, 37, 38, 39, 40, 41, 42]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 105 ms to find 9 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 113/352 places, 109/327 transitions.
Applied a total of 0 rules in 7 ms. Remains 113 /113 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 167 ms. Remains : 113/352 places, 109/327 transitions.
[2026-05-24 08:54:53] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:54:53] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:54:53] [INFO ] Input system was already deterministic with 109 transitions.
[2026-05-24 08:54:53] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:54:53] [INFO ] Flatten gal took : 3 ms
[2026-05-24 08:54:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality15113821840217942744.gal : 1 ms
[2026-05-24 08:54:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality5417403429639452494.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/CTLCardinality15113821840217942744.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5417403429639452494.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(((p244==0) * EF((((p164==0)&&(p86==1))||(p215==1)))))
=> equivalent forward existential formula: [FwdG(Init,((p244==0) * E(TRUE U (((p164==0)&&(p86==1))||(p215==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t7, t20, t21, t22, t23, t24, t47, t48, t49, t50, t51, t66, t73, t74, t80, t81, t96, t...288
(forward)formula 0,1,2.62498,91364,1,0,220,578731,209,111,4318,317454,254
FORMULA BusinessProcesses-PT-07-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 327/327 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 317 transition count 292
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 317 transition count 292
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 83 place count 304 transition count 279
Iterating global reduction 0 with 13 rules applied. Total rules applied 96 place count 304 transition count 279
Applied a total of 96 rules in 22 ms. Remains 304 /352 variables (removed 48) and now considering 279/327 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17866819127504508304.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10029995958569570033.kers'
[2026-05-24 08:54:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17866819127504508304.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10029995958569570033.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 279 rows 304 cols 947 entries
Finished phase 1 with 195 SingleSign rule and 48 generalized
[2026-05-24 08:54:56] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10029995958569570033.kers
Total runtime 2 ms.
[2026-05-24 08:54:56] [INFO ] Implicit Places using invariants in 152 ms returned []
[2026-05-24 08:54:56] [INFO ] Invariant cache hit.
[2026-05-24 08:54:57] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2026-05-24 08:54:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (OVERLAPS) 1/304 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Problem TDEAD213 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 20/81 constraints. Problems are: Problem set: 8 solved, 270 unsolved
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 20/101 constraints. Problems are: Problem set: 12 solved, 266 unsolved
Problem TDEAD210 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 20/121 constraints. Problems are: Problem set: 24 solved, 254 unsolved
Problem TDEAD220 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 20/141 constraints. Problems are: Problem set: 28 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 20/161 constraints. Problems are: Problem set: 28 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 20/181 constraints. Problems are: Problem set: 28 solved, 250 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 20/201 constraints. Problems are: Problem set: 28 solved, 250 unsolved
SMT process timed out in 30061ms, After SMT, problems are : Problem set: 28 solved, 250 unsolved
Search for dead transitions found 28 dead transitions in 30062ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in LTL mode, iteration 1 : 304/352 places, 251/327 transitions.
Applied a total of 0 rules in 8 ms. Remains 304 /304 variables (removed 0) and now considering 251/251 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30691 ms. Remains : 304/352 places, 251/327 transitions.
[2026-05-24 08:55:27] [INFO ] Flatten gal took : 9 ms
[2026-05-24 08:55:27] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:55:27] [INFO ] Input system was already deterministic with 251 transitions.
[2026-05-24 08:55:27] [INFO ] Flatten gal took : 5 ms
[2026-05-24 08:55:27] [INFO ] Flatten gal took : 5 ms
[2026-05-24 08:55:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality437882131240793454.gal : 2 ms
[2026-05-24 08:55:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality11359204979484711104.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/CTLCardinality437882131240793454.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11359204979484711104.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 08:55:57] [INFO ] Flatten gal took : 5 ms
[2026-05-24 08:55:57] [INFO ] Applying decomposition
[2026-05-24 08:55:57] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16212116252535277707.txt' '-o' '/tmp/graph16212116252535277707.bin' '-w' '/tmp/graph16212116252535277707.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16212116252535277707.bin' '-l' '-1' '-v' '-w' '/tmp/graph16212116252535277707.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:55:57] [INFO ] Decomposing Gal with order
[2026-05-24 08:55:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:55:57] [INFO ] Removed a total of 100 redundant transitions.
[2026-05-24 08:55:57] [INFO ] Flatten gal took : 12 ms
[2026-05-24 08:55:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2026-05-24 08:55:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality11734595347471692923.gal : 3 ms
[2026-05-24 08:55:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality9700836147052633083.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/CTLCardinality11734595347471692923.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9700836147052633083.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,4.29702e+17,19.2493,442412,35339,50,857812,487,752,1.26674e+06,61,1258,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 327/327 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 318 transition count 293
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 318 transition count 293
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 82 place count 304 transition count 279
Iterating global reduction 0 with 14 rules applied. Total rules applied 96 place count 304 transition count 279
Applied a total of 96 rules in 13 ms. Remains 304 /352 variables (removed 48) and now considering 279/327 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11795690739219314224.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3686841983364325723.kers'
[2026-05-24 08:56:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11795690739219314224.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3686841983364325723.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 279 rows 304 cols 947 entries
Finished phase 1 with 195 SingleSign rule and 48 generalized
[2026-05-24 08:56:27] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3686841983364325723.kers
Total runtime 2 ms.
[2026-05-24 08:56:27] [INFO ] Implicit Places using invariants in 164 ms returned []
[2026-05-24 08:56:27] [INFO ] Invariant cache hit.
[2026-05-24 08:56:27] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2026-05-24 08:56:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (OVERLAPS) 1/304 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Problem TDEAD213 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 20/101 constraints. Problems are: Problem set: 7 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 20/121 constraints. Problems are: Problem set: 7 solved, 271 unsolved
Problem TDEAD210 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD234 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 20/141 constraints. Problems are: Problem set: 10 solved, 268 unsolved
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD259 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 20/161 constraints. Problems are: Problem set: 25 solved, 253 unsolved
Problem TDEAD226 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 16/177 constraints. Problems are: Problem set: 36 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 20/197 constraints. Problems are: Problem set: 36 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/583 variables, and 200 constraints, problems are : Problem set: 36 solved, 242 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/304 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 139/139 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 36 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 15/15 constraints. Problems are: Problem set: 36 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 0/15 constraints. Problems are: Problem set: 36 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/304 variables, 43/58 constraints. Problems are: Problem set: 36 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 3/61 constraints. Problems are: Problem set: 36 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 139/200 constraints. Problems are: Problem set: 36 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 3/203 constraints. Problems are: Problem set: 36 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 16/219 constraints. Problems are: Problem set: 36 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 20/239 constraints. Problems are: Problem set: 36 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 6/245 constraints. Problems are: Problem set: 36 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 20/265 constraints. Problems are: Problem set: 36 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 17/282 constraints. Problems are: Problem set: 36 solved, 242 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/304 variables, 0/282 constraints. Problems are: Problem set: 36 solved, 242 unsolved
At refinement iteration 12 (OVERLAPS) 279/583 variables, 304/586 constraints. Problems are: Problem set: 36 solved, 242 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/583 variables, 242/828 constraints. Problems are: Problem set: 36 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/583 variables, and 834 constraints, problems are : Problem set: 36 solved, 242 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 304/304 constraints, PredecessorRefiner: 242/278 constraints, Known Traps: 227/227 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60050ms problems are : Problem set: 36 solved, 242 unsolved
Search for dead transitions found 36 dead transitions in 60050ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 304/352 places, 243/327 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 301 transition count 243
Applied a total of 3 rules in 6 ms. Remains 301 /304 variables (removed 3) and now considering 243/243 (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-3866768973067510215.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16187494741822702294.kers'
[2026-05-24 08:57:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3866768973067510215.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16187494741822702294.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 243 rows 301 cols 725 entries
Finished phase 1 with 196 SingleSign rule and 38 generalized
[2026-05-24 08:57:28] [INFO ] Computed 67 invariants in 2 ms
Computed 67 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16187494741822702294.kers
Total runtime 3 ms.
[2026-05-24 08:57:28] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-24 08:57:28] [INFO ] Invariant cache hit.
[2026-05-24 08:57:28] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 301/352 places, 243/327 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61041 ms. Remains : 301/352 places, 243/327 transitions.
[2026-05-24 08:57:28] [INFO ] Flatten gal took : 7 ms
[2026-05-24 08:57:28] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:57:28] [INFO ] Input system was already deterministic with 243 transitions.
[2026-05-24 08:57:28] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:57:28] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:57:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality1352006840959444078.gal : 2 ms
[2026-05-24 08:57:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality3560059737559083199.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/CTLCardinality1352006840959444078.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3560059737559083199.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 08:57:58] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:57:58] [INFO ] Applying decomposition
[2026-05-24 08:57:58] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2498364690025006727.txt' '-o' '/tmp/graph2498364690025006727.bin' '-w' '/tmp/graph2498364690025006727.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2498364690025006727.bin' '-l' '-1' '-v' '-w' '/tmp/graph2498364690025006727.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:57:58] [INFO ] Decomposing Gal with order
[2026-05-24 08:57:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:57:58] [INFO ] Removed a total of 68 redundant transitions.
[2026-05-24 08:57:58] [INFO ] Flatten gal took : 23 ms
[2026-05-24 08:57:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2026-05-24 08:57:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality14416405637218783528.gal : 4 ms
[2026-05-24 08:57:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality2904518678099797634.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/CTLCardinality14416405637218783528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2904518678099797634.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,4.23627e+17,5.24087,135384,5563,37,243204,526,649,403281,57,1263,0


Converting to forward existential form...Done !
original formula: EX(E((EG(((i8.u26.p79!=0)||((i15.u64.p194==1)&&(i17.u80.p264==0)))) * !(EF((i16.u54.p165==1)))) U AG(((i3.u8.p16==0)||(i5.i1.u69.p219==1)...159
=> equivalent forward existential formula: [(FwdU(EY(Init),(EG(((i8.u26.p79!=0)||((i15.u64.p194==1)&&(i17.u80.p264==0)))) * !(E(TRUE U (i16.u54.p165==1))))...223
Reverse transition relation is NOT exact ! Due to transitions t7, t132, t150, t158, t162, t168, t200, t204, t226, t228, t235, t236, t237, i0.t108, i0.u47.t...806
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 327/327 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 320 transition count 295
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 320 transition count 295
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 77 place count 307 transition count 282
Iterating global reduction 0 with 13 rules applied. Total rules applied 90 place count 307 transition count 282
Applied a total of 90 rules in 22 ms. Remains 307 /352 variables (removed 45) and now considering 282/327 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10472147241430457887.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10735260289681209457.kers'
[2026-05-24 08:58:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10472147241430457887.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10735260289681209457.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 282 rows 307 cols 953 entries
Finished phase 1 with 198 SingleSign rule and 48 generalized
[2026-05-24 08:58:28] [INFO ] Computed 61 invariants in 6 ms
Computed 61 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-10735260289681209457.kers
Total runtime 7 ms.
[2026-05-24 08:58:28] [INFO ] Implicit Places using invariants in 163 ms returned []
[2026-05-24 08:58:28] [INFO ] Invariant cache hit.
[2026-05-24 08:58:29] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2026-05-24 08:58:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/307 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 20/101 constraints. Problems are: Problem set: 4 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 20/121 constraints. Problems are: Problem set: 4 solved, 277 unsolved
Problem TDEAD211 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 20/141 constraints. Problems are: Problem set: 11 solved, 270 unsolved
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD240 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 20/161 constraints. Problems are: Problem set: 19 solved, 262 unsolved
Problem TDEAD216 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 20/181 constraints. Problems are: Problem set: 34 solved, 247 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 20/201 constraints. Problems are: Problem set: 34 solved, 247 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 307/589 variables, and 207 constraints, problems are : Problem set: 34 solved, 247 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/307 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 146/146 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 34 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 15/15 constraints. Problems are: Problem set: 34 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 0/15 constraints. Problems are: Problem set: 34 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 1/307 variables, 43/58 constraints. Problems are: Problem set: 34 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 3/61 constraints. Problems are: Problem set: 34 solved, 247 unsolved
Problem TDEAD262 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 146/207 constraints. Problems are: Problem set: 35 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 20/227 constraints. Problems are: Problem set: 35 solved, 246 unsolved
Problem TDEAD261 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 20/247 constraints. Problems are: Problem set: 36 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 7/254 constraints. Problems are: Problem set: 36 solved, 245 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 3/257 constraints. Problems are: Problem set: 36 solved, 245 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 0/257 constraints. Problems are: Problem set: 36 solved, 245 unsolved
At refinement iteration 10 (OVERLAPS) 282/589 variables, 307/564 constraints. Problems are: Problem set: 36 solved, 245 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 245/809 constraints. Problems are: Problem set: 36 solved, 245 unsolved
SMT process timed out in 60119ms, After SMT, problems are : Problem set: 36 solved, 245 unsolved
Search for dead transitions found 36 dead transitions in 60120ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 307/352 places, 246/327 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 304 transition count 246
Applied a total of 3 rules in 10 ms. Remains 304 /307 variables (removed 3) and now considering 246/246 (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-17110984856185104219.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12715867085317299164.kers'
[2026-05-24 08:59:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17110984856185104219.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12715867085317299164.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 304 cols 731 entries
Finished phase 1 with 199 SingleSign rule and 38 generalized
[2026-05-24 08:59:29] [INFO ] Computed 67 invariants in 1 ms
Computed 67 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12715867085317299164.kers
Total runtime 1 ms.
[2026-05-24 08:59:29] [INFO ] Implicit Places using invariants in 130 ms returned []
[2026-05-24 08:59:29] [INFO ] Invariant cache hit.
[2026-05-24 08:59:29] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 304/352 places, 246/327 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61074 ms. Remains : 304/352 places, 246/327 transitions.
[2026-05-24 08:59:29] [INFO ] Flatten gal took : 5 ms
[2026-05-24 08:59:29] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:59:29] [INFO ] Input system was already deterministic with 246 transitions.
[2026-05-24 08:59:29] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:59:29] [INFO ] Flatten gal took : 4 ms
[2026-05-24 08:59:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality9093746139850730306.gal : 1 ms
[2026-05-24 08:59:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality13020509145898030829.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/CTLCardinality9093746139850730306.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13020509145898030829.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 08:59:59] [INFO ] Flatten gal took : 8 ms
[2026-05-24 08:59:59] [INFO ] Applying decomposition
[2026-05-24 08:59:59] [INFO ] Flatten gal took : 10 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/graph13998220517992382770.txt' '-o' '/tmp/graph13998220517992382770.bin' '-w' '/tmp/graph13998220517992382770.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13998220517992382770.bin' '-l' '-1' '-v' '-w' '/tmp/graph13998220517992382770.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:59:59] [INFO ] Decomposing Gal with order
[2026-05-24 08:59:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:59:59] [INFO ] Removed a total of 69 redundant transitions.
[2026-05-24 08:59:59] [INFO ] Flatten gal took : 12 ms
[2026-05-24 08:59:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2026-05-24 08:59:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality14869320400910821218.gal : 2 ms
[2026-05-24 08:59:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality18111172760846573784.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/CTLCardinality14869320400910821218.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18111172760846573784.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 352/352 places, 327/327 transitions.
Graph (trivial) has 176 edges and 352 vertex of which 7 / 352 are part of one of the 1 SCC in 16 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 770 edges and 346 vertex of which 345 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 344 transition count 268
Reduce places removed 50 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 52 rules applied. Total rules applied 104 place count 294 transition count 266
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 106 place count 292 transition count 266
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 106 place count 292 transition count 203
Deduced a syphon composed of 63 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 135 rules applied. Total rules applied 241 place count 220 transition count 203
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 269 place count 192 transition count 175
Iterating global reduction 3 with 28 rules applied. Total rules applied 297 place count 192 transition count 175
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 297 place count 192 transition count 174
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 299 place count 191 transition count 174
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 125 rules applied. Total rules applied 424 place count 127 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 426 place count 126 transition count 112
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 432 place count 126 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 433 place count 125 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 434 place count 124 transition count 111
Applied a total of 434 rules in 55 ms. Remains 124 /352 variables (removed 228) and now considering 111/327 (removed 216) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8404839307572212529.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7571756589122872650.kers'
[2026-05-24 09:00:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8404839307572212529.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7571756589122872650.kers]
Normalized transition count is 110 out of 111 initially.
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 0 ms.
// Phase 1: matrix 110 rows 96 cols 442 entries
Finished phase 1 with 60 SingleSign rule and 16 generalized
[2026-05-24 09:00:30] [INFO ] Computed 48 invariants in 1 ms
Computed 48 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7571756589122872650.kers
Total runtime 1 ms.
[2026-05-24 09:00:30] [INFO ] Implicit Places using invariants in 93 ms returned [0, 1, 10, 40, 41, 42, 43, 44, 45]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 94 ms to find 9 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 115/352 places, 111/327 transitions.
Applied a total of 0 rules in 4 ms. Remains 115 /115 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 153 ms. Remains : 115/352 places, 111/327 transitions.
[2026-05-24 09:00:30] [INFO ] Flatten gal took : 3 ms
[2026-05-24 09:00:30] [INFO ] Flatten gal took : 3 ms
[2026-05-24 09:00:30] [INFO ] Input system was already deterministic with 111 transitions.
[2026-05-24 09:00:30] [INFO ] Flatten gal took : 2 ms
[2026-05-24 09:00:30] [INFO ] Flatten gal took : 2 ms
[2026-05-24 09:00:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality13069173824182984898.gal : 1 ms
[2026-05-24 09:00:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality1057929070768948614.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/CTLCardinality13069173824182984898.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1057929070768948614.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(AG((AF(((AG((p69==1)) + (p83==1)) + (p319==1))) + AG((((p358==1)&&((p330==0)||(p360==1)))||((p40==0)&&(p226==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(EG(!(((!(E(TRUE U !((p69==1)))) + (p83==1)) + (p319==1))))) + !(E(TRUE U !((...232
Reverse transition relation is NOT exact ! Due to transitions t7, t21, t22, t25, t26, t27, t28, t53, t54, t55, t56, t57, t67, t91, t92, t94, t95, t96, t97,...272
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,2.88641,90616,1,0,311,548354,219,171,4538,462633,347
FORMULA BusinessProcesses-PT-07-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 327/327 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 321 transition count 296
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 321 transition count 296
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 74 place count 309 transition count 284
Iterating global reduction 0 with 12 rules applied. Total rules applied 86 place count 309 transition count 284
Applied a total of 86 rules in 16 ms. Remains 309 /352 variables (removed 43) and now considering 284/327 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15025085723006872280.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2169205665042996004.kers'
[2026-05-24 09:00:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15025085723006872280.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2169205665042996004.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 284 rows 309 cols 957 entries
Finished phase 1 with 200 SingleSign rule and 48 generalized
[2026-05-24 09:00:33] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2169205665042996004.kers
Total runtime 2 ms.
[2026-05-24 09:00:33] [INFO ] Implicit Places using invariants in 160 ms returned []
[2026-05-24 09:00:33] [INFO ] Invariant cache hit.
[2026-05-24 09:00:33] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2026-05-24 09:00:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 20/101 constraints. Problems are: Problem set: 4 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 20/121 constraints. Problems are: Problem set: 4 solved, 279 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 20/141 constraints. Problems are: Problem set: 4 solved, 279 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 20/161 constraints. Problems are: Problem set: 4 solved, 279 unsolved
Problem TDEAD224 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 20/181 constraints. Problems are: Problem set: 12 solved, 271 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 20/201 constraints. Problems are: Problem set: 12 solved, 271 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 309/593 variables, and 202 constraints, problems are : Problem set: 12 solved, 271 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/309 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 141/141 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 12 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/15 constraints. Problems are: Problem set: 12 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 43/58 constraints. Problems are: Problem set: 12 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 3/61 constraints. Problems are: Problem set: 12 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 141/202 constraints. Problems are: Problem set: 12 solved, 271 unsolved
Problem TDEAD213 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD255 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 20/222 constraints. Problems are: Problem set: 18 solved, 265 unsolved
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 20/242 constraints. Problems are: Problem set: 23 solved, 260 unsolved
Problem TDEAD219 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 20/262 constraints. Problems are: Problem set: 24 solved, 259 unsolved
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 14/276 constraints. Problems are: Problem set: 36 solved, 247 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 5/281 constraints. Problems are: Problem set: 36 solved, 247 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 3/284 constraints. Problems are: Problem set: 36 solved, 247 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/309 variables, 6/290 constraints. Problems are: Problem set: 36 solved, 247 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/309 variables, 2/292 constraints. Problems are: Problem set: 36 solved, 247 unsolved
SMT process timed out in 60106ms, After SMT, problems are : Problem set: 36 solved, 247 unsolved
Search for dead transitions found 36 dead transitions in 60108ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 309/352 places, 248/327 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 306 transition count 248
Applied a total of 3 rules in 4 ms. Remains 306 /309 variables (removed 3) and now considering 248/248 (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-7590177174926373275.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1753441042908219287.kers'
[2026-05-24 09:01:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7590177174926373275.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1753441042908219287.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 306 cols 735 entries
Finished phase 1 with 201 SingleSign rule and 38 generalized
[2026-05-24 09:01:33] [INFO ] Computed 67 invariants in 1 ms
Computed 67 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1753441042908219287.kers
Total runtime 2 ms.
[2026-05-24 09:01:34] [INFO ] Implicit Places using invariants in 198 ms returned []
[2026-05-24 09:01:34] [INFO ] Invariant cache hit.
[2026-05-24 09:01:34] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 306/352 places, 248/327 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61214 ms. Remains : 306/352 places, 248/327 transitions.
[2026-05-24 09:01:34] [INFO ] Flatten gal took : 5 ms
[2026-05-24 09:01:34] [INFO ] Flatten gal took : 7 ms
[2026-05-24 09:01:34] [INFO ] Input system was already deterministic with 248 transitions.
[2026-05-24 09:01:34] [INFO ] Flatten gal took : 3 ms
[2026-05-24 09:01:34] [INFO ] Flatten gal took : 3 ms
[2026-05-24 09:01:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality2357142336442089714.gal : 1 ms
[2026-05-24 09:01:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality2069393872199711609.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/CTLCardinality2357142336442089714.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2069393872199711609.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 09:02:04] [INFO ] Flatten gal took : 4 ms
[2026-05-24 09:02:04] [INFO ] Applying decomposition
[2026-05-24 09:02:04] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14974288384799414514.txt' '-o' '/tmp/graph14974288384799414514.bin' '-w' '/tmp/graph14974288384799414514.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14974288384799414514.bin' '-l' '-1' '-v' '-w' '/tmp/graph14974288384799414514.weights' '-q' '0' '-e' '0.001'
[2026-05-24 09:02:04] [INFO ] Decomposing Gal with order
[2026-05-24 09:02:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 09:02:04] [INFO ] Removed a total of 69 redundant transitions.
[2026-05-24 09:02:04] [INFO ] Flatten gal took : 19 ms
[2026-05-24 09:02:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2026-05-24 09:02:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality999488143178844501.gal : 19 ms
[2026-05-24 09:02:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality16087156743240793516.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/CTLCardinality999488143178844501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16087156743240793516.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,4.64691e+17,2.0551,65696,3475,38,117363,548,709,197453,67,1325,0


Converting to forward existential form...Done !
original formula: E(A(((AF(EX((i14.u105.p373==1))) + E(A(((i5.u21.p67==0)||(i13.u91.p325==1)) U (i16.u76.p249==1)) U EF((i11.u65.p196==1)))) + (AF((i12.i1....375
=> equivalent forward existential formula: [(FwdU(Init,!((E(!(!((EX(((i10.u69.p214==1)||(i13.u79.p268==0))) * !(E(TRUE U !((((i14.u84.p299==0)||(i12.i0.u81...831
Reverse transition relation is NOT exact ! Due to transitions t113, t137, t155, t163, t167, t173, t205, t230, t231, t240, t242, i0.u40.t132, i0.u42.t128, i...849
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 352/352 places, 327/327 transitions.
Graph (trivial) has 174 edges and 352 vertex of which 4 / 352 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 774 edges and 349 vertex of which 348 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 347 transition count 271
Reduce places removed 51 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 296 transition count 270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 295 transition count 270
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 106 place count 295 transition count 207
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 240 place count 224 transition count 207
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 269 place count 195 transition count 178
Iterating global reduction 3 with 29 rules applied. Total rules applied 298 place count 195 transition count 178
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 298 place count 195 transition count 176
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 302 place count 193 transition count 176
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 121 rules applied. Total rules applied 423 place count 131 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 425 place count 130 transition count 116
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 426 place count 129 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 427 place count 128 transition count 115
Applied a total of 427 rules in 54 ms. Remains 128 /352 variables (removed 224) and now considering 115/327 (removed 212) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3642424246789851060.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17198004449413802600.kers'
[2026-05-24 09:02:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3642424246789851060.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17198004449413802600.kers]
Normalized transition count is 114 out of 115 initially.
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 0 ms.
// Phase 1: matrix 114 rows 112 cols 478 entries
Finished phase 1 with 56 SingleSign rule and 23 generalized
[2026-05-24 09:02:34] [INFO ] Computed 49 invariants in 1 ms
Computed 49 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17198004449413802600.kers
Total runtime 2 ms.
[2026-05-24 09:02:34] [INFO ] Implicit Places using invariants in 148 ms returned [42, 43, 44, 45, 46]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 150 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 123/352 places, 115/327 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 209 ms. Remains : 123/352 places, 115/327 transitions.
[2026-05-24 09:02:34] [INFO ] Flatten gal took : 7 ms
[2026-05-24 09:02:34] [INFO ] Flatten gal took : 2 ms
[2026-05-24 09:02:34] [INFO ] Input system was already deterministic with 115 transitions.
[2026-05-24 09:02:34] [INFO ] Flatten gal took : 2 ms
[2026-05-24 09:02:34] [INFO ] Flatten gal took : 12 ms
[2026-05-24 09:02:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality16766725836479408188.gal : 0 ms
[2026-05-24 09:02:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality15002132227882696675.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/CTLCardinality16766725836479408188.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15002132227882696675.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,9.58465e+06,0.850089,35668,2,10057,5,147349,6,0,606,147598,0


Converting to forward existential form...Done !
original formula: EF((EF((!(A((p176==1) U (p83==1))) * AG((p340==1)))) * ((AG(((p272==1)||(p277==1))) + AG(((p44==1)||(p125==0)))) + (p277==0))))
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * E(TRUE U (!(!((E(!((p83==1)) U (!((p176==1)) * !((p83==1)))) + EG(!((p83==1)))))) * !(E(T...578
Reverse transition relation is NOT exact ! Due to transitions t5, t8, t10, t23, t24, t25, t26, t27, t28, t56, t68, t69, t76, t83, t90, t91, t92, t93, t94, ...301
(forward)formula 0,0,3.24599,105524,1,0,198,604004,226,85,4543,331100,236
FORMULA BusinessProcesses-PT-07-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 327/327 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 318 transition count 293
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 318 transition count 293
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 79 place count 307 transition count 282
Iterating global reduction 0 with 11 rules applied. Total rules applied 90 place count 307 transition count 282
Applied a total of 90 rules in 11 ms. Remains 307 /352 variables (removed 45) and now considering 282/327 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14748015689348500666.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5435528632581767726.kers'
[2026-05-24 09:02:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14748015689348500666.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5435528632581767726.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 282 rows 307 cols 953 entries
Finished phase 1 with 198 SingleSign rule and 48 generalized
[2026-05-24 09:02:38] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5435528632581767726.kers
Total runtime 2 ms.
[2026-05-24 09:02:38] [INFO ] Implicit Places using invariants in 140 ms returned []
[2026-05-24 09:02:38] [INFO ] Invariant cache hit.
[2026-05-24 09:02:38] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2026-05-24 09:02:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/307 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 20/101 constraints. Problems are: Problem set: 4 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 20/121 constraints. Problems are: Problem set: 4 solved, 277 unsolved
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 20/141 constraints. Problems are: Problem set: 8 solved, 273 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 20/161 constraints. Problems are: Problem set: 8 solved, 273 unsolved
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD250 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 20/181 constraints. Problems are: Problem set: 11 solved, 270 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 307/589 variables, and 191 constraints, problems are : Problem set: 11 solved, 270 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/307 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 130/130 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 15/15 constraints. Problems are: Problem set: 11 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 0/15 constraints. Problems are: Problem set: 11 solved, 270 unsolved
At refinement iteration 2 (OVERLAPS) 1/307 variables, 43/58 constraints. Problems are: Problem set: 11 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 3/61 constraints. Problems are: Problem set: 11 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 130/191 constraints. Problems are: Problem set: 11 solved, 270 unsolved
Problem TDEAD222 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 20/211 constraints. Problems are: Problem set: 13 solved, 268 unsolved
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 20/231 constraints. Problems are: Problem set: 16 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 20/251 constraints. Problems are: Problem set: 16 solved, 265 unsolved
Problem TDEAD212 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD254 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 20/271 constraints. Problems are: Problem set: 24 solved, 257 unsolved
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 20/291 constraints. Problems are: Problem set: 28 solved, 253 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 20/311 constraints. Problems are: Problem set: 28 solved, 253 unsolved
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD237 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/307 variables, 20/331 constraints. Problems are: Problem set: 31 solved, 250 unsolved
Problem TDEAD229 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/307 variables, 17/348 constraints. Problems are: Problem set: 36 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 307/589 variables, and 348 constraints, problems are : Problem set: 36 solved, 245 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/307 constraints, PredecessorRefiner: 0/281 constraints, Known Traps: 287/287 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60045ms problems are : Problem set: 36 solved, 245 unsolved
Search for dead transitions found 36 dead transitions in 60047ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 307/352 places, 246/327 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 304 transition count 246
Applied a total of 3 rules in 7 ms. Remains 304 /307 variables (removed 3) and now considering 246/246 (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-14327331311052403480.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12473475963870648807.kers'
[2026-05-24 09:03:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14327331311052403480.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12473475963870648807.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 304 cols 731 entries
Finished phase 1 with 199 SingleSign rule and 38 generalized
[2026-05-24 09:03:38] [INFO ] Computed 67 invariants in 5 ms
Computed 67 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-12473475963870648807.kers
Total runtime 6 ms.
[2026-05-24 09:03:38] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-05-24 09:03:38] [INFO ] Invariant cache hit.
[2026-05-24 09:03:39] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 304/352 places, 246/327 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61044 ms. Remains : 304/352 places, 246/327 transitions.
[2026-05-24 09:03:39] [INFO ] Flatten gal took : 6 ms
[2026-05-24 09:03:39] [INFO ] Flatten gal took : 5 ms
[2026-05-24 09:03:39] [INFO ] Input system was already deterministic with 246 transitions.
[2026-05-24 09:03:39] [INFO ] Flatten gal took : 3 ms
[2026-05-24 09:03:39] [INFO ] Flatten gal took : 3 ms
[2026-05-24 09:03:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality158715143374487100.gal : 1 ms
[2026-05-24 09:03:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality5870768731386751269.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/CTLCardinality158715143374487100.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5870768731386751269.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.
Detected timeout of ITS tools.
[2026-05-24 09:04:09] [INFO ] Flatten gal took : 3 ms
[2026-05-24 09:04:09] [INFO ] Applying decomposition
[2026-05-24 09:04:09] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2337856862360979789.txt' '-o' '/tmp/graph2337856862360979789.bin' '-w' '/tmp/graph2337856862360979789.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2337856862360979789.bin' '-l' '-1' '-v' '-w' '/tmp/graph2337856862360979789.weights' '-q' '0' '-e' '0.001'
[2026-05-24 09:04:09] [INFO ] Decomposing Gal with order
[2026-05-24 09:04:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 09:04:09] [INFO ] Removed a total of 63 redundant transitions.
[2026-05-24 09:04:09] [INFO ] Flatten gal took : 11 ms
[2026-05-24 09:04:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2026-05-24 09:04:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality8868426347008638951.gal : 2 ms
[2026-05-24 09:04:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality17626050215876504435.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/CTLCardinality8868426347008638951.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17626050215876504435.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,4.41137e+17,11.0531,318876,20425,43,623648,559,686,866831,61,1741,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 327/327 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 325 transition count 300
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 325 transition count 300
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 64 place count 315 transition count 290
Iterating global reduction 0 with 10 rules applied. Total rules applied 74 place count 315 transition count 290
Applied a total of 74 rules in 17 ms. Remains 315 /352 variables (removed 37) and now considering 290/327 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16523011518285116320.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12494517018616226642.kers'
[2026-05-24 09:04:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16523011518285116320.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12494517018616226642.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 315 cols 969 entries
Finished phase 1 with 206 SingleSign rule and 48 generalized
[2026-05-24 09:04:39] [INFO ] Computed 61 invariants in 3 ms
Computed 61 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12494517018616226642.kers
Total runtime 4 ms.
[2026-05-24 09:04:39] [INFO ] Implicit Places using invariants in 173 ms returned []
[2026-05-24 09:04:39] [INFO ] Invariant cache hit.
[2026-05-24 09:04:39] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2026-05-24 09:04:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (OVERLAPS) 1/315 variables, 42/58 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Problem TDEAD225 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD270 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 20/101 constraints. Problems are: Problem set: 7 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 20/121 constraints. Problems are: Problem set: 7 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 20/141 constraints. Problems are: Problem set: 7 solved, 282 unsolved
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 20/161 constraints. Problems are: Problem set: 17 solved, 272 unsolved
Problem TDEAD231 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 20/181 constraints. Problems are: Problem set: 20 solved, 269 unsolved
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD261 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 20/201 constraints. Problems are: Problem set: 24 solved, 265 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 315/605 variables, and 208 constraints, problems are : Problem set: 24 solved, 265 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/315 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 147/147 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 16/16 constraints. Problems are: Problem set: 24 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 0/16 constraints. Problems are: Problem set: 24 solved, 265 unsolved
At refinement iteration 2 (OVERLAPS) 1/315 variables, 42/58 constraints. Problems are: Problem set: 24 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 3/61 constraints. Problems are: Problem set: 24 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 147/208 constraints. Problems are: Problem set: 24 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 20/228 constraints. Problems are: Problem set: 24 solved, 265 unsolved
Problem TDEAD224 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 20/248 constraints. Problems are: Problem set: 25 solved, 264 unsolved
Problem TDEAD252 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 20/268 constraints. Problems are: Problem set: 30 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 20/288 constraints. Problems are: Problem set: 30 solved, 259 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 20/308 constraints. Problems are: Problem set: 30 solved, 259 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 20/328 constraints. Problems are: Problem set: 30 solved, 259 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/315 variables, 20/348 constraints. Problems are: Problem set: 30 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 315/605 variables, and 358 constraints, problems are : Problem set: 30 solved, 259 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/315 constraints, PredecessorRefiner: 0/289 constraints, Known Traps: 297/297 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60050ms problems are : Problem set: 30 solved, 259 unsolved
Search for dead transitions found 30 dead transitions in 60052ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 315/352 places, 260/327 transitions.
Applied a total of 0 rules in 16 ms. Remains 315 /315 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60603 ms. Remains : 315/352 places, 260/327 transitions.
[2026-05-24 09:05:39] [INFO ] Flatten gal took : 4 ms
[2026-05-24 09:05:39] [INFO ] Flatten gal took : 3 ms
[2026-05-24 09:05:40] [INFO ] Input system was already deterministic with 260 transitions.
[2026-05-24 09:05:40] [INFO ] Flatten gal took : 3 ms
[2026-05-24 09:05:40] [INFO ] Flatten gal took : 4 ms
[2026-05-24 09:05:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality1090694957925356807.gal : 2 ms
[2026-05-24 09:05:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality3296239810595388917.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/CTLCardinality1090694957925356807.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3296239810595388917.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 09:06:10] [INFO ] Flatten gal took : 9 ms
[2026-05-24 09:06:10] [INFO ] Applying decomposition
[2026-05-24 09:06:10] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3331675698273497069.txt' '-o' '/tmp/graph3331675698273497069.bin' '-w' '/tmp/graph3331675698273497069.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3331675698273497069.bin' '-l' '-1' '-v' '-w' '/tmp/graph3331675698273497069.weights' '-q' '0' '-e' '0.001'
[2026-05-24 09:06:10] [INFO ] Decomposing Gal with order
[2026-05-24 09:06:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 09:06:10] [INFO ] Removed a total of 92 redundant transitions.
[2026-05-24 09:06:10] [INFO ] Flatten gal took : 13 ms
[2026-05-24 09:06:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2026-05-24 09:06:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality10669935506368816705.gal : 3 ms
[2026-05-24 09:06:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality10711143238502049987.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/CTLCardinality10669935506368816705.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10711143238502049987.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,5.34399e+17,5.64352,127680,4398,46,194877,440,831,381080,58,1326,0


Converting to forward existential form...Done !
original formula: (EF((AG(E(A(((i4.u12.p35==0)||(i13.i0.u103.p356==1)) U ((i13.i0.u83.p279==0)||(i1.i1.u18.p50==1))) U A((i13.i0.u83.p342==1) U (i0.u98.p33...619
=> equivalent forward existential formula: (((([((FwdU((FwdU((Init * !(E(TRUE U (!(E(TRUE U !(E(!((E(!(((i13.i0.u83.p279==0)||(i1.i1.u18.p50==1))) U (!(((i...4960
Reverse transition relation is NOT exact ! Due to transitions t2, t7, t116, t140, t159, t169, t173, t185, t211, t215, t242, t245, t252, t253, t254, i0.u44....963
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 352/352 places, 327/327 transitions.
Graph (trivial) has 181 edges and 352 vertex of which 7 / 352 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 770 edges and 346 vertex of which 345 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 344 transition count 264
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 290 transition count 264
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 110 place count 290 transition count 201
Deduced a syphon composed of 63 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 135 rules applied. Total rules applied 245 place count 218 transition count 201
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 275 place count 188 transition count 171
Iterating global reduction 2 with 30 rules applied. Total rules applied 305 place count 188 transition count 171
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 305 place count 188 transition count 169
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 309 place count 186 transition count 169
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 129 rules applied. Total rules applied 438 place count 120 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 440 place count 119 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 441 place count 118 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 442 place count 117 transition count 104
Applied a total of 442 rules in 28 ms. Remains 117 /352 variables (removed 235) and now considering 104/327 (removed 223) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4686301368145562664.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18254979408203808053.kers'
[2026-05-24 09:06:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4686301368145562664.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18254979408203808053.kers]
Normalized transition count is 103 out of 104 initially.
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 103 rows 90 cols 418 entries
Finished phase 1 with 57 SingleSign rule and 12 generalized
[2026-05-24 09:06:40] [INFO ] Computed 48 invariants in 1 ms
Computed 48 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18254979408203808053.kers
Total runtime 2 ms.
[2026-05-24 09:06:40] [INFO ] Implicit Places using invariants in 98 ms returned [0, 1, 9, 35, 36, 37, 38, 39, 40]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 100 ms to find 9 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 108/352 places, 104/327 transitions.
Applied a total of 0 rules in 16 ms. Remains 108 /108 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 144 ms. Remains : 108/352 places, 104/327 transitions.
[2026-05-24 09:06:40] [INFO ] Flatten gal took : 6 ms
[2026-05-24 09:06:40] [INFO ] Flatten gal took : 2 ms
[2026-05-24 09:06:40] [INFO ] Input system was already deterministic with 104 transitions.
[2026-05-24 09:06:40] [INFO ] Flatten gal took : 2 ms
[2026-05-24 09:06:40] [INFO ] Flatten gal took : 2 ms
[2026-05-24 09:06:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality13225954083553446037.gal : 1 ms
[2026-05-24 09:06:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality10784794651822843306.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/CTLCardinality13225954083553446037.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10784794651822843306.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,2.74772e+06,0.581617,27684,2,3549,5,152883,6,0,536,66823,0


Converting to forward existential form...Done !
original formula: AG(EF((p223!=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p223!=1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t16, t17, t18, t19, t20, t44, t45, t46, t47, t48, t60, t75, t76, t90, t91, t93, t94,...282
(forward)formula 0,1,1.59252,50140,1,0,155,300532,192,64,4029,160134,184
FORMULA BusinessProcesses-PT-07-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 352/352 places, 327/327 transitions.
Graph (trivial) has 181 edges and 352 vertex of which 7 / 352 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 770 edges and 346 vertex of which 345 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 345 transition count 264
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 112 place count 290 transition count 264
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 112 place count 290 transition count 202
Deduced a syphon composed of 62 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 133 rules applied. Total rules applied 245 place count 219 transition count 202
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 276 place count 188 transition count 171
Iterating global reduction 2 with 31 rules applied. Total rules applied 307 place count 188 transition count 171
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 307 place count 188 transition count 169
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 311 place count 186 transition count 169
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 131 rules applied. Total rules applied 442 place count 119 transition count 105
Applied a total of 442 rules in 28 ms. Remains 119 /352 variables (removed 233) and now considering 105/327 (removed 222) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13167830919853129618.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15097883911044711677.kers'
[2026-05-24 09:06:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13167830919853129618.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15097883911044711677.kers]
Normalized transition count is 104 out of 105 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 104 rows 118 cols 552 entries
Finished phase 1 with 34 SingleSign rule and 36 generalized
[2026-05-24 09:06:42] [INFO ] Computed 49 invariants in 0 ms
Computed 49 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15097883911044711677.kers
Total runtime 1 ms.
[2026-05-24 09:06:42] [INFO ] Implicit Places using invariants in 124 ms returned [1, 2, 11, 37, 38, 39, 40, 41, 42, 43]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 124 ms to find 10 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 109/352 places, 105/327 transitions.
Applied a total of 0 rules in 3 ms. Remains 109 /109 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 155 ms. Remains : 109/352 places, 105/327 transitions.
[2026-05-24 09:06:42] [INFO ] Flatten gal took : 3 ms
[2026-05-24 09:06:42] [INFO ] Flatten gal took : 3 ms
[2026-05-24 09:06:42] [INFO ] Input system was already deterministic with 105 transitions.
[2026-05-24 09:06:42] [INFO ] Flatten gal took : 2 ms
[2026-05-24 09:06:42] [INFO ] Flatten gal took : 2 ms
[2026-05-24 09:06:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality3552582300657843718.gal : 1 ms
[2026-05-24 09:06:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality16529077417222521665.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/CTLCardinality3552582300657843718.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16529077417222521665.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,4.0873e+06,0.276767,16244,2,2782,5,78123,6,0,542,37284,0


Converting to forward existential form...Done !
original formula: EG(EF(!(E(AG(((p373==0)||(p0==1))) U (p45!=1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(!(E(TRUE U !(((p373==0)||(p0==1))))) U (p45!=1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t17, t18, t19, t20, t44, t45, t46, t47, t48, t60, t70, t71, t85, t86, t88, t89, t90, t91, t92...262
(forward)formula 0,1,2.77482,99864,1,0,607,612666,205,370,4262,493955,516
FORMULA BusinessProcesses-PT-07-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 327/327 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 318 transition count 293
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 318 transition count 293
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 81 place count 305 transition count 280
Iterating global reduction 0 with 13 rules applied. Total rules applied 94 place count 305 transition count 280
Applied a total of 94 rules in 19 ms. Remains 305 /352 variables (removed 47) and now considering 280/327 (removed 47) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13254021177749943542.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3186153852098666987.kers'
[2026-05-24 09:06:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13254021177749943542.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3186153852098666987.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 280 rows 305 cols 949 entries
Finished phase 1 with 196 SingleSign rule and 48 generalized
[2026-05-24 09:06:44] [INFO ] Computed 61 invariants in 2 ms
Computed 61 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3186153852098666987.kers
Total runtime 3 ms.
[2026-05-24 09:06:45] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-24 09:06:45] [INFO ] Invariant cache hit.
[2026-05-24 09:06:45] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
Running 279 sub problems to find dead transitions.
[2026-05-24 09:06:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (OVERLAPS) 1/305 variables, 43/57 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 20/101 constraints. Problems are: Problem set: 7 solved, 272 unsolved
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 20/121 constraints. Problems are: Problem set: 21 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 20/141 constraints. Problems are: Problem set: 21 solved, 258 unsolved
Problem TDEAD219 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 20/161 constraints. Problems are: Problem set: 22 solved, 257 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 20/181 constraints. Problems are: Problem set: 22 solved, 257 unsolved
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD259 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 20/201 constraints. Problems are: Problem set: 29 solved, 250 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/305 variables, 20/221 constraints. Problems are: Problem set: 29 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/585 variables, and 221 constraints, problems are : Problem set: 29 solved, 250 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/305 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 160/160 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 29 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 14/14 constraints. Problems are: Problem set: 29 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 0/14 constraints. Problems are: Problem set: 29 solved, 250 unsolved
At refinement iteration 2 (OVERLAPS) 1/305 variables, 43/57 constraints. Problems are: Problem set: 29 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 4/61 constraints. Problems are: Problem set: 29 solved, 250 unsolved
Problem TDEAD227 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 160/221 constraints. Problems are: Problem set: 36 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 18/239 constraints. Problems are: Problem set: 36 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 15/254 constraints. Problems are: Problem set: 36 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 11/265 constraints. Problems are: Problem set: 36 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 12/277 constraints. Problems are: Problem set: 36 solved, 243 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 10/287 constraints. Problems are: Problem set: 36 solved, 243 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 0/287 constraints. Problems are: Problem set: 36 solved, 243 unsolved
At refinement iteration 11 (OVERLAPS) 280/585 variables, 305/592 constraints. Problems are: Problem set: 36 solved, 243 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/585 variables, 243/835 constraints. Problems are: Problem set: 36 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 585/585 variables, and 840 constraints, problems are : Problem set: 36 solved, 243 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 243/279 constraints, Known Traps: 231/231 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60055ms problems are : Problem set: 36 solved, 243 unsolved
Search for dead transitions found 36 dead transitions in 60057ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 305/352 places, 244/327 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 302 transition count 244
Applied a total of 3 rules in 6 ms. Remains 302 /305 variables (removed 3) and now considering 244/244 (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-6593708107371167594.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9304320576869559743.kers'
[2026-05-24 09:07:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6593708107371167594.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9304320576869559743.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 244 rows 302 cols 727 entries
Finished phase 1 with 197 SingleSign rule and 38 generalized
[2026-05-24 09:07:45] [INFO ] Computed 67 invariants in 2 ms
Computed 67 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9304320576869559743.kers
Total runtime 3 ms.
[2026-05-24 09:07:45] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-24 09:07:45] [INFO ] Invariant cache hit.
[2026-05-24 09:07:45] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 302/352 places, 244/327 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61007 ms. Remains : 302/352 places, 244/327 transitions.
[2026-05-24 09:07:45] [INFO ] Flatten gal took : 5 ms
[2026-05-24 09:07:45] [INFO ] Flatten gal took : 4 ms
[2026-05-24 09:07:45] [INFO ] Input system was already deterministic with 244 transitions.
[2026-05-24 09:07:45] [INFO ] Flatten gal took : 3 ms
[2026-05-24 09:07:45] [INFO ] Flatten gal took : 3 ms
[2026-05-24 09:07:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality6759846315907039665.gal : 1 ms
[2026-05-24 09:07:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality13909292472551693974.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/CTLCardinality6759846315907039665.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13909292472551693974.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 09:08:16] [INFO ] Flatten gal took : 8 ms
[2026-05-24 09:08:16] [INFO ] Applying decomposition
[2026-05-24 09:08:16] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1157129013440485926.txt' '-o' '/tmp/graph1157129013440485926.bin' '-w' '/tmp/graph1157129013440485926.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1157129013440485926.bin' '-l' '-1' '-v' '-w' '/tmp/graph1157129013440485926.weights' '-q' '0' '-e' '0.001'
[2026-05-24 09:08:16] [INFO ] Decomposing Gal with order
[2026-05-24 09:08:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 09:08:16] [INFO ] Removed a total of 67 redundant transitions.
[2026-05-24 09:08:16] [INFO ] Flatten gal took : 18 ms
[2026-05-24 09:08:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2026-05-24 09:08:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality241862894229909367.gal : 2 ms
[2026-05-24 09:08:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality5936274970863591296.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/CTLCardinality241862894229909367.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5936274970863591296.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 09:08:46] [INFO ] Flatten gal took : 5 ms
[2026-05-24 09:08:46] [INFO ] Flatten gal took : 5 ms
[2026-05-24 09:08:46] [INFO ] Applying decomposition
[2026-05-24 09:08:46] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5067033677128468404.txt' '-o' '/tmp/graph5067033677128468404.bin' '-w' '/tmp/graph5067033677128468404.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5067033677128468404.bin' '-l' '-1' '-v' '-w' '/tmp/graph5067033677128468404.weights' '-q' '0' '-e' '0.001'
[2026-05-24 09:08:46] [INFO ] Decomposing Gal with order
[2026-05-24 09:08:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 09:08:46] [INFO ] Removed a total of 230 redundant transitions.
[2026-05-24 09:08:46] [INFO ] Flatten gal took : 11 ms
[2026-05-24 09:08:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-24 09:08:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality6403864620139466213.gal : 3 ms
[2026-05-24 09:08:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality16797779326011057240.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/CTLCardinality6403864620139466213.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16797779326011057240.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 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.27676e+17,16.0662,338492,18218,52,567118,547,977,1.05493e+06,67,1925,0


Converting to forward existential form...Done !
original formula: EX(E((!(AG((((i12.u129.p367==1)||(i1.u11.p33==0))||(i5.i0.u56.p150==1)))) + EG(!(AF((i16.i0.u112.p380==1))))) U E((E(((i7.i0.u9.p23==0)||...296
=> equivalent forward existential formula: [FwdG((FwdU(FwdU(EY(Init),(!(!(E(TRUE U !((((i12.u129.p367==1)||(i1.u11.p33==0))||(i5.i0.u56.p150==1)))))) + EG(...365
Reverse transition relation is NOT exact ! Due to transitions t5, t7, t8, t9, t10, t28, t167, t170, t180, t210, t216, t248, i0.t206, i0.u18.t209, i0.u46.t1...1190
ITS-tools command line returned an error code 139
[2026-05-24 09:15:41] [INFO ] Applying decomposition
[2026-05-24 09:15:41] [INFO ] Flatten gal took : 5 ms
[2026-05-24 09:15:41] [INFO ] Decomposing Gal with order
[2026-05-24 09:15:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 09:15:41] [INFO ] Removed a total of 123 redundant transitions.
[2026-05-24 09:15:41] [INFO ] Flatten gal took : 10 ms
[2026-05-24 09:15:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-24 09:15:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality693803775537858353.gal : 5 ms
[2026-05-24 09:15:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality1636126626630920972.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/CTLCardinality693803775537858353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1636126626630920972.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 09:42:40] [INFO ] Flatten gal took : 7196 ms
[2026-05-24 09:42:40] [INFO ] Input system was already deterministic with 327 transitions.
[2026-05-24 09:42:41] [INFO ] Transformed 352 places.
[2026-05-24 09:42:41] [INFO ] Transformed 327 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-24 09:43:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality15599482752694385558.gal : 6 ms
[2026-05-24 09:43:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality6518799734140167228.ctl : 4 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/CTLCardinality15599482752694385558.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6518799734140167228.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ 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="BusinessProcesses-PT-07"
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 BusinessProcesses-PT-07, 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 r034-tall-177946842000497"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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