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.r098-tall-177955695500281.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 DiscoveryGPU-PT-09a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695500281
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.9K Mar 6 16:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 6 16:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 6 16:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 6 16:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 09:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 6 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Mar 6 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 6 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Mar 6 16:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 32K 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 DiscoveryGPU-PT-09a-CTLCardinality-2024-00
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2024-01
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2024-02
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2024-03
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2024-04
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2024-05
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2024-06
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2024-07
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2024-08
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2024-09
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2024-10
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2024-11
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2024-12
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2024-13
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2024-14
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779597716036

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-09a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-24 04:41:57] [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 04:41:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 04:41:57] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2026-05-24 04:41:57] [INFO ] Transformed 93 places.
[2026-05-24 04:41:57] [INFO ] Transformed 127 transitions.
[2026-05-24 04:41:57] [INFO ] Found NUPN structural information;
[2026-05-24 04:41:57] [INFO ] Parsed PT model containing 93 places and 127 transitions and 408 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Support contains 71 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 127/127 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 91 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 91 transition count 125
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 13 place count 91 transition count 116
Applied a total of 13 rules in 24 ms. Remains 91 /93 variables (removed 2) and now considering 116/127 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7390016526568723730.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2947684196928990515.kers'
[2026-05-24 04:41:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7390016526568723730.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2947684196928990515.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 116 rows 89 cols 224 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-24 04:41:57] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2947684196928990515.kers
Total runtime 3 ms.
[2026-05-24 04:41:57] [INFO ] Implicit Places using invariants in 300 ms returned []
[2026-05-24 04:41:57] [INFO ] Invariant cache hit.
[2026-05-24 04:41:57] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-24 04:41:57] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2026-05-24 04:41:57] [INFO ] Invariant cache hit.
[2026-05-24 04:41:57] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 116/207 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 72/165 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 0/207 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 165 constraints, problems are : Problem set: 0 solved, 115 unsolved in 3500 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 116/207 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 72/165 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 115/280 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/207 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 280 constraints, problems are : Problem set: 0 solved, 115 unsolved in 7310 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10868ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 10882ms
Starting structural reductions in LTL mode, iteration 1 : 91/93 places, 116/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11393 ms. Remains : 91/93 places, 116/127 transitions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2026-05-24 04:42:08] [INFO ] Invariant cache hit.
[2026-05-24 04:42:08] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-24 04:42:08] [INFO ] Invariant cache hit.
[2026-05-24 04:42:08] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-24 04:42:08] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 91/91 places, 116/116 transitions.
Support contains 71 out of 91 places after structural reductions.
[2026-05-24 04:42:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-24 04:42:09] [INFO ] Flatten gal took : 23 ms
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 04:42:09] [INFO ] Flatten gal took : 9 ms
[2026-05-24 04:42:09] [INFO ] Input system was already deterministic with 116 transitions.
Support contains 70 out of 91 places (down from 71) after GAL structural reductions.
RANDOM walk for 40000 steps (412 resets) in 846 ms. (47 steps per ms) remains 3/52 properties
BEST_FIRST walk for 40004 steps (49 resets) in 251 ms. (158 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (47 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (44 resets) in 72 ms. (547 steps per ms) remains 3/3 properties
[2026-05-24 04:42:09] [INFO ] Invariant cache hit.
[2026-05-24 04:42:09] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 13/23 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp38 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 9/21 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 41/64 variables, 17/38 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 16/54 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 8 (OVERLAPS) 25/89 variables, 12/66 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 7/73 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/73 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/103 variables, 7/80 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/103 variables, 7/87 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/103 variables, 0/87 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/119 variables, 7/94 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/119 variables, 7/101 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/119 variables, 0/101 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 21/140 variables, 7/108 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/140 variables, 7/115 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/140 variables, 0/115 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 19/159 variables, 7/122 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/159 variables, 7/129 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/159 variables, 0/129 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 14/173 variables, 7/136 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/173 variables, 5/141 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/173 variables, 0/141 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 14/187 variables, 7/148 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/187 variables, 2/150 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/187 variables, 0/150 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 14/201 variables, 7/157 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/201 variables, 5/162 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/201 variables, 0/162 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 6/207 variables, 3/165 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/207 variables, 0/165 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 0/207 variables, 0/165 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 165 constraints, problems are : Problem set: 2 solved, 1 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem AtomicPropp29 is UNSAT
After SMT solving in domain Int declared 6/207 variables, and 6 constraints, problems are : Problem set: 3 solved, 0 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/91 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 127ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
[2026-05-24 04:42:09] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:42:09] [INFO ] Flatten gal took : 7 ms
[2026-05-24 04:42:09] [INFO ] Input system was already deterministic with 116 transitions.
Computed a total of 12 stabilizing places and 10 stable transitions
Graph (complete) has 254 edges and 91 vertex of which 84 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 85 transition count 110
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 85 transition count 110
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 80 transition count 105
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 80 transition count 105
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 77 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 77 transition count 102
Applied a total of 28 rules in 7 ms. Remains 77 /91 variables (removed 14) and now considering 102/116 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18057360052833230912.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15941207788051909346.kers'
[2026-05-24 04:42:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18057360052833230912.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15941207788051909346.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 102 rows 75 cols 201 entries
Finished phase 1 with 75 SingleSign rule and 0 generalized
[2026-05-24 04:42:09] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15941207788051909346.kers
Total runtime 0 ms.
[2026-05-24 04:42:09] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-24 04:42:09] [INFO ] Invariant cache hit.
[2026-05-24 04:42:09] [INFO ] State equation strengthened by 67 read => feed constraints.
[2026-05-24 04:42:09] [INFO ] Implicit Places using invariants and state equation in 87 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 126 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/91 places, 102/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 136 ms. Remains : 76/91 places, 102/116 transitions.
[2026-05-24 04:42:09] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:42:09] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:42:09] [INFO ] Input system was already deterministic with 102 transitions.
[2026-05-24 04:42:09] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:42:09] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:42:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality13312751160559311602.gal : 2 ms
[2026-05-24 04:42:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality2076253961328165286.ctl : 2 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/CTLCardinality13312751160559311602.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2076253961328165286.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.4042e+09,0.407899,19768,2,5218,5,99095,6,0,395,63440,0


Converting to forward existential form...Done !
original formula: E((AF(!((A(((p23==0)||(p66==1)) U ((p47==0)||(p31==1))) + (p75==0)))) * (((p67==0)||(p37==1))||((p77==0)||(p26==1)))) U EF(!(EF(((((p52==...210
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(!(EG(!(!((!((E(!(((p47==0)||(p31==1))) U (!(((p23==0)||(p66==1))) * !(((p47==0)||(p31==1))))) ...350
Reverse transition relation is NOT exact ! Due to transitions t16, t21, t27, t29, t32, t34, t40, t79, t83, t88, t91, t92, t93, t94, t95, t96, t97, t98, t99...268
(forward)formula 0,0,3.64017,118688,1,0,155,578111,227,98,2343,670111,223
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 84 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 84 transition count 109
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 77 transition count 102
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 77 transition count 102
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 71 transition count 96
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 71 transition count 96
Applied a total of 40 rules in 18 ms. Remains 71 /91 variables (removed 20) and now considering 96/116 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16826301505547824318.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16222695180818876234.kers'
[2026-05-24 04:42:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16826301505547824318.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16222695180818876234.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 96 rows 69 cols 190 entries
Finished phase 1 with 69 SingleSign rule and 0 generalized
[2026-05-24 04:42:14] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16222695180818876234.kers
Total runtime 0 ms.
[2026-05-24 04:42:14] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-24 04:42:14] [INFO ] Invariant cache hit.
[2026-05-24 04:42:15] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-24 04:42:15] [INFO ] Implicit Places using invariants and state equation in 91 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 133 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/91 places, 96/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 152 ms. Remains : 70/91 places, 96/116 transitions.
[2026-05-24 04:42:15] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:42:15] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:42:15] [INFO ] Input system was already deterministic with 96 transitions.
[2026-05-24 04:42:15] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:42:15] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:42:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality9998659756902696698.gal : 2 ms
[2026-05-24 04:42:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality17897819318562180227.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/CTLCardinality9998659756902696698.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17897819318562180227.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,9.67311e+08,1.37661,52728,2,14736,5,281244,6,0,366,198776,0


Converting to forward existential form...Done !
original formula: AG(AX(E(!(((p87!=1) * EG((p46==0)))) U ((((p62==1)||(p84==0))||((p75==1)||(p45==0)))||(p10==1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(!(((p87!=1) * EG((p46==0)))) U ((((p62==1)||(p84==0))||((p75==1)||(p45==0)))||(p10==...170
Reverse transition relation is NOT exact ! Due to transitions t22, t26, t28, t29, t31, t33, t35, t37, t77, t80, t86, t87, t88, t89, t90, t91, t92, t93, t94...260
(forward)formula 0,0,29.311,840220,1,0,544,4.39458e+06,219,293,2173,6.19458e+06,658
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 84 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 84 transition count 109
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 79 transition count 104
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 79 transition count 104
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 76 transition count 101
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 76 transition count 101
Applied a total of 30 rules in 7 ms. Remains 76 /91 variables (removed 15) and now considering 101/116 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11762310049190471197.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15280582897405474718.kers'
[2026-05-24 04:42:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11762310049190471197.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15280582897405474718.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 101 rows 74 cols 199 entries
Finished phase 1 with 74 SingleSign rule and 0 generalized
[2026-05-24 04:42:44] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15280582897405474718.kers
Total runtime 0 ms.
[2026-05-24 04:42:44] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-24 04:42:44] [INFO ] Invariant cache hit.
[2026-05-24 04:42:44] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-24 04:42:44] [INFO ] Implicit Places using invariants and state equation in 96 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 153 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/91 places, 101/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 162 ms. Remains : 75/91 places, 101/116 transitions.
[2026-05-24 04:42:44] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:42:44] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:42:44] [INFO ] Input system was already deterministic with 101 transitions.
[2026-05-24 04:42:44] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:42:44] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:42:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality6594060857345073855.gal : 1 ms
[2026-05-24 04:42:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality4805909954167383945.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/CTLCardinality6594060857345073855.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4805909954167383945.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.33016e+09,1.41791,53712,2,16818,5,283546,6,0,390,217769,0


Converting to forward existential form...Done !
original formula: AG(EX((EF(((p23==0)&&(p72==1))) + ((((p27==0)&&(p36==1))||((p21==0)&&(p75==1)))&&(((p33==0)||(p53==1))||(p24==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((E(TRUE U ((p23==0)&&(p72==1))) + ((((p27==0)&&(p36==1))||((p21==0)&&(p75==1)))&&(((p33...195
Reverse transition relation is NOT exact ! Due to transitions t8, t13, t21, t25, t27, t29, t32, t34, t83, t88, t90, t91, t92, t93, t94, t95, t96, t97, t98,...266
(forward)formula 0,0,10.5614,307972,1,0,152,1.45368e+06,224,96,2328,2.05453e+06,217
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Graph (complete) has 254 edges and 91 vertex of which 84 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 90 edges and 81 vertex of which 63 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Graph (trivial) has 66 edges and 63 vertex of which 32 / 63 are part of one of the 16 SCC in 2 ms
Free SCC test removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 47 transition count 81
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 39 place count 38 transition count 65
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 47 place count 30 transition count 49
Iterating global reduction 2 with 8 rules applied. Total rules applied 55 place count 30 transition count 49
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 61 place count 24 transition count 37
Iterating global reduction 2 with 6 rules applied. Total rules applied 67 place count 24 transition count 37
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 73 place count 18 transition count 25
Iterating global reduction 2 with 6 rules applied. Total rules applied 79 place count 18 transition count 25
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 85 place count 12 transition count 19
Iterating global reduction 2 with 6 rules applied. Total rules applied 91 place count 12 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 12 transition count 18
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 93 place count 12 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 11 transition count 17
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 97 place count 8 transition count 14
Applied a total of 97 rules in 32 ms. Remains 8 /91 variables (removed 83) and now considering 14/116 (removed 102) transitions.
[2026-05-24 04:42:55] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9669168136601198204.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12686956577842316734.kers'
[2026-05-24 04:42:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9669168136601198204.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12686956577842316734.kers]
Normalized transition count is 10 out of 11 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 8 cols 17 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-24 04:42:55] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12686956577842316734.kers
Total runtime 0 ms.
[2026-05-24 04:42:55] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-24 04:42:55] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2026-05-24 04:42:55] [INFO ] Invariant cache hit.
[2026-05-24 04:42:55] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2026-05-24 04:42:55] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2026-05-24 04:42:55] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2026-05-24 04:42:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 3/18 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/19 variables, and 8 constraints, problems are : Problem set: 0 solved, 8 unsolved in 114 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 3/18 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/19 variables, and 16 constraints, problems are : Problem set: 0 solved, 8 unsolved in 84 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 200ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 200ms
Starting structural reductions in SI_CTL mode, iteration 1 : 8/91 places, 14/116 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 276 ms. Remains : 8/91 places, 14/116 transitions.
[2026-05-24 04:42:55] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:42:55] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:42:55] [INFO ] Input system was already deterministic with 14 transitions.
[2026-05-24 04:42:55] [INFO ] Flatten gal took : 0 ms
[2026-05-24 04:42:55] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:42:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality8830449853852682471.gal : 0 ms
[2026-05-24 04:42:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality1352335011791784751.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/CTLCardinality8830449853852682471.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1352335011791784751.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,576,0.003475,3784,2,20,5,117,6,0,39,108,0


Converting to forward existential form...Done !
original formula: AG(EF(((p65==0)||(p35==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p65==0)||(p35==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...171
(forward)formula 0,1,0.006375,4060,1,0,28,409,45,14,209,430,34
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 84 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 84 transition count 109
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 79 transition count 104
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 79 transition count 104
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 74 transition count 99
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 74 transition count 99
Applied a total of 34 rules in 15 ms. Remains 74 /91 variables (removed 17) and now considering 99/116 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17590173558641161274.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2102548833512333847.kers'
[2026-05-24 04:42:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17590173558641161274.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2102548833512333847.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 99 rows 72 cols 195 entries
Finished phase 1 with 72 SingleSign rule and 0 generalized
[2026-05-24 04:42:55] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2102548833512333847.kers
Total runtime 0 ms.
[2026-05-24 04:42:55] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-24 04:42:55] [INFO ] Invariant cache hit.
[2026-05-24 04:42:55] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-24 04:42:55] [INFO ] Implicit Places using invariants and state equation in 86 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 133 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/91 places, 99/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 151 ms. Remains : 73/91 places, 99/116 transitions.
[2026-05-24 04:42:55] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:42:55] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:42:55] [INFO ] Input system was already deterministic with 99 transitions.
[2026-05-24 04:42:55] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:42:55] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:42:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality2324374439486778361.gal : 1 ms
[2026-05-24 04:42:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality9358774016671017446.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/CTLCardinality2324374439486778361.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9358774016671017446.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17026e+09,0.72651,30428,2,7681,5,184405,6,0,380,99132,0


Converting to forward existential form...Done !
original formula: EF(((EX((p34==1)) * AF(((p89==1) + AF(((p53==0)&&(p63==1)))))) * ((p76==0)||(p1==1))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((p76==0)||(p1==1))) * EX((p34==1))) * !(EG(!(((p89==1) + !(EG(!(((p53==0)&&(p63==1)))))))...168
Reverse transition relation is NOT exact ! Due to transitions t5, t8, t17, t24, t28, t30, t33, t35, t39, t88, t89, t90, t91, t92, t93, t94, t95, t96, t97, ...258
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-05-24 04:43:26] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:43:26] [INFO ] Applying decomposition
[2026-05-24 04:43:26] [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/graph13732580031050799166.txt' '-o' '/tmp/graph13732580031050799166.bin' '-w' '/tmp/graph13732580031050799166.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13732580031050799166.bin' '-l' '-1' '-v' '-w' '/tmp/graph13732580031050799166.weights' '-q' '0' '-e' '0.001'
[2026-05-24 04:43:26] [INFO ] Decomposing Gal with order
[2026-05-24 04:43:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 04:43:26] [INFO ] Removed a total of 47 redundant transitions.
[2026-05-24 04:43:26] [INFO ] Flatten gal took : 56 ms
[2026-05-24 04:43:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 5 ms.
[2026-05-24 04:43:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality1761172402316363395.gal : 1 ms
[2026-05-24 04:43:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality11278629121155889887.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/CTLCardinality1761172402316363395.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11278629121155889887.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17026e+09,0.119199,10200,443,113,12579,3298,192,28635,51,16953,0


Converting to forward existential form...Done !
original formula: EF(((EX((i5.u7.p34==1)) * AF(((u19.p89==1) + AF(((i7.u11.p53==0)&&(i7.u11.p63==1)))))) * ((i10.u16.p76==0)||(i0.u0.p1==1))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((i10.u16.p76==0)||(i0.u0.p1==1))) * EX((i5.u7.p34==1))) * !(EG(!(((u19.p89==1) + !(EG(!((...206
Reverse transition relation is NOT exact ! Due to transitions t17, t30, t35, t39, u4.t95, i0.u0.t92, i0.u1.t93, i2.t28, i2.t24, i2.u3.t33, i2.u9.t90, i2.u1...353
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 1
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 1
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,1,6.7244,207360,1,0,249630,23360,1100,1.43044e+06,286,363686,136736
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 84 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 84 transition count 109
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 80 transition count 105
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 80 transition count 105
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 76 transition count 101
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 76 transition count 101
Applied a total of 30 rules in 14 ms. Remains 76 /91 variables (removed 15) and now considering 101/116 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7318802491964072517.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14458475702389970992.kers'
[2026-05-24 04:43:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7318802491964072517.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14458475702389970992.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 101 rows 74 cols 199 entries
Finished phase 1 with 74 SingleSign rule and 0 generalized
[2026-05-24 04:43:32] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14458475702389970992.kers
Total runtime 0 ms.
[2026-05-24 04:43:32] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-24 04:43:32] [INFO ] Invariant cache hit.
[2026-05-24 04:43:33] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-24 04:43:33] [INFO ] Implicit Places using invariants and state equation in 88 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 142 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/91 places, 101/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 157 ms. Remains : 75/91 places, 101/116 transitions.
[2026-05-24 04:43:33] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:43:33] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:43:33] [INFO ] Input system was already deterministic with 101 transitions.
[2026-05-24 04:43:33] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:43:33] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:43:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality6109977738705324041.gal : 0 ms
[2026-05-24 04:43:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality6005400294707407713.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/CTLCardinality6109977738705324041.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6005400294707407713.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.33016e+09,0.871413,35172,2,9919,5,188230,6,0,390,131234,0


Converting to forward existential form...Done !
original formula: EX(((AF((((p86==0)||(p69==1))&&((p81==0)||(p5==1)))) * AX((((p36==1)||(p77==0))||(p13==1)))) * (A(((p35==0)||(p49==1)) U ((p80==0)||(p49=...323
=> equivalent forward existential formula: ([FwdG(((EY(Init) * (!(EG(!((((p86==0)||(p69==1))&&((p81==0)||(p5==1)))))) * !(EX(!((((p36==1)||(p77==0))||(p13=...708
Reverse transition relation is NOT exact ! Due to transitions t8, t18, t21, t27, t29, t31, t32, t40, t83, t86, t90, t91, t92, t93, t94, t95, t96, t97, t98,...266
Detected timeout of ITS tools.
[2026-05-24 04:44:03] [INFO ] Flatten gal took : 8 ms
[2026-05-24 04:44:03] [INFO ] Applying decomposition
[2026-05-24 04:44:03] [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/graph1926790574207951980.txt' '-o' '/tmp/graph1926790574207951980.bin' '-w' '/tmp/graph1926790574207951980.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1926790574207951980.bin' '-l' '-1' '-v' '-w' '/tmp/graph1926790574207951980.weights' '-q' '0' '-e' '0.001'
[2026-05-24 04:44:03] [INFO ] Decomposing Gal with order
[2026-05-24 04:44:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 04:44:03] [INFO ] Removed a total of 49 redundant transitions.
[2026-05-24 04:44:03] [INFO ] Flatten gal took : 18 ms
[2026-05-24 04:44:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 2 ms.
[2026-05-24 04:44:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality900225301716634890.gal : 1 ms
[2026-05-24 04:44:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality303293356590920553.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/CTLCardinality900225301716634890.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality303293356590920553.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 -...260
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.33016e+09,0.137648,10924,707,96,15561,663,198,26797,48,4458,0


Converting to forward existential form...Done !
original formula: EX(((AF((((i10.u20.p86==0)||(i8.u16.p69==1))&&((i10.u19.p81==0)||(i0.u2.p5==1)))) * AX((((i4.u9.p36==1)||(i9.u18.p77==0))||(i6.u1.p13==1)...461
=> equivalent forward existential formula: ([FwdG(((EY(Init) * (!(EG(!((((i10.u20.p86==0)||(i8.u16.p69==1))&&((i10.u19.p81==0)||(i0.u2.p5==1)))))) * !(EX(!...959
Reverse transition relation is NOT exact ! Due to transitions t21, t27, t40, t83, t86, u3.t96, i0.t31, i0.t29, i0.u2.t32, i0.u6.t94, i0.u11.t93, i2.u0.t95,...360
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,2.02472,75456,1,0,135516,3226,1221,275782,235,24141,140806
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 83 transition count 108
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 83 transition count 108
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 75 transition count 100
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 75 transition count 100
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 70 transition count 95
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 70 transition count 95
Applied a total of 42 rules in 9 ms. Remains 70 /91 variables (removed 21) and now considering 95/116 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3064057912364089104.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2906513454889742675.kers'
[2026-05-24 04:44:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3064057912364089104.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2906513454889742675.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 95 rows 68 cols 188 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-24 04:44:05] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2906513454889742675.kers
Total runtime 1 ms.
[2026-05-24 04:44:05] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-24 04:44:05] [INFO ] Invariant cache hit.
[2026-05-24 04:44:05] [INFO ] State equation strengthened by 64 read => feed constraints.
[2026-05-24 04:44:05] [INFO ] Implicit Places using invariants and state equation in 103 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 170 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/91 places, 95/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 180 ms. Remains : 69/91 places, 95/116 transitions.
[2026-05-24 04:44:05] [INFO ] Flatten gal took : 15 ms
[2026-05-24 04:44:05] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:44:05] [INFO ] Input system was already deterministic with 95 transitions.
[2026-05-24 04:44:05] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:44:05] [INFO ] Flatten gal took : 9 ms
[2026-05-24 04:44:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality1998529567647223968.gal : 1 ms
[2026-05-24 04:44:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality17859697670050460125.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/CTLCardinality1998529567647223968.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17859697670050460125.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,9.09902e+08,0.449203,20668,2,5008,5,113093,6,0,361,61113,0


Converting to forward existential form...Done !
original formula: !(E(E(EF(((!((p47==0)||(p37==1)))&&(p23!=1))) U AG((p19==0))) U AX((p18==1))))
=> equivalent forward existential formula: [(FwdU(Init,E(E(TRUE U ((!((p47==0)||(p37==1)))&&(p23!=1))) U !(E(TRUE U !((p19==0)))))) * !(EX(!((p18==1)))))] ...162
Reverse transition relation is NOT exact ! Due to transitions t13, t18, t22, t24, t26, t29, t31, t33, t35, t37, t85, t86, t87, t88, t89, t90, t91, t92, t93...260
(forward)formula 0,0,15.654,452352,1,0,417,2.44323e+06,222,281,2217,2.91261e+06,492
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Graph (complete) has 254 edges and 91 vertex of which 86 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 92 edges and 83 vertex of which 71 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Graph (trivial) has 66 edges and 71 vertex of which 32 / 71 are part of one of the 16 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 55 transition count 91
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 36 place count 48 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 47 transition count 74
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 41 place count 43 transition count 66
Iterating global reduction 3 with 4 rules applied. Total rules applied 45 place count 43 transition count 66
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 48 place count 40 transition count 60
Iterating global reduction 3 with 3 rules applied. Total rules applied 51 place count 40 transition count 60
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 54 place count 37 transition count 54
Iterating global reduction 3 with 3 rules applied. Total rules applied 57 place count 37 transition count 54
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 60 place count 34 transition count 51
Iterating global reduction 3 with 3 rules applied. Total rules applied 63 place count 34 transition count 51
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 34 transition count 49
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 66 place count 34 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 67 place count 33 transition count 48
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 73 place count 27 transition count 42
Applied a total of 73 rules in 14 ms. Remains 27 /91 variables (removed 64) and now considering 42/116 (removed 74) transitions.
[2026-05-24 04:44:21] [INFO ] Flow matrix only has 34 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15801013500547336327.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13272785465329763800.kers'
[2026-05-24 04:44:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15801013500547336327.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13272785465329763800.kers]
Normalized transition count is 33 out of 34 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 33 rows 27 cols 57 entries
Finished phase 1 with 27 SingleSign rule and 0 generalized
[2026-05-24 04:44:21] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13272785465329763800.kers
Total runtime 0 ms.
[2026-05-24 04:44:21] [INFO ] Implicit Places using invariants in 17 ms returned []
[2026-05-24 04:44:21] [INFO ] Flow matrix only has 34 transitions (discarded 8 similar events)
[2026-05-24 04:44:21] [INFO ] Invariant cache hit.
[2026-05-24 04:44:21] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2026-05-24 04:44:21] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2026-05-24 04:44:21] [INFO ] Flow matrix only has 34 transitions (discarded 8 similar events)
[2026-05-24 04:44:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/54 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 6/60 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 0/60 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/61 variables, and 27 constraints, problems are : Problem set: 0 solved, 30 unsolved in 314 ms.
Refiners :[State Equation: 27/27 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/54 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 30/51 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 6/60 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/60 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/61 variables, and 57 constraints, problems are : Problem set: 0 solved, 30 unsolved in 271 ms.
Refiners :[State Equation: 27/27 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 589ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 589ms
Starting structural reductions in SI_CTL mode, iteration 1 : 27/91 places, 42/116 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 661 ms. Remains : 27/91 places, 42/116 transitions.
[2026-05-24 04:44:21] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:44:21] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:44:21] [INFO ] Input system was already deterministic with 42 transitions.
[2026-05-24 04:44:21] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:44:21] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:44:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality1924393357180131974.gal : 0 ms
[2026-05-24 04:44:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality7871974220995421669.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/CTLCardinality1924393357180131974.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7871974220995421669.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,114660,0.00462,3956,2,83,5,371,6,0,129,314,0


Converting to forward existential form...Done !
original formula: !(E(((EF((((p57==0)||(p1==1))||((p47==0)||(p86==1)))) * ((p54==0)||(p21==1))) * (p4==0)) U AG(((p42==0)||(p57==1)))))
=> equivalent forward existential formula: [(FwdU(Init,((E(TRUE U (((p57==0)||(p1==1))||((p47==0)||(p86==1)))) * ((p54==0)||(p21==1))) * (p4==0))) * !(E(TR...195
Reverse transition relation is NOT exact ! Due to transitions t9, t11, t13, t31, t35, t36, t37, t38, t39, t40, Intersection with reachable at each step en...209
(forward)formula 0,0,0.045591,6304,1,0,127,12303,104,99,716,19405,182
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 85 transition count 110
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 85 transition count 110
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 80 transition count 105
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 80 transition count 105
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 77 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 77 transition count 102
Applied a total of 28 rules in 4 ms. Remains 77 /91 variables (removed 14) and now considering 102/116 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13814220164457649695.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6905080185492057603.kers'
[2026-05-24 04:44:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13814220164457649695.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6905080185492057603.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 102 rows 75 cols 200 entries
Finished phase 1 with 75 SingleSign rule and 0 generalized
[2026-05-24 04:44:21] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6905080185492057603.kers
Total runtime 0 ms.
[2026-05-24 04:44:22] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-24 04:44:22] [INFO ] Invariant cache hit.
[2026-05-24 04:44:22] [INFO ] State equation strengthened by 67 read => feed constraints.
[2026-05-24 04:44:22] [INFO ] Implicit Places using invariants and state equation in 80 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 116 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/91 places, 102/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122 ms. Remains : 76/91 places, 102/116 transitions.
[2026-05-24 04:44:22] [INFO ] Flatten gal took : 8 ms
[2026-05-24 04:44:22] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:44:22] [INFO ] Input system was already deterministic with 102 transitions.
[2026-05-24 04:44:22] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:44:22] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:44:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality18289816398762020645.gal : 0 ms
[2026-05-24 04:44:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality1884200537443696436.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/CTLCardinality18289816398762020645.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1884200537443696436.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.35303e+09,0.331422,17940,2,3932,5,96677,6,0,394,45765,0


Converting to forward existential form...Done !
original formula: !(E(AG((EX(((p30==0)||(p71==1))) + ((EG(((p73==0)||(p2==1))) * AX(((p41==0)||(p75==1)))) * ((p38==0)&&(p89==0))))) U ((p41==0)&&(!(((p25=...211
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !((EX(((p30==0)||(p71==1))) + ((EG(((p73==0)||(p2==1))) * !(EX(!(((p41==0)||(p75==1))))))...271
Reverse transition relation is NOT exact ! Due to transitions t24, t26, t30, t33, t35, t37, t82, t84, t90, t91, t92, t93, t94, t95, t96, t97, t98, t99, t10...263
(forward)formula 0,0,24.7158,747392,1,0,580,4.30186e+06,235,310,2440,5.36988e+06,700
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 83 transition count 108
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 83 transition count 108
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 75 transition count 100
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 75 transition count 100
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 69 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 69 transition count 94
Applied a total of 44 rules in 9 ms. Remains 69 /91 variables (removed 22) and now considering 94/116 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5502276219340373460.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8675932752685049776.kers'
[2026-05-24 04:44:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5502276219340373460.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8675932752685049776.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 94 rows 67 cols 186 entries
Finished phase 1 with 67 SingleSign rule and 0 generalized
[2026-05-24 04:44:47] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8675932752685049776.kers
Total runtime 1 ms.
[2026-05-24 04:44:47] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-24 04:44:47] [INFO ] Invariant cache hit.
[2026-05-24 04:44:47] [INFO ] State equation strengthened by 64 read => feed constraints.
[2026-05-24 04:44:47] [INFO ] Implicit Places using invariants and state equation in 110 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 169 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/91 places, 94/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 179 ms. Remains : 68/91 places, 94/116 transitions.
[2026-05-24 04:44:47] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:44:47] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:44:47] [INFO ] Input system was already deterministic with 94 transitions.
[2026-05-24 04:44:47] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:44:47] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:44:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality4872036408107113884.gal : 1 ms
[2026-05-24 04:44:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality11300063500966911201.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/CTLCardinality4872036408107113884.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11300063500966911201.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,8.35715e+08,0.444625,22284,2,5324,5,123961,6,0,356,67148,0


Converting to forward existential form...Done !
original formula: EF(AX(FALSE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t21, t23, t25, t27, t28, t30, t32, t34, t36, t84, t85, t86, t87, t88, t89, t90, t91, t92, t93...255
(forward)formula 0,1,2.10832,70128,1,0,136,322446,203,90,2046,420538,194
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Graph (complete) has 254 edges and 91 vertex of which 85 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 85 transition count 101
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 76 transition count 101
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 26 place count 69 transition count 94
Iterating global reduction 0 with 7 rules applied. Total rules applied 33 place count 69 transition count 94
Applied a total of 33 rules in 18 ms. Remains 69 /91 variables (removed 22) and now considering 94/116 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8413133223731449758.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4301047431188665411.kers'
[2026-05-24 04:44:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8413133223731449758.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4301047431188665411.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 94 rows 67 cols 185 entries
Finished phase 1 with 67 SingleSign rule and 0 generalized
[2026-05-24 04:44:49] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4301047431188665411.kers
Total runtime 1 ms.
[2026-05-24 04:44:49] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-24 04:44:49] [INFO ] Invariant cache hit.
[2026-05-24 04:44:49] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-24 04:44:49] [INFO ] Implicit Places using invariants and state equation in 99 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 148 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 68/91 places, 94/116 transitions.
Applied a total of 0 rules in 12 ms. Remains 68 /68 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 178 ms. Remains : 68/91 places, 94/116 transitions.
[2026-05-24 04:44:49] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:44:49] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:44:49] [INFO ] Input system was already deterministic with 94 transitions.
[2026-05-24 04:44:49] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:44:49] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:44:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality5924893319671507631.gal : 0 ms
[2026-05-24 04:44:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality9950061796387578706.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/CTLCardinality5924893319671507631.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9950061796387578706.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.35544e+08,0.193569,12804,2,2941,5,58401,6,0,356,30985,0


Converting to forward existential form...Done !
original formula: AF(EG(((p70==0)||(p71==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(((p70==0)||(p71==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t20, t22, t24, t26, t27, t29, t31, t33, t82, t83, t84, t85, t86, t87, t88, t89, t90, t91, t92...255
(forward)formula 0,0,7.56965,243720,1,0,611,1.31478e+06,214,363,2079,1.69467e+06,655
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Graph (complete) has 254 edges and 91 vertex of which 84 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 84 transition count 102
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 77 transition count 102
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 22 place count 70 transition count 95
Iterating global reduction 0 with 7 rules applied. Total rules applied 29 place count 70 transition count 95
Applied a total of 29 rules in 20 ms. Remains 70 /91 variables (removed 21) and now considering 95/116 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12213027646300895421.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-985782527968137673.kers'
[2026-05-24 04:44:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12213027646300895421.kers, --Pflows, --basisKERS=/tmp/petrispot-output-985782527968137673.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 95 rows 68 cols 187 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-24 04:44:57] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-985782527968137673.kers
Total runtime 0 ms.
[2026-05-24 04:44:57] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-24 04:44:57] [INFO ] Invariant cache hit.
[2026-05-24 04:44:57] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-24 04:44:57] [INFO ] Implicit Places using invariants and state equation in 79 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 114 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 69/91 places, 95/116 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 69 transition count 95
Applied a total of 2 rules in 8 ms. Remains 69 /69 variables (removed 0) and now considering 95/95 (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-4948779579153006371.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5203808750703654995.kers'
[2026-05-24 04:44:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4948779579153006371.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5203808750703654995.kers]
Normalized transition count is 94 out of 95 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 94 rows 68 cols 185 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-24 04:44:57] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5203808750703654995.kers
Total runtime 0 ms.
[2026-05-24 04:44:57] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-24 04:44:57] [INFO ] Invariant cache hit.
[2026-05-24 04:44:57] [INFO ] State equation strengthened by 49 read => feed constraints.
[2026-05-24 04:44:57] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 69/91 places, 95/116 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 254 ms. Remains : 69/91 places, 95/116 transitions.
[2026-05-24 04:44:57] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:44:57] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:44:57] [INFO ] Input system was already deterministic with 95 transitions.
[2026-05-24 04:44:57] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:44:57] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:44:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality17260120608892231895.gal : 0 ms
[2026-05-24 04:44:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality16386301988997388347.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/CTLCardinality17260120608892231895.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16386301988997388347.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,3.74866e+08,0.220785,13784,2,4220,5,63081,6,0,362,36803,0


Converting to forward existential form...Done !
original formula: EF(AG(((!(E((p64==1) U ((p13==0)||(p28==1)))) + ((p72!=0)&&(p5!=1))) * (EF((p90!=1)) + AF((p27!=0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((!(E((p64==1) U ((p13==0)||(p28==1)))) + ((p72!=0)&&(p5!=1))) * (E(TRUE U (p90...197
Reverse transition relation is NOT exact ! Due to transitions t16, t21, t23, t25, t27, t31, t33, t81, t83, t84, t85, t86, t87, t88, t89, t90, t91, t92, t93...255
(forward)formula 0,0,8.76312,285104,1,0,470,1.60408e+06,224,263,2195,1.89857e+06,577
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 84 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 84 transition count 109
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 78 transition count 103
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 78 transition count 103
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 74 transition count 99
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 74 transition count 99
Applied a total of 34 rules in 2 ms. Remains 74 /91 variables (removed 17) and now considering 99/116 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2365032303818941676.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11506506148795501684.kers'
[2026-05-24 04:45:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2365032303818941676.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11506506148795501684.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 99 rows 72 cols 195 entries
Finished phase 1 with 72 SingleSign rule and 0 generalized
[2026-05-24 04:45:06] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11506506148795501684.kers
Total runtime 0 ms.
[2026-05-24 04:45:06] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-24 04:45:06] [INFO ] Invariant cache hit.
[2026-05-24 04:45:06] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-24 04:45:06] [INFO ] Implicit Places using invariants and state equation in 98 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 146 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/91 places, 99/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 149 ms. Remains : 73/91 places, 99/116 transitions.
[2026-05-24 04:45:06] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:45:06] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:45:06] [INFO ] Input system was already deterministic with 99 transitions.
[2026-05-24 04:45:06] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:45:06] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:45:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality14251018990806339818.gal : 0 ms
[2026-05-24 04:45:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality4936159907685543740.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/CTLCardinality14251018990806339818.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4936159907685543740.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1501e+09,0.297217,17680,2,3951,5,91337,6,0,380,46838,0


Converting to forward existential form...Done !
original formula: EF(AX(AX(AX(((p41==0)&&(p2==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(EX(!(!(EX(!(((p41==0)&&(p2==1))))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t23, t25, t29, t32, t34, t36, t38, t81, t83, t88, t89, t90, t91, t92, t93, t94, t95, t96, t97...260
(forward)formula 0,1,1.90791,67472,1,0,151,337457,215,97,2164,403264,213
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Graph (complete) has 254 edges and 91 vertex of which 84 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 90 edges and 81 vertex of which 63 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Graph (trivial) has 67 edges and 63 vertex of which 34 / 63 are part of one of the 17 SCC in 0 ms
Free SCC test removed 17 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 46 transition count 83
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 37 place count 39 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 38 transition count 65
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 46 place count 30 transition count 49
Iterating global reduction 3 with 8 rules applied. Total rules applied 54 place count 30 transition count 49
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 61 place count 23 transition count 35
Iterating global reduction 3 with 7 rules applied. Total rules applied 68 place count 23 transition count 35
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 74 place count 17 transition count 23
Iterating global reduction 3 with 6 rules applied. Total rules applied 80 place count 17 transition count 23
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 86 place count 11 transition count 17
Iterating global reduction 3 with 6 rules applied. Total rules applied 92 place count 11 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 11 transition count 15
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 96 place count 10 transition count 14
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 99 place count 7 transition count 11
Applied a total of 99 rules in 13 ms. Remains 7 /91 variables (removed 84) and now considering 11/116 (removed 105) transitions.
[2026-05-24 04:45:08] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8496145070613892773.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14506933862924457180.kers'
[2026-05-24 04:45:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8496145070613892773.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14506933862924457180.kers]
Normalized transition count is 8 out of 9 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 7 cols 15 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-24 04:45:08] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14506933862924457180.kers
Total runtime 0 ms.
[2026-05-24 04:45:08] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-24 04:45:08] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2026-05-24 04:45:08] [INFO ] Invariant cache hit.
[2026-05-24 04:45:08] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2026-05-24 04:45:08] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-24 04:45:08] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2026-05-24 04:45:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/15 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/16 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 3/15 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/16 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 65 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 115ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 116ms
Starting structural reductions in SI_CTL mode, iteration 1 : 7/91 places, 11/116 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 173 ms. Remains : 7/91 places, 11/116 transitions.
[2026-05-24 04:45:08] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:45:08] [INFO ] Flatten gal took : 0 ms
[2026-05-24 04:45:08] [INFO ] Input system was already deterministic with 11 transitions.
[2026-05-24 04:45:08] [INFO ] Flatten gal took : 0 ms
[2026-05-24 04:45:08] [INFO ] Flatten gal took : 0 ms
[2026-05-24 04:45:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality1816897709292019331.gal : 0 ms
[2026-05-24 04:45:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality13197013589624150019.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/CTLCardinality1816897709292019331.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13197013589624150019.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,488,0.003494,3828,2,45,5,237,6,0,36,220,0


Converting to forward existential form...Done !
original formula: AG(AF((EF((p8==1)) + (p66==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((E(TRUE U (p8==1)) + (p66==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/...171
(forward)formula 0,0,0.007137,4240,1,0,32,887,47,19,201,1116,36
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 83 transition count 108
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 83 transition count 108
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 75 transition count 100
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 75 transition count 100
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 70 transition count 95
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 70 transition count 95
Applied a total of 42 rules in 2 ms. Remains 70 /91 variables (removed 21) and now considering 95/116 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11961836208071525555.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16195036345953032378.kers'
[2026-05-24 04:45:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11961836208071525555.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16195036345953032378.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 95 rows 68 cols 188 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-24 04:45:08] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16195036345953032378.kers
Total runtime 0 ms.
[2026-05-24 04:45:08] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-24 04:45:08] [INFO ] Invariant cache hit.
[2026-05-24 04:45:08] [INFO ] State equation strengthened by 64 read => feed constraints.
[2026-05-24 04:45:08] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 118 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/91 places, 95/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 121 ms. Remains : 69/91 places, 95/116 transitions.
[2026-05-24 04:45:08] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:45:08] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:45:08] [INFO ] Input system was already deterministic with 95 transitions.
[2026-05-24 04:45:08] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:45:08] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:45:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality5822748394894992553.gal : 1 ms
[2026-05-24 04:45:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality12749118363033388299.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/CTLCardinality5822748394894992553.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12749118363033388299.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,9.09902e+08,0.410653,20688,2,5008,5,113093,6,0,361,61113,0


Converting to forward existential form...Done !
original formula: E(EF((EX((p90==1)) * EF((p91==0)))) U EX(A((EF((p5==1)) + ((p30==0)&&((p86==0)||(p35==1)))) U !(((p23==0)||(p55==1))))))
=> equivalent forward existential formula: [((EY(FwdU(Init,E(TRUE U (EX((p90==1)) * E(TRUE U (p91==0)))))) * !(EG(!(!(((p23==0)||(p55==1))))))) * !(E(!(!((...280
Reverse transition relation is NOT exact ! Due to transitions t13, t18, t22, t24, t26, t29, t31, t33, t35, t37, t85, t86, t87, t88, t89, t90, t91, t92, t93...260
(forward)formula 0,0,29.1546,869484,1,0,650,5.01164e+06,225,344,2220,6.4607e+06,766
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-24 04:45:38] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:45:38] [INFO ] Flatten gal took : 2 ms
Total runtime 220909 ms.

BK_STOP 1779597938146

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-09a"
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 DiscoveryGPU-PT-09a, 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 r098-tall-177955695500281"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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