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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 5.6K Mar 6 16:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 6 16:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 6 16:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 6 16:41 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.8K Mar 15 09:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 09:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 09:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 16:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Mar 6 16:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 6 16:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 6 16:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:13 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 39K 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-11a-CTLCardinality-2024-00
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2024-01
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2024-02
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2024-03
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2024-04
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2024-05
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2024-06
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2024-07
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2024-08
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2024-09
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2024-10
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2024-11
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2024-12
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2024-13
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2024-14
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779599281511

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-11a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-24 05:08:02] [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 05:08:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 05:08:02] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2026-05-24 05:08:02] [INFO ] Transformed 113 places.
[2026-05-24 05:08:02] [INFO ] Transformed 155 transitions.
[2026-05-24 05:08:02] [INFO ] Found NUPN structural information;
[2026-05-24 05:08:02] [INFO ] Parsed PT model containing 113 places and 155 transitions and 498 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Support contains 56 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 155/155 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 109 transition count 151
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 109 transition count 151
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 106 transition count 148
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 106 transition count 148
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 105 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 105 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 26 place count 105 transition count 136
Applied a total of 26 rules in 30 ms. Remains 105 /113 variables (removed 8) and now considering 136/155 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9759135788295869673.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4243317052524392355.kers'
[2026-05-24 05:08:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9759135788295869673.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4243317052524392355.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 136 rows 103 cols 264 entries
Finished phase 1 with 103 SingleSign rule and 0 generalized
[2026-05-24 05:08:03] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4243317052524392355.kers
Total runtime 2 ms.
[2026-05-24 05:08:03] [INFO ] Implicit Places using invariants in 239 ms returned []
[2026-05-24 05:08:03] [INFO ] Invariant cache hit.
[2026-05-24 05:08:03] [INFO ] State equation strengthened by 85 read => feed constraints.
[2026-05-24 05:08:03] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Running 135 sub problems to find dead transitions.
[2026-05-24 05:08:03] [INFO ] Invariant cache hit.
[2026-05-24 05:08:03] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 136/241 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 85/192 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (OVERLAPS) 0/241 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 192 constraints, problems are : Problem set: 0 solved, 135 unsolved in 4660 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 136/241 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 85/192 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 135/327 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 0/241 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 327 constraints, problems are : Problem set: 0 solved, 135 unsolved in 4664 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9383ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 9396ms
Starting structural reductions in LTL mode, iteration 1 : 105/113 places, 136/155 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9837 ms. Remains : 105/113 places, 136/155 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 136/136 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2026-05-24 05:08:12] [INFO ] Invariant cache hit.
[2026-05-24 05:08:12] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-24 05:08:12] [INFO ] Invariant cache hit.
[2026-05-24 05:08:12] [INFO ] State equation strengthened by 85 read => feed constraints.
[2026-05-24 05:08:12] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 105/105 places, 136/136 transitions.
Support contains 56 out of 105 places after structural reductions.
[2026-05-24 05:08:13] [INFO ] Flatten gal took : 37 ms
[2026-05-24 05:08:13] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA DiscoveryGPU-PT-11a-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 05:08:13] [INFO ] Flatten gal took : 16 ms
[2026-05-24 05:08:13] [INFO ] Input system was already deterministic with 136 transitions.
Support contains 49 out of 105 places (down from 56) after GAL structural reductions.
RANDOM walk for 15314 steps (128 resets) in 372 ms. (41 steps per ms) remains 0/36 properties
[2026-05-24 05:08:13] [INFO ] Flatten gal took : 6 ms
[2026-05-24 05:08:13] [INFO ] Flatten gal took : 6 ms
[2026-05-24 05:08:13] [INFO ] Input system was already deterministic with 136 transitions.
Computed a total of 14 stabilizing places and 12 stable transitions
Graph (complete) has 300 edges and 105 vertex of which 98 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.20 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 136/136 transitions.
Graph (complete) has 300 edges and 105 vertex of which 98 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 98 transition count 123
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 92 transition count 123
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 20 place count 85 transition count 116
Iterating global reduction 0 with 7 rules applied. Total rules applied 27 place count 85 transition count 116
Applied a total of 27 rules in 20 ms. Remains 85 /105 variables (removed 20) and now considering 116/136 (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-8790726989657152486.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8447792665321231465.kers'
[2026-05-24 05:08:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8790726989657152486.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8447792665321231465.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 116 rows 83 cols 228 entries
Finished phase 1 with 83 SingleSign rule and 0 generalized
[2026-05-24 05:08:13] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8447792665321231465.kers
Total runtime 3 ms.
[2026-05-24 05:08:13] [INFO ] Implicit Places using invariants in 168 ms returned []
[2026-05-24 05:08:13] [INFO ] Invariant cache hit.
[2026-05-24 05:08:13] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-05-24 05:08:13] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2026-05-24 05:08:13] [INFO ] Redundant transitions in 3 ms returned []
Running 115 sub problems to find dead transitions.
[2026-05-24 05:08:13] [INFO ] Invariant cache hit.
[2026-05-24 05:08:13] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 116/201 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 80/167 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 0/201 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 167 constraints, problems are : Problem set: 0 solved, 115 unsolved in 3701 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 80/80 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/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 116/201 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 80/167 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 115/282 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 282 constraints, problems are : Problem set: 0 solved, 115 unsolved in 3170 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6880ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 6881ms
Starting structural reductions in SI_CTL mode, iteration 1 : 85/105 places, 116/136 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7184 ms. Remains : 85/105 places, 116/136 transitions.
[2026-05-24 05:08:20] [INFO ] Flatten gal took : 7 ms
[2026-05-24 05:08:20] [INFO ] Flatten gal took : 4 ms
[2026-05-24 05:08:20] [INFO ] Input system was already deterministic with 116 transitions.
[2026-05-24 05:08:20] [INFO ] Flatten gal took : 4 ms
[2026-05-24 05:08:20] [INFO ] Flatten gal took : 4 ms
[2026-05-24 05:08:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality9230843620850617338.gal : 2 ms
[2026-05-24 05:08:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality1943706371756506879.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/CTLCardinality9230843620850617338.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1943706371756506879.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,2.85213e+10,0.476288,21364,2,2625,5,107342,6,0,443,60064,0


Converting to forward existential form...Done !
original formula: AG(((AG((p72==1)) + ((p102==0)&&(p112==1))) + (((p20==0)||(p74==1))&&((p47==0)||(p57==1)))))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !((((p20==0)||(p74==1))&&((p47==0)||(p57==1))))) * !(((p102==0)&&(p112==1)))),TRUE) *...177
(forward)formula 0,0,0.978778,31360,1,0,15,192176,14,6,807,80412,5
FORMULA DiscoveryGPU-PT-11a-CTLCardinality-2024-00 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 : 105/105 places, 136/136 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 97 transition count 128
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 97 transition count 128
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 92 transition count 123
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 92 transition count 123
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 88 transition count 119
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 88 transition count 119
Applied a total of 34 rules in 13 ms. Remains 88 /105 variables (removed 17) and now considering 119/136 (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-17071506835522747284.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6256725870302114417.kers'
[2026-05-24 05:08:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17071506835522747284.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6256725870302114417.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 119 rows 86 cols 235 entries
Finished phase 1 with 86 SingleSign rule and 0 generalized
[2026-05-24 05:08:21] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6256725870302114417.kers
Total runtime 0 ms.
[2026-05-24 05:08:22] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-24 05:08:22] [INFO ] Invariant cache hit.
[2026-05-24 05:08:22] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-05-24 05:08:22] [INFO ] Implicit Places using invariants and state equation in 187 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 268 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 87/105 places, 119/136 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 283 ms. Remains : 87/105 places, 119/136 transitions.
[2026-05-24 05:08:22] [INFO ] Flatten gal took : 4 ms
[2026-05-24 05:08:22] [INFO ] Flatten gal took : 11 ms
[2026-05-24 05:08:22] [INFO ] Input system was already deterministic with 119 transitions.
[2026-05-24 05:08:22] [INFO ] Flatten gal took : 13 ms
[2026-05-24 05:08:22] [INFO ] Flatten gal took : 4 ms
[2026-05-24 05:08:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality2268076382404582237.gal : 2 ms
[2026-05-24 05:08:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality4926603378733475367.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/CTLCardinality2268076382404582237.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4926603378733475367.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,9.75574e+10,1.19106,50216,2,12702,5,307383,6,0,454,161040,0


Converting to forward existential form...Done !
original formula: (EF((p63==1)) * EG((EG(((p52==0)||(p35==1))) + AX((((p61==0)&&(p84==1))&&(p65==1))))))
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U (p63==1))),(EG(((p52==0)||(p35==1))) + !(EX(!((((p61==0)&&(p84==1))&&(p65==1)))))))] != F...159
Reverse transition relation is NOT exact ! Due to transitions t27, t29, t33, t35, t36, t38, t40, t44, t46, t98, t102, t106, t107, t108, t109, t110, t111, t...295
Detected timeout of ITS tools.
[2026-05-24 05:08:52] [INFO ] Flatten gal took : 12 ms
[2026-05-24 05:08:52] [INFO ] Applying decomposition
[2026-05-24 05:08:52] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6315197349021039265.txt' '-o' '/tmp/graph6315197349021039265.bin' '-w' '/tmp/graph6315197349021039265.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6315197349021039265.bin' '-l' '-1' '-v' '-w' '/tmp/graph6315197349021039265.weights' '-q' '0' '-e' '0.001'
[2026-05-24 05:08:52] [INFO ] Decomposing Gal with order
[2026-05-24 05:08:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 05:08:52] [INFO ] Removed a total of 64 redundant transitions.
[2026-05-24 05:08:52] [INFO ] Flatten gal took : 54 ms
[2026-05-24 05:08:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 6 ms.
[2026-05-24 05:08:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality6647747364912087651.gal : 3 ms
[2026-05-24 05:08:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality11512510259312796640.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/CTLCardinality6647747364912087651.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11512510259312796640.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,9.75574e+10,0.153892,10312,386,63,13678,1039,196,27556,43,5202,0


Converting to forward existential form...Done !
original formula: (EF((i7.u15.p63==1)) * EG((EG(((i6.u12.p52==0)||(i4.u8.p35==1))) + AX((((i7.u15.p61==0)&&(i1.u20.p84==1))&&(i7.u16.p65==1))))))
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U (i7.u15.p63==1))),(EG(((i6.u12.p52==0)||(i4.u8.p35==1))) + !(EX(!((((i7.u15.p61==0)&&(i1....200
Reverse transition relation is NOT exact ! Due to transitions t27, t33, t35, t36, t40, t44, t46, t98, t102, i0.u6.t111, i1.t38, i1.t29, i1.u4.t114, i1.u20....388
Using saturation style SCC detection
Using 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 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,7.4365,206708,1,0,367897,6103,1160,941460,218,49540,212409
FORMULA DiscoveryGPU-PT-11a-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 136/136 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 96 transition count 127
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 96 transition count 127
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 90 transition count 121
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 90 transition count 121
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 85 transition count 116
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 85 transition count 116
Applied a total of 40 rules in 9 ms. Remains 85 /105 variables (removed 20) and now considering 116/136 (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-16435418541378730096.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6202457538715017816.kers'
[2026-05-24 05:09:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16435418541378730096.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6202457538715017816.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 116 rows 83 cols 230 entries
Finished phase 1 with 83 SingleSign rule and 0 generalized
[2026-05-24 05:09:00] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6202457538715017816.kers
Total runtime 0 ms.
[2026-05-24 05:09:00] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-24 05:09:00] [INFO ] Invariant cache hit.
[2026-05-24 05:09:00] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-24 05:09:00] [INFO ] Implicit Places using invariants and state equation in 181 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 250 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/105 places, 116/136 transitions.
Applied a total of 0 rules in 8 ms. Remains 84 /84 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 267 ms. Remains : 84/105 places, 116/136 transitions.
[2026-05-24 05:09:00] [INFO ] Flatten gal took : 6 ms
[2026-05-24 05:09:00] [INFO ] Flatten gal took : 14 ms
[2026-05-24 05:09:00] [INFO ] Input system was already deterministic with 116 transitions.
[2026-05-24 05:09:00] [INFO ] Flatten gal took : 3 ms
[2026-05-24 05:09:00] [INFO ] Flatten gal took : 20 ms
[2026-05-24 05:09:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality9054130357252295935.gal : 1 ms
[2026-05-24 05:09:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality8747582420003523012.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/CTLCardinality9054130357252295935.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8747582420003523012.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,8.06816e+10,1.69013,60944,2,14588,5,408525,6,0,440,180345,0


Converting to forward existential form...Done !
original formula: AG(E(EX(((p37==0)||(p35==1))) U (p22==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(EX(((p37==0)||(p35==1))) U (p22==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t26, t28, t30, t32, t35, t37, t39, t41, t43, t45, t96, t97, t104, t105, t106, t107, t108, t10...293
(forward)formula 0,0,17.9747,533048,1,0,213,3.07305e+06,252,147,2528,3.53274e+06,291
FORMULA DiscoveryGPU-PT-11a-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 136/136 transitions.
Graph (complete) has 300 edges and 105 vertex of which 99 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
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 110 edges and 96 vertex of which 80 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Graph (trivial) has 87 edges and 80 vertex of which 42 / 80 are part of one of the 21 SCC in 3 ms
Free SCC test removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 59 transition count 101
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 50 place count 47 transition count 80
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 59 place count 38 transition count 62
Iterating global reduction 2 with 9 rules applied. Total rules applied 68 place count 38 transition count 62
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 77 place count 29 transition count 44
Iterating global reduction 2 with 9 rules applied. Total rules applied 86 place count 29 transition count 44
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 94 place count 21 transition count 28
Iterating global reduction 2 with 8 rules applied. Total rules applied 102 place count 21 transition count 28
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 110 place count 13 transition count 20
Iterating global reduction 2 with 8 rules applied. Total rules applied 118 place count 13 transition count 20
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 119 place count 13 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 12 transition count 18
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 12 transition count 18
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 11 transition count 17
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 11 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 9 transition count 15
Applied a total of 126 rules in 40 ms. Remains 9 /105 variables (removed 96) and now considering 15/136 (removed 121) transitions.
[2026-05-24 05:09:18] [INFO ] Flow matrix only has 12 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-1276038071223162126.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13060156554684392876.kers'
[2026-05-24 05:09:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1276038071223162126.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13060156554684392876.kers]
Normalized transition count is 11 out of 12 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 11 rows 9 cols 19 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-24 05:09:18] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13060156554684392876.kers
Total runtime 3 ms.
[2026-05-24 05:09:18] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-24 05:09:18] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
[2026-05-24 05:09:18] [INFO ] Invariant cache hit.
[2026-05-24 05:09:18] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2026-05-24 05:09:18] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2026-05-24 05:09:18] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
[2026-05-24 05:09:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 3/20 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/21 variables, and 9 constraints, problems are : Problem set: 0 solved, 10 unsolved in 116 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 3/20 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/21 variables, and 19 constraints, problems are : Problem set: 0 solved, 10 unsolved in 102 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 240ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 241ms
Starting structural reductions in SI_CTL mode, iteration 1 : 9/105 places, 15/136 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 336 ms. Remains : 9/105 places, 15/136 transitions.
[2026-05-24 05:09:18] [INFO ] Flatten gal took : 1 ms
[2026-05-24 05:09:18] [INFO ] Flatten gal took : 0 ms
[2026-05-24 05:09:18] [INFO ] Input system was already deterministic with 15 transitions.
[2026-05-24 05:09:18] [INFO ] Flatten gal took : 0 ms
[2026-05-24 05:09:18] [INFO ] Flatten gal took : 1 ms
[2026-05-24 05:09:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality17876537406686297248.gal : 1 ms
[2026-05-24 05:09:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality14250422308881943826.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/CTLCardinality17876537406686297248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14250422308881943826.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,1050,0.003559,3864,2,25,5,296,6,0,45,357,0


Converting to forward existential form...Done !
original formula: AF(AG(((p19==0)||(p101==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((p19==0)||(p101==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t11, t12, t14, Intersection with reachable at each step enabled. (destroyed/reverse/inte...178
(forward)formula 0,0,0.015007,4248,1,0,81,1872,54,67,256,3076,91
FORMULA DiscoveryGPU-PT-11a-CTLCardinality-2024-04 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 : 105/105 places, 136/136 transitions.
Graph (complete) has 300 edges and 105 vertex of which 99 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 110 edges and 96 vertex of which 82 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 14 output transitions
Drop transitions (Output transitions of discarded places.) removed 14 transitions
Graph (trivial) has 87 edges and 82 vertex of which 42 / 82 are part of one of the 21 SCC in 0 ms
Free SCC test removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 61 transition count 104
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 48 place count 50 transition count 83
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 55 place count 43 transition count 69
Iterating global reduction 2 with 7 rules applied. Total rules applied 62 place count 43 transition count 69
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 69 place count 36 transition count 55
Iterating global reduction 2 with 7 rules applied. Total rules applied 76 place count 36 transition count 55
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 83 place count 29 transition count 41
Iterating global reduction 2 with 7 rules applied. Total rules applied 90 place count 29 transition count 41
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 97 place count 22 transition count 34
Iterating global reduction 2 with 7 rules applied. Total rules applied 104 place count 22 transition count 34
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 105 place count 22 transition count 33
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 106 place count 22 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 107 place count 21 transition count 32
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 111 place count 17 transition count 28
Applied a total of 111 rules in 7 ms. Remains 17 /105 variables (removed 88) and now considering 28/136 (removed 108) transitions.
[2026-05-24 05:09:18] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15180455235094071531.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-463138997169982683.kers'
[2026-05-24 05:09:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15180455235094071531.kers, --Pflows, --basisKERS=/tmp/petrispot-output-463138997169982683.kers]
Normalized transition count is 21 out of 22 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 21 rows 17 cols 35 entries
Finished phase 1 with 17 SingleSign rule and 0 generalized
[2026-05-24 05:09:18] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-463138997169982683.kers
Total runtime 0 ms.
[2026-05-24 05:09:18] [INFO ] Implicit Places using invariants in 15 ms returned []
[2026-05-24 05:09:18] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
[2026-05-24 05:09:18] [INFO ] Invariant cache hit.
[2026-05-24 05:09:19] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2026-05-24 05:09:19] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2026-05-24 05:09:19] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
[2026-05-24 05:09:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/34 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 4/38 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 0/38 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/39 variables, and 17 constraints, problems are : Problem set: 0 solved, 20 unsolved in 321 ms.
Refiners :[State Equation: 17/17 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/34 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 4/38 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/39 variables, and 37 constraints, problems are : Problem set: 0 solved, 20 unsolved in 265 ms.
Refiners :[State Equation: 17/17 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 589ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 589ms
Starting structural reductions in SI_CTL mode, iteration 1 : 17/105 places, 28/136 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 636 ms. Remains : 17/105 places, 28/136 transitions.
[2026-05-24 05:09:19] [INFO ] Flatten gal took : 18 ms
[2026-05-24 05:09:19] [INFO ] Flatten gal took : 0 ms
[2026-05-24 05:09:19] [INFO ] Input system was already deterministic with 28 transitions.
[2026-05-24 05:09:19] [INFO ] Flatten gal took : 1 ms
[2026-05-24 05:09:19] [INFO ] Flatten gal took : 1 ms
[2026-05-24 05:09:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality8522425043339953739.gal : 1 ms
[2026-05-24 05:09:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality6647034268303220888.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/CTLCardinality8522425043339953739.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6647034268303220888.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,9720,0.003469,3872,2,38,5,208,6,0,81,182,0


Converting to forward existential form...Done !
original formula: EF(((p84==1) * A(!(((p52==0)||(p87==1))) U (p71==1))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (p84==1)) * !(EG(!((p71==1))))) * !(E(!((p71==1)) U (!(!(((p52==0)||(p87==1)))) * !((p71==...172
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t22, t24, t25, t26, t27, Intersection with reachable at each step enabled. (destroye...192
(forward)formula 0,1,0.047382,5776,1,0,209,9095,76,116,439,14277,238
FORMULA DiscoveryGPU-PT-11a-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 136/136 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 98 transition count 129
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 98 transition count 129
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 92 transition count 123
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 92 transition count 123
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 87 transition count 118
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 87 transition count 118
Applied a total of 36 rules in 4 ms. Remains 87 /105 variables (removed 18) and now considering 118/136 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17522630615963454311.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12525297212550520602.kers'
[2026-05-24 05:09:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17522630615963454311.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12525297212550520602.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 118 rows 85 cols 233 entries
Finished phase 1 with 85 SingleSign rule and 0 generalized
[2026-05-24 05:09:19] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12525297212550520602.kers
Total runtime 0 ms.
[2026-05-24 05:09:19] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-24 05:09:19] [INFO ] Invariant cache hit.
[2026-05-24 05:09:19] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-24 05:09:19] [INFO ] Implicit Places using invariants and state equation in 189 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 273 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 86/105 places, 118/136 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 279 ms. Remains : 86/105 places, 118/136 transitions.
[2026-05-24 05:09:19] [INFO ] Flatten gal took : 4 ms
[2026-05-24 05:09:19] [INFO ] Flatten gal took : 16 ms
[2026-05-24 05:09:19] [INFO ] Input system was already deterministic with 118 transitions.
[2026-05-24 05:09:20] [INFO ] Flatten gal took : 8 ms
[2026-05-24 05:09:20] [INFO ] Flatten gal took : 21 ms
[2026-05-24 05:09:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality10619083115224959979.gal : 1 ms
[2026-05-24 05:09:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality627466628906632408.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/CTLCardinality10619083115224959979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality627466628906632408.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,9.15019e+10,5.47494,162692,2,39080,5,1.05326e+06,6,0,449,584157,0


Converting to forward existential form...Done !
original formula: AX(AG((((AG((p83==1)) + AF((p96==1))) + ((p95==0)||(p100==1))) + (p1==0))))
=> equivalent forward existential formula: [FwdG((((FwdU(EY(Init),TRUE) * !((p1==0))) * !(((p95==0)||(p100==1)))) * !(!(E(TRUE U !((p83==1)))))),!((p96==1)...166
Reverse transition relation is NOT exact ! Due to transitions t5, t20, t27, t31, t33, t35, t38, t40, t42, t44, t46, t105, t106, t107, t108, t109, t110, t11...293
Detected timeout of ITS tools.
[2026-05-24 05:09:50] [INFO ] Flatten gal took : 10 ms
[2026-05-24 05:09:50] [INFO ] Applying decomposition
[2026-05-24 05:09:50] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4486908807542762487.txt' '-o' '/tmp/graph4486908807542762487.bin' '-w' '/tmp/graph4486908807542762487.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4486908807542762487.bin' '-l' '-1' '-v' '-w' '/tmp/graph4486908807542762487.weights' '-q' '0' '-e' '0.001'
[2026-05-24 05:09:50] [INFO ] Decomposing Gal with order
[2026-05-24 05:09:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 05:09:50] [INFO ] Removed a total of 60 redundant transitions.
[2026-05-24 05:09:50] [INFO ] Flatten gal took : 17 ms
[2026-05-24 05:09:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 11 ms.
[2026-05-24 05:09:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality9670123352334405985.gal : 4 ms
[2026-05-24 05:09:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality17406463692872842080.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/CTLCardinality9670123352334405985.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17406463692872842080.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,9.15019e+10,0.578653,27496,1255,128,46092,5749,222,130363,48,36777,0


Converting to forward existential form...Done !
original formula: AX(AG((((AG((i9.u17.p83==1)) + AF((i4.i1.u20.p96==1))) + ((i4.i1.u20.p95==0)||(u21.p100==1))) + (i0.u0.p1==0))))
=> equivalent forward existential formula: [FwdG((((FwdU(EY(Init),TRUE) * !((i0.u0.p1==0))) * !(((i4.i1.u20.p95==0)||(u21.p100==1)))) * !(!(E(TRUE U !((i9....203
Reverse transition relation is NOT exact ! Due to transitions t20, t27, t31, t38, t44, u6.t109, i0.u0.t110, i0.u1.t111, i1.u3.t113, i4.t46, i4.i0.t40, i4.i...413
Using saturation style SCC detection
Using 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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,0,2.39546,94676,1,0,180980,7882,1441,522700,274,60247,179620
FORMULA DiscoveryGPU-PT-11a-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 136/136 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 96 transition count 127
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 96 transition count 127
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 89 transition count 120
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 89 transition count 120
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 83 transition count 114
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 83 transition count 114
Applied a total of 44 rules in 3 ms. Remains 83 /105 variables (removed 22) and now considering 114/136 (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-6102206902183200358.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17454056126570716586.kers'
[2026-05-24 05:09:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6102206902183200358.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17454056126570716586.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 114 rows 81 cols 226 entries
Finished phase 1 with 81 SingleSign rule and 0 generalized
[2026-05-24 05:09:52] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17454056126570716586.kers
Total runtime 0 ms.
[2026-05-24 05:09:52] [INFO ] Implicit Places using invariants in 370 ms returned []
[2026-05-24 05:09:53] [INFO ] Invariant cache hit.
[2026-05-24 05:09:53] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-24 05:09:53] [INFO ] Implicit Places using invariants and state equation in 110 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 516 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/105 places, 114/136 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 521 ms. Remains : 82/105 places, 114/136 transitions.
[2026-05-24 05:09:53] [INFO ] Flatten gal took : 3 ms
[2026-05-24 05:09:53] [INFO ] Flatten gal took : 3 ms
[2026-05-24 05:09:53] [INFO ] Input system was already deterministic with 114 transitions.
[2026-05-24 05:09:53] [INFO ] Flatten gal took : 32 ms
[2026-05-24 05:09:53] [INFO ] Flatten gal took : 3 ms
[2026-05-24 05:09:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality9170955254817854119.gal : 1 ms
[2026-05-24 05:09:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality4757097474444516049.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/CTLCardinality9170955254817854119.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4757097474444516049.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,6.89376e+10,2.01545,64656,2,15540,5,436789,6,0,430,196066,0


Converting to forward existential form...Done !
original formula: AG((EF(((p79==0)&&(p80==1))) + AX(AG(((p60==0)&&(p107==1))))))
=> equivalent forward existential formula: [(FwdU(EY((FwdU(Init,TRUE) * !(E(TRUE U ((p79==0)&&(p80==1)))))),TRUE) * !(((p60==0)&&(p107==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t25, t27, t29, t31, t33, t34, t36, t38, t40, t42, t44, t102, t103, t104, t105, t106, t107, t1...288
(forward)formula 0,0,10.7462,283332,1,0,166,1.41488e+06,252,110,2725,1.55971e+06,242
FORMULA DiscoveryGPU-PT-11a-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 136/136 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 98 transition count 129
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 98 transition count 129
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 92 transition count 123
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 92 transition count 123
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 88 transition count 119
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 88 transition count 119
Applied a total of 34 rules in 2 ms. Remains 88 /105 variables (removed 17) and now considering 119/136 (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-15053686173737563613.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10636856165456856629.kers'
[2026-05-24 05:10:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15053686173737563613.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10636856165456856629.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 119 rows 86 cols 235 entries
Finished phase 1 with 86 SingleSign rule and 0 generalized
[2026-05-24 05:10:04] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10636856165456856629.kers
Total runtime 6 ms.
[2026-05-24 05:10:04] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-24 05:10:04] [INFO ] Invariant cache hit.
[2026-05-24 05:10:04] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-24 05:10:04] [INFO ] Implicit Places using invariants and state equation in 107 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 176 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 87/105 places, 119/136 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 181 ms. Remains : 87/105 places, 119/136 transitions.
[2026-05-24 05:10:04] [INFO ] Flatten gal took : 3 ms
[2026-05-24 05:10:04] [INFO ] Flatten gal took : 4 ms
[2026-05-24 05:10:04] [INFO ] Input system was already deterministic with 119 transitions.
[2026-05-24 05:10:04] [INFO ] Flatten gal took : 3 ms
[2026-05-24 05:10:04] [INFO ] Flatten gal took : 3 ms
[2026-05-24 05:10:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality961608292474344943.gal : 0 ms
[2026-05-24 05:10:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality2686702245798617743.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/CTLCardinality961608292474344943.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2686702245798617743.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.94808e+10,2.08467,70880,2,16512,5,459267,6,0,454,234327,0


Converting to forward existential form...Done !
original formula: EF(((!(E(AX(((p34==0)||(p23==1))) U ((p51==0)||(p108==1)))) * !(E(((p54==0)||(p28==1)) U ((p7==0)||(p75==1))))) * !(A((p13==1) U (p80==1)...159
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * (!(E(!(EX(!(((p34==0)||(p23==1))))) U ((p51==0)||(p108==1)))) * !(E(((p54==0)||(p28==...404
Reverse transition relation is NOT exact ! Due to transitions t18, t21, t24, t28, t30, t32, t34, t37, t41, t45, t47, t106, t107, t108, t109, t110, t111, t1...294
(forward)formula 0,0,15.6257,441472,1,0,197,2.37712e+06,283,129,2692,2.89798e+06,278
FORMULA DiscoveryGPU-PT-11a-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 136/136 transitions.
Graph (complete) has 300 edges and 105 vertex of which 98 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 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 109 edges and 95 vertex of which 77 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.3 ms
Discarding 18 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Graph (trivial) has 83 edges and 77 vertex of which 42 / 77 are part of one of the 21 SCC in 0 ms
Free SCC test removed 21 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 56 transition count 101
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 45 place count 47 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 46 transition count 79
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 56 place count 36 transition count 59
Iterating global reduction 3 with 10 rules applied. Total rules applied 66 place count 36 transition count 59
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 75 place count 27 transition count 41
Iterating global reduction 3 with 9 rules applied. Total rules applied 84 place count 27 transition count 41
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 92 place count 19 transition count 25
Iterating global reduction 3 with 8 rules applied. Total rules applied 100 place count 19 transition count 25
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 108 place count 11 transition count 17
Iterating global reduction 3 with 8 rules applied. Total rules applied 116 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 118 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 120 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 123 place count 7 transition count 11
Applied a total of 123 rules in 9 ms. Remains 7 /105 variables (removed 98) and now considering 11/136 (removed 125) transitions.
[2026-05-24 05:10:19] [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-8266531506363821541.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12348531880539845351.kers'
[2026-05-24 05:10:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8266531506363821541.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12348531880539845351.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 05:10:19] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12348531880539845351.kers
Total runtime 0 ms.
[2026-05-24 05:10:20] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-24 05:10:20] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2026-05-24 05:10:20] [INFO ] Invariant cache hit.
[2026-05-24 05:10:20] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2026-05-24 05:10:20] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-24 05:10:20] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2026-05-24 05:10:20] [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 52 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 56 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 139ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 140ms
Starting structural reductions in SI_CTL mode, iteration 1 : 7/105 places, 11/136 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 206 ms. Remains : 7/105 places, 11/136 transitions.
[2026-05-24 05:10:20] [INFO ] Flatten gal took : 0 ms
[2026-05-24 05:10:20] [INFO ] Flatten gal took : 0 ms
[2026-05-24 05:10:20] [INFO ] Input system was already deterministic with 11 transitions.
[2026-05-24 05:10:20] [INFO ] Flatten gal took : 0 ms
[2026-05-24 05:10:20] [INFO ] Flatten gal took : 0 ms
[2026-05-24 05:10:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality7597222176629627330.gal : 1 ms
[2026-05-24 05:10:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality5193823977634348883.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/CTLCardinality7597222176629627330.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5193823977634348883.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,730,0.003361,3840,2,25,5,310,6,0,36,369,0


Converting to forward existential form...Done !
original formula: EF(AG(((p106==0)&&(p98==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p106==0)&&(p98==0))))))] != 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,1,0.005729,4108,1,0,30,533,41,14,200,530,29
FORMULA DiscoveryGPU-PT-11a-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 136/136 transitions.
Graph (complete) has 300 edges and 105 vertex of which 98 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 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 109 edges and 95 vertex of which 77 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 81 edges and 77 vertex of which 40 / 77 are part of one of the 20 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 57 transition count 100
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 45 place count 47 transition count 80
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 54 place count 38 transition count 62
Iterating global reduction 2 with 9 rules applied. Total rules applied 63 place count 38 transition count 62
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 72 place count 29 transition count 44
Iterating global reduction 2 with 9 rules applied. Total rules applied 81 place count 29 transition count 44
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 88 place count 22 transition count 30
Iterating global reduction 2 with 7 rules applied. Total rules applied 95 place count 22 transition count 30
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 102 place count 15 transition count 23
Iterating global reduction 2 with 7 rules applied. Total rules applied 109 place count 15 transition count 23
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 110 place count 15 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 14 transition count 21
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 14 transition count 21
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 13 transition count 20
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 13 transition count 20
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 118 place count 10 transition count 17
Applied a total of 118 rules in 7 ms. Remains 10 /105 variables (removed 95) and now considering 17/136 (removed 119) transitions.
[2026-05-24 05:10:20] [INFO ] Flow matrix only has 14 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-4164310878170754027.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13890320307227127829.kers'
[2026-05-24 05:10:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4164310878170754027.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13890320307227127829.kers]
Normalized transition count is 13 out of 14 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 13 rows 10 cols 23 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-24 05:10:20] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13890320307227127829.kers
Total runtime 0 ms.
[2026-05-24 05:10:20] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-24 05:10:20] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
[2026-05-24 05:10:20] [INFO ] Invariant cache hit.
[2026-05-24 05:10:20] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2026-05-24 05:10:20] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2026-05-24 05:10:20] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
[2026-05-24 05:10:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/23 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/24 variables, and 10 constraints, problems are : Problem set: 0 solved, 10 unsolved in 113 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 4/23 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/24 variables, and 20 constraints, problems are : Problem set: 0 solved, 10 unsolved in 75 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 221ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 221ms
Starting structural reductions in SI_CTL mode, iteration 1 : 10/105 places, 17/136 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 293 ms. Remains : 10/105 places, 17/136 transitions.
[2026-05-24 05:10:20] [INFO ] Flatten gal took : 1 ms
[2026-05-24 05:10:20] [INFO ] Flatten gal took : 1 ms
[2026-05-24 05:10:20] [INFO ] Input system was already deterministic with 17 transitions.
[2026-05-24 05:10:20] [INFO ] Flatten gal took : 0 ms
[2026-05-24 05:10:20] [INFO ] Flatten gal took : 0 ms
[2026-05-24 05:10:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality6051421658644044540.gal : 1 ms
[2026-05-24 05:10:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality18247381614834372431.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/CTLCardinality6051421658644044540.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18247381614834372431.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,2295,0.003212,3856,2,29,5,295,6,0,50,333,0


Converting to forward existential form...Done !
original formula: A((p29==1) U !(A(!(AG(AF((p37==0)))) U AG(AF(((p37==0)||(p104==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(!((E(!(!(E(TRUE U !(!(EG(!(((p37==0)||(p104==1))))))))) U (!(!(!(E(TRUE U !(!(EG(!((p37==0)))...757
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t13, t15, t16, Intersection with reachable at each step enabled. (destroyed/reverse/...182
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.02559,4932,1,0,198,5918,75,139,304,8745,216
FORMULA DiscoveryGPU-PT-11a-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 136/136 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 96 transition count 127
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 96 transition count 127
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 89 transition count 120
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 89 transition count 120
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 83 transition count 114
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 83 transition count 114
Applied a total of 44 rules in 2 ms. Remains 83 /105 variables (removed 22) and now considering 114/136 (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-14977468965786372367.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12335190209501486830.kers'
[2026-05-24 05:10:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14977468965786372367.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12335190209501486830.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 114 rows 81 cols 226 entries
Finished phase 1 with 81 SingleSign rule and 0 generalized
[2026-05-24 05:10:20] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12335190209501486830.kers
Total runtime 0 ms.
[2026-05-24 05:10:20] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-24 05:10:20] [INFO ] Invariant cache hit.
[2026-05-24 05:10:20] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-24 05:10:20] [INFO ] Implicit Places using invariants and state equation in 103 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 218 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/105 places, 114/136 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 227 ms. Remains : 82/105 places, 114/136 transitions.
[2026-05-24 05:10:20] [INFO ] Flatten gal took : 4 ms
[2026-05-24 05:10:20] [INFO ] Flatten gal took : 7 ms
[2026-05-24 05:10:20] [INFO ] Input system was already deterministic with 114 transitions.
[2026-05-24 05:10:20] [INFO ] Flatten gal took : 2 ms
[2026-05-24 05:10:20] [INFO ] Flatten gal took : 2 ms
[2026-05-24 05:10:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality9207359450386239483.gal : 1 ms
[2026-05-24 05:10:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality14606472170627257660.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/CTLCardinality9207359450386239483.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14606472170627257660.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.89376e+10,2.00014,64628,2,15540,5,436789,6,0,430,196066,0


Converting to forward existential form...Done !
original formula: AX(AG(AX(EX((p99==0)))))
=> equivalent forward existential formula: [(EY(FwdU(EY(Init),TRUE)) * !(EX((p99==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t25, t27, t29, t31, t33, t34, t36, t38, t40, t42, t44, t102, t103, t104, t105, t106, t107, t1...288
(forward)formula 0,0,9.89707,265248,1,0,165,1.29892e+06,245,108,2661,1.61245e+06,239
FORMULA DiscoveryGPU-PT-11a-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 136/136 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 96 transition count 127
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 96 transition count 127
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 89 transition count 120
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 89 transition count 120
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 83 transition count 114
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 83 transition count 114
Applied a total of 44 rules in 2 ms. Remains 83 /105 variables (removed 22) and now considering 114/136 (removed 22) transitions.
[2026-05-24 05:10:30] [INFO ] Invariant cache hit.
[2026-05-24 05:10:30] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-24 05:10:30] [INFO ] Invariant cache hit.
[2026-05-24 05:10:30] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-24 05:10:30] [INFO ] Implicit Places using invariants and state equation in 122 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 184 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/105 places, 114/136 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 188 ms. Remains : 82/105 places, 114/136 transitions.
[2026-05-24 05:10:30] [INFO ] Flatten gal took : 6 ms
[2026-05-24 05:10:30] [INFO ] Flatten gal took : 3 ms
[2026-05-24 05:10:30] [INFO ] Input system was already deterministic with 114 transitions.
[2026-05-24 05:10:30] [INFO ] Flatten gal took : 2 ms
[2026-05-24 05:10:30] [INFO ] Flatten gal took : 2 ms
[2026-05-24 05:10:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality3902402088086517381.gal : 0 ms
[2026-05-24 05:10:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality15939972692275477855.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/CTLCardinality3902402088086517381.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15939972692275477855.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.89376e+10,1.80115,64576,2,15540,5,436789,6,0,430,196066,0


Converting to forward existential form...Done !
original formula: EF((AG((EG((p47!=1)) + (p9==0))) * EX((A((p49==1) U AG((p96==1))) + E(((p109==0)||(p84==1)) U ((p105==0)||(p98==1)))))))
=> equivalent forward existential formula: ([((EY((FwdU(Init,TRUE) * !(E(TRUE U !((EG((p47!=1)) + (p9==0))))))) * !(EG(!(!(E(TRUE U !((p96==1)))))))) * !(E...375
Reverse transition relation is NOT exact ! Due to transitions t25, t27, t29, t31, t33, t34, t36, t38, t40, t42, t44, t102, t103, t104, t105, t106, t107, t1...288
Detected timeout of ITS tools.
[2026-05-24 05:11:01] [INFO ] Flatten gal took : 3 ms
[2026-05-24 05:11:01] [INFO ] Applying decomposition
[2026-05-24 05:11:01] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15485847945585542778.txt' '-o' '/tmp/graph15485847945585542778.bin' '-w' '/tmp/graph15485847945585542778.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15485847945585542778.bin' '-l' '-1' '-v' '-w' '/tmp/graph15485847945585542778.weights' '-q' '0' '-e' '0.001'
[2026-05-24 05:11:01] [INFO ] Decomposing Gal with order
[2026-05-24 05:11:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 05:11:01] [INFO ] Removed a total of 62 redundant transitions.
[2026-05-24 05:11:01] [INFO ] Flatten gal took : 6 ms
[2026-05-24 05:11:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 2 ms.
[2026-05-24 05:11:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality9628865444319619501.gal : 1 ms
[2026-05-24 05:11:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality16965330522949869125.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/CTLCardinality9628865444319619501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16965330522949869125.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.89376e+10,0.15044,10980,418,82,15521,1763,186,31290,45,7731,0


Converting to forward existential form...Done !
original formula: EF((AG((EG((i6.u10.p47!=1)) + (i1.u2.p9==0))) * EX((A((i6.u10.p49==1) U AG((i11.u19.p96==1))) + E(((i12.u22.p109==0)||(i2.u17.p84==1)) U ...197
=> equivalent forward existential formula: ([((EY((FwdU(Init,TRUE) * !(E(TRUE U !((EG((i6.u10.p47!=1)) + (i1.u2.p9==0))))))) * !(EG(!(!(E(TRUE U !((i11.u19...463
Reverse transition relation is NOT exact ! Due to transitions t25, t27, t31, t34, t38, t40, t42, t44, i0.t33, i0.t29, i0.u0.t107, i0.u5.t106, i0.u13.t104, ...368
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 1
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 12
(forward)formula 0,1,1.44579,66712,1,0,139373,19010,1204,268239,268,95380,118324
FORMULA DiscoveryGPU-PT-11a-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 136/136 transitions.
Graph (complete) has 300 edges and 105 vertex of which 98 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 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 109 edges and 95 vertex of which 78 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Graph (trivial) has 85 edges and 78 vertex of which 42 / 78 are part of one of the 21 SCC in 0 ms
Free SCC test removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 57 transition count 101
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 47 place count 47 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 46 transition count 79
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 57 place count 37 transition count 61
Iterating global reduction 3 with 9 rules applied. Total rules applied 66 place count 37 transition count 61
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 75 place count 28 transition count 43
Iterating global reduction 3 with 9 rules applied. Total rules applied 84 place count 28 transition count 43
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 92 place count 20 transition count 27
Iterating global reduction 3 with 8 rules applied. Total rules applied 100 place count 20 transition count 27
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 108 place count 12 transition count 19
Iterating global reduction 3 with 8 rules applied. Total rules applied 116 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 3 with 1 rules applied. Total rules applied 117 place count 12 transition count 18
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 119 place count 11 transition count 17
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 8 transition count 14
Applied a total of 122 rules in 7 ms. Remains 8 /105 variables (removed 97) and now considering 14/136 (removed 122) transitions.
[2026-05-24 05:11:02] [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-6221290156676242342.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10831596171088801825.kers'
[2026-05-24 05:11:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6221290156676242342.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10831596171088801825.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 05:11:02] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10831596171088801825.kers
Total runtime 0 ms.
[2026-05-24 05:11:02] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-24 05:11:02] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2026-05-24 05:11:02] [INFO ] Invariant cache hit.
[2026-05-24 05:11:02] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2026-05-24 05:11:02] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2026-05-24 05:11:02] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2026-05-24 05:11:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/18 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/19 variables, and 8 constraints, problems are : Problem set: 0 solved, 9 unsolved in 61 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 3/18 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/19 variables, and 17 constraints, problems are : Problem set: 0 solved, 9 unsolved in 71 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 160ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 161ms
Starting structural reductions in SI_CTL mode, iteration 1 : 8/105 places, 14/136 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 231 ms. Remains : 8/105 places, 14/136 transitions.
[2026-05-24 05:11:02] [INFO ] Flatten gal took : 1 ms
[2026-05-24 05:11:02] [INFO ] Flatten gal took : 1 ms
[2026-05-24 05:11:02] [INFO ] Input system was already deterministic with 14 transitions.
[2026-05-24 05:11:02] [INFO ] Flatten gal took : 1 ms
[2026-05-24 05:11:02] [INFO ] Flatten gal took : 0 ms
[2026-05-24 05:11:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality3663418488151919855.gal : 1 ms
[2026-05-24 05:11:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality6611230430552956924.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/CTLCardinality3663418488151919855.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6611230430552956924.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,875,0.003189,3852,2,30,5,310,6,0,40,372,0


Converting to forward existential form...Done !
original formula: EF(AG((AF(AG((p13!=0))) + (p38==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(EG(!(!(E(TRUE U !((p13!=0))))))) + (p38==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t11, t13, Intersection with reachable at each step enabled. (destroyed/reverse/inter...177
(forward)formula 0,0,0.016833,4412,1,0,81,2293,50,47,230,2902,113
FORMULA DiscoveryGPU-PT-11a-CTLCardinality-2024-14 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 : 105/105 places, 136/136 transitions.
Graph (complete) has 300 edges and 105 vertex of which 98 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 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 109 edges and 95 vertex of which 81 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 14 output transitions
Drop transitions (Output transitions of discarded places.) removed 14 transitions
Graph (trivial) has 88 edges and 81 vertex of which 44 / 81 are part of one of the 22 SCC in 0 ms
Free SCC test removed 22 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 59 transition count 104
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 47 place count 49 transition count 82
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 55 place count 41 transition count 66
Iterating global reduction 2 with 8 rules applied. Total rules applied 63 place count 41 transition count 66
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 70 place count 34 transition count 52
Iterating global reduction 2 with 7 rules applied. Total rules applied 77 place count 34 transition count 52
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 84 place count 27 transition count 38
Iterating global reduction 2 with 7 rules applied. Total rules applied 91 place count 27 transition count 38
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 98 place count 20 transition count 31
Iterating global reduction 2 with 7 rules applied. Total rules applied 105 place count 20 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 20 transition count 29
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 108 place count 20 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 109 place count 19 transition count 28
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 113 place count 15 transition count 24
Applied a total of 113 rules in 7 ms. Remains 15 /105 variables (removed 90) and now considering 24/136 (removed 112) transitions.
[2026-05-24 05:11:02] [INFO ] Flow matrix only has 18 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7985570427175377246.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-779695188562925897.kers'
[2026-05-24 05:11:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7985570427175377246.kers, --Pflows, --basisKERS=/tmp/petrispot-output-779695188562925897.kers]
Normalized transition count is 17 out of 18 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 17 rows 15 cols 29 entries
Finished phase 1 with 15 SingleSign rule and 0 generalized
[2026-05-24 05:11:02] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-779695188562925897.kers
Total runtime 0 ms.
[2026-05-24 05:11:02] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-24 05:11:02] [INFO ] Flow matrix only has 18 transitions (discarded 6 similar events)
[2026-05-24 05:11:02] [INFO ] Invariant cache hit.
[2026-05-24 05:11:02] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2026-05-24 05:11:02] [INFO ] Redundant transitions in 1 ms returned []
Running 16 sub problems to find dead transitions.
[2026-05-24 05:11:02] [INFO ] Flow matrix only has 18 transitions (discarded 6 similar events)
[2026-05-24 05:11:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 4/32 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 0/32 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/33 variables, and 15 constraints, problems are : Problem set: 0 solved, 16 unsolved in 132 ms.
Refiners :[State Equation: 15/15 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 16/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 4/32 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 0/32 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/33 variables, and 31 constraints, problems are : Problem set: 0 solved, 16 unsolved in 134 ms.
Refiners :[State Equation: 15/15 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 268ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 268ms
Starting structural reductions in SI_CTL mode, iteration 1 : 15/105 places, 24/136 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 335 ms. Remains : 15/105 places, 24/136 transitions.
[2026-05-24 05:11:03] [INFO ] Flatten gal took : 0 ms
[2026-05-24 05:11:03] [INFO ] Flatten gal took : 0 ms
[2026-05-24 05:11:03] [INFO ] Input system was already deterministic with 24 transitions.
[2026-05-24 05:11:03] [INFO ] Flatten gal took : 0 ms
[2026-05-24 05:11:03] [INFO ] Flatten gal took : 0 ms
[2026-05-24 05:11:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality5681462834231716710.gal : 0 ms
[2026-05-24 05:11:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality4279368193518080400.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/CTLCardinality5681462834231716710.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4279368193518080400.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,6804,0.005979,3876,2,35,5,309,6,0,71,341,0


Converting to forward existential form...Done !
original formula: E(((p42==0)||(p52==1)) U AG((p16==1)))
=> equivalent forward existential formula: [(FwdU(Init,((p42==0)||(p52==1))) * !(E(TRUE U !((p16==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t10, t19, t21, t22, t23, Intersection with reachable at each step enabled. (destroyed/re...188
(forward)formula 0,0,0.010449,4148,1,0,44,1133,63,23,378,1121,54
FORMULA DiscoveryGPU-PT-11a-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-24 05:11:03] [INFO ] Flatten gal took : 2 ms
[2026-05-24 05:11:03] [INFO ] Flatten gal took : 3 ms
Total runtime 180454 ms.

BK_STOP 1779599463234

--------------------
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-11a"
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-11a, 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-177955695500313"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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