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.r354-tall-178024402800081.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 LastZero-PT-N08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402800081
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 860K
-rw-r--r-- 1 mcc users 9.2K May 27 10:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 27 10:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 27 10:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 27 10:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 22K May 27 10:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 27 10:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 27 10:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 13K May 27 10:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K May 27 10:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 27 10:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K May 27 10:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K May 27 10:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K May 27 10:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 4 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 273K Jun 10 11:58 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 LastZero-PT-N08-CTLCardinality-2024-00
FORMULA_NAME LastZero-PT-N08-CTLCardinality-2024-01
FORMULA_NAME LastZero-PT-N08-CTLCardinality-2024-02
FORMULA_NAME LastZero-PT-N08-CTLCardinality-2024-03
FORMULA_NAME LastZero-PT-N08-CTLCardinality-2024-04
FORMULA_NAME LastZero-PT-N08-CTLCardinality-2024-05
FORMULA_NAME LastZero-PT-N08-CTLCardinality-2024-06
FORMULA_NAME LastZero-PT-N08-CTLCardinality-2024-07
FORMULA_NAME LastZero-PT-N08-CTLCardinality-2024-08
FORMULA_NAME LastZero-PT-N08-CTLCardinality-2024-09
FORMULA_NAME LastZero-PT-N08-CTLCardinality-2024-10
FORMULA_NAME LastZero-PT-N08-CTLCardinality-2024-11
FORMULA_NAME LastZero-PT-N08-CTLCardinality-2024-12
FORMULA_NAME LastZero-PT-N08-CTLCardinality-2024-13
FORMULA_NAME LastZero-PT-N08-CTLCardinality-2024-14
FORMULA_NAME LastZero-PT-N08-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1781099660930

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LastZero-PT-N08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-06-10 13:54:22] [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-06-10 13:54:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-10 13:54:22] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2026-06-10 13:54:22] [INFO ] Transformed 180 places.
[2026-06-10 13:54:22] [INFO ] Transformed 857 transitions.
[2026-06-10 13:54:22] [INFO ] Parsed PT model containing 180 places and 857 transitions and 2699 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Deduced a syphon composed of 82 places in 5 ms
Reduce places removed 82 places and 545 transitions.
Reduce places removed 1 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA LastZero-PT-N08-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 312/312 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 96 transition count 312
Applied a total of 1 rules in 16 ms. Remains 96 /97 variables (removed 1) and now considering 312/312 (removed 0) transitions.
[2026-06-10 13:54:22] [INFO ] Flow matrix only has 284 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11824443322828393990.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15299105491359267790.kers'
[2026-06-10 13:54:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11824443322828393990.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15299105491359267790.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 284 rows 95 cols 734 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-06-10 13:54:22] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15299105491359267790.kers
Total runtime 1 ms.
[2026-06-10 13:54:22] [INFO ] Implicit Places using invariants in 261 ms returned []
[2026-06-10 13:54:22] [INFO ] Flow matrix only has 284 transitions (discarded 28 similar events)
[2026-06-10 13:54:22] [INFO ] Invariant cache hit.
[2026-06-10 13:54:22] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-06-10 13:54:22] [INFO ] Implicit Places using invariants and state equation in 304 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 605 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 95/97 places, 312/312 transitions.
Applied a total of 0 rules in 3 ms. Remains 95 /95 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 640 ms. Remains : 95/97 places, 312/312 transitions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 312/312 transitions.
Applied a total of 0 rules in 17 ms. Remains 95 /95 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2026-06-10 13:54:22] [INFO ] Flow matrix only has 284 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2483820673026126605.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18030010799878645133.kers'
[2026-06-10 13:54:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2483820673026126605.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18030010799878645133.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 284 rows 94 cols 726 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-06-10 13:54:22] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18030010799878645133.kers
Total runtime 1 ms.
[2026-06-10 13:54:23] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-06-10 13:54:23] [INFO ] Flow matrix only has 284 transitions (discarded 28 similar events)
[2026-06-10 13:54:23] [INFO ] Invariant cache hit.
[2026-06-10 13:54:23] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-06-10 13:54:23] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2026-06-10 13:54:23] [INFO ] Flow matrix only has 284 transitions (discarded 28 similar events)
[2026-06-10 13:54:23] [INFO ] Invariant cache hit.
[2026-06-10 13:54:23] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
At refinement iteration 2 (OVERLAPS) 284/378 variables, 94/101 constraints. Problems are: Problem set: 203 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 72/173 constraints. Problems are: Problem set: 203 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 0/173 constraints. Problems are: Problem set: 203 solved, 101 unsolved
Problem TDEAD73 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/379 variables, 1/174 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 0/174 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/379 variables, 0/174 constraints. Problems are: Problem set: 204 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 174 constraints, problems are : Problem set: 204 solved, 100 unsolved in 9654 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 204 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 7/7 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 284/378 variables, 94/101 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 72/173 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 100/273 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 0/273 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 1/379 variables, 1/274 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 0/274 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/379 variables, 0/274 constraints. Problems are: Problem set: 204 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 274 constraints, problems are : Problem set: 204 solved, 100 unsolved in 6765 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 100/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16532ms problems are : Problem set: 204 solved, 100 unsolved
Search for dead transitions found 204 dead transitions in 16546ms
Found 204 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 204 transitions
Dead transitions reduction (with SMT) removed 204 transitions
Starting structural reductions in LTL mode, iteration 1 : 95/95 places, 108/312 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 94 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 94 transition count 107
Applied a total of 2 rules in 3 ms. Remains 94 /95 variables (removed 1) and now considering 107/108 (removed 1) transitions.
[2026-06-10 13:54:39] [INFO ] Flow matrix only has 80 transitions (discarded 27 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9571245164643535761.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13078479818774645521.kers'
[2026-06-10 13:54:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9571245164643535761.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13078479818774645521.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 80 rows 93 cols 186 entries
Finished phase 1 with 78 SingleSign rule and 1 generalized
[2026-06-10 13:54:39] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13078479818774645521.kers
Total runtime 1 ms.
[2026-06-10 13:54:39] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-06-10 13:54:39] [INFO ] Flow matrix only has 80 transitions (discarded 27 similar events)
[2026-06-10 13:54:39] [INFO ] Invariant cache hit.
[2026-06-10 13:54:39] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-06-10 13:54:39] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 94/95 places, 107/312 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17019 ms. Remains : 94/95 places, 107/312 transitions.
Support contains 56 out of 94 places after structural reductions.
[2026-06-10 13:54:40] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2026-06-10 13:54:40] [INFO ] Flatten gal took : 27 ms
[2026-06-10 13:54:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA LastZero-PT-N08-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N08-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N08-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N08-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N08-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N08-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 13:54:40] [INFO ] Flatten gal took : 10 ms
[2026-06-10 13:54:40] [INFO ] Input system was already deterministic with 107 transitions.
Support contains 40 out of 94 places (down from 56) after GAL structural reductions.
RANDOM walk for 40000 steps (1600 resets) in 3267 ms. (12 steps per ms) remains 15/37 properties
BEST_FIRST walk for 4002 steps (32 resets) in 47 ms. (83 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (32 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 37 ms. (105 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (32 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (32 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (32 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (32 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (32 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
[2026-06-10 13:54:41] [INFO ] Flow matrix only has 80 transitions (discarded 27 similar events)
[2026-06-10 13:54:41] [INFO ] Invariant cache hit.
[2026-06-10 13:54:41] [INFO ] State equation strengthened by 36 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 55/70 variables, 9/9 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 7/16 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/16 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/72 variables, 2/18 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/18 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 62/134 variables, 72/90 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 20/110 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/110 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 14/148 variables, 14/124 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/124 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 25/173 variables, 21/145 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/173 variables, 3/148 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/173 variables, 2/150 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/173 variables, 0/150 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 1/174 variables, 1/151 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/174 variables, 1/152 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/174 variables, 0/152 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/174 variables, 0/152 constraints. Problems are: Problem set: 8 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 152 constraints, problems are : Problem set: 8 solved, 7 unsolved in 624 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 39/46 variables, 5/5 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/6 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/6 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 42/88 variables, 46/52 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 13/65 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 7/72 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/72 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 8/96 variables, 8/80 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/80 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 21/117 variables, 15/95 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/117 variables, 1/96 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/117 variables, 1/97 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/117 variables, 5/102 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/117 variables, 0/102 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 1/118 variables, 1/103 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/118 variables, 1/104 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/118 variables, 0/104 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 2/120 variables, 1/105 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/120 variables, 0/105 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 2/122 variables, 1/106 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/122 variables, 0/106 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 2/124 variables, 1/107 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/124 variables, 0/107 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 24 (OVERLAPS) 2/126 variables, 1/108 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/126 variables, 0/108 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 26 (OVERLAPS) 10/136 variables, 8/116 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/136 variables, 0/116 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 34/170 variables, 24/140 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/170 variables, 4/144 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/170 variables, 6/150 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/170 variables, 0/150 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 32 (OVERLAPS) 3/173 variables, 3/153 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/173 variables, 3/156 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/173 variables, 1/157 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/173 variables, 0/157 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 36 (OVERLAPS) 1/174 variables, 1/158 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/174 variables, 1/159 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/174 variables, 0/159 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 39 (OVERLAPS) 0/174 variables, 0/159 constraints. Problems are: Problem set: 8 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 159 constraints, problems are : Problem set: 8 solved, 7 unsolved in 618 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 7/15 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1245ms problems are : Problem set: 8 solved, 7 unsolved
Fused 7 Parikh solutions to 5 different solutions.
Finished Parikh walk after 14 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 7 properties in 71 ms.
Successfully simplified 8 atomic propositions for a total of 9 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA LastZero-PT-N08-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N08-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 13:54:42] [INFO ] Flatten gal took : 7 ms
[2026-06-10 13:54:42] [INFO ] Flatten gal took : 7 ms
[2026-06-10 13:54:42] [INFO ] Input system was already deterministic with 107 transitions.
Computed a total of 94 stabilizing places and 107 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 94 transition count 107
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
FORMULA LastZero-PT-N08-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 107/107 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 87 transition count 100
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 87 transition count 100
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 82 transition count 95
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 82 transition count 95
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 77 transition count 85
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 77 transition count 85
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 73 transition count 81
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 73 transition count 81
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 70 transition count 75
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 70 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 67 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 67 transition count 72
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 65 transition count 68
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 65 transition count 68
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 63 transition count 66
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 62 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 62 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 61 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 61 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 60 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 60 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 59 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 59 transition count 60
Applied a total of 70 rules in 17 ms. Remains 59 /94 variables (removed 35) and now considering 60/107 (removed 47) transitions.
[2026-06-10 13:54:42] [INFO ] Flow matrix only has 46 transitions (discarded 14 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8898230327675412114.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9280800236683908903.kers'
[2026-06-10 13:54:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8898230327675412114.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9280800236683908903.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 46 rows 58 cols 107 entries
Finished phase 1 with 43 SingleSign rule and 1 generalized
[2026-06-10 13:54:42] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9280800236683908903.kers
Total runtime 0 ms.
[2026-06-10 13:54:42] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-06-10 13:54:42] [INFO ] Flow matrix only has 46 transitions (discarded 14 similar events)
[2026-06-10 13:54:42] [INFO ] Invariant cache hit.
[2026-06-10 13:54:42] [INFO ] State equation strengthened by 19 read => feed constraints.
[2026-06-10 13:54:42] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2026-06-10 13:54:42] [INFO ] Flow matrix only has 46 transitions (discarded 14 similar events)
[2026-06-10 13:54:42] [INFO ] Invariant cache hit.
[2026-06-10 13:54:42] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 46/105 variables, 59/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 19/108 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 0/105 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 108 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1540 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 46/105 variables, 59/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 19/108 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 52/160 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 0/105 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 160 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1074 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2621ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 2621ms
Starting structural reductions in LTL mode, iteration 1 : 59/94 places, 60/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2763 ms. Remains : 59/94 places, 60/107 transitions.
[2026-06-10 13:54:45] [INFO ] Flatten gal took : 6 ms
[2026-06-10 13:54:45] [INFO ] Flatten gal took : 5 ms
[2026-06-10 13:54:45] [INFO ] Input system was already deterministic with 60 transitions.
[2026-06-10 13:54:45] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:54:45] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:54:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality17763666179480896847.gal : 2 ms
[2026-06-10 13:54:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality16822951881238880468.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/CTLCardinality17763666179480896847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16822951881238880468.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,22913,0.01871,4204,2,311,5,958,6,0,249,547,0


Converting to forward existential form...Done !
original formula: AG(((tmp_8_7>=1) + (AF((EF((tmp_4_3>=1)) + AF((tmp_9_6<=0)))) * AG(E(EF((array_6_3>=1)) U EX(TRUE))))))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * !((tmp_8_7>=1))),!((E(TRUE U (tmp_4_3>=1)) + !(EG(!((tmp_9_6<=0)))))))] = FALSE * [(Fw...254
Reverse transition relation is NOT exact ! Due to transitions t0, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t58,...259
(forward)formula 0,0,0.068149,7256,1,0,166,19849,147,77,1682,15115,152
FORMULA LastZero-PT-N08-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 107/107 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 88 transition count 101
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 88 transition count 101
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 82 transition count 95
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 82 transition count 95
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 78 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 78 transition count 87
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 74 transition count 83
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 74 transition count 83
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 71 transition count 77
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 71 transition count 77
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 68 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 68 transition count 74
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 66 transition count 70
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 66 transition count 70
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 64 transition count 68
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 64 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 63 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 62 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 61 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 61 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 60 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 60 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 59 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 59 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 58 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 58 transition count 59
Applied a total of 72 rules in 16 ms. Remains 58 /94 variables (removed 36) and now considering 59/107 (removed 48) transitions.
[2026-06-10 13:54:45] [INFO ] Flow matrix only has 44 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1975627045772704159.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7485201015249897384.kers'
[2026-06-10 13:54:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1975627045772704159.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7485201015249897384.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 44 rows 56 cols 101 entries
Finished phase 1 with 41 SingleSign rule and 2 generalized
[2026-06-10 13:54:45] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7485201015249897384.kers
Total runtime 0 ms.
[2026-06-10 13:54:45] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-06-10 13:54:45] [INFO ] Flow matrix only has 44 transitions (discarded 15 similar events)
[2026-06-10 13:54:45] [INFO ] Invariant cache hit.
[2026-06-10 13:54:45] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-06-10 13:54:45] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 51 sub problems to find dead transitions.
[2026-06-10 13:54:45] [INFO ] Flow matrix only has 44 transitions (discarded 15 similar events)
[2026-06-10 13:54:45] [INFO ] Invariant cache hit.
[2026-06-10 13:54:45] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 14/28 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 1/58 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 44/102 variables, 58/87 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 18/105 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 105 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1689 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 14/28 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 1/58 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 44/102 variables, 58/87 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 18/105 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 51/156 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 156 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1011 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2705ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 2706ms
Starting structural reductions in LTL mode, iteration 1 : 58/94 places, 59/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2831 ms. Remains : 58/94 places, 59/107 transitions.
[2026-06-10 13:54:48] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:54:48] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:54:48] [INFO ] Input system was already deterministic with 59 transitions.
[2026-06-10 13:54:48] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:54:48] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:54:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality18134186465150189562.gal : 1 ms
[2026-06-10 13:54:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality15719923252124704594.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/CTLCardinality18134186465150189562.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15719923252124704594.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,20242,0.018896,4288,2,320,5,962,6,0,244,546,0


Converting to forward existential form...Done !
original formula: E((!((EX(TRUE) + (array_8_5<=0))) + EX((array_4_2<=0))) U ((array_7_5>=1)&&(tmp_9_7>0)))
=> equivalent forward existential formula: [(FwdU(Init,(!((EX(TRUE) + (array_8_5<=0))) + EX((array_4_2<=0)))) * ((array_7_5>=1)&&(tmp_9_7>0)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t58,...254
(forward)formula 0,0,0.099987,8648,1,0,226,27999,140,118,1550,27570,207
FORMULA LastZero-PT-N08-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 107/107 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 89 transition count 102
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 89 transition count 102
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 86 transition count 99
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 86 transition count 99
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 83 transition count 93
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 83 transition count 93
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 80 transition count 90
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 80 transition count 90
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 78 transition count 86
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 78 transition count 86
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 76 transition count 84
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 76 transition count 84
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 74 transition count 80
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 74 transition count 80
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 72 transition count 78
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 72 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 71 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 71 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 70 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 70 transition count 75
Applied a total of 48 rules in 16 ms. Remains 70 /94 variables (removed 24) and now considering 75/107 (removed 32) transitions.
[2026-06-10 13:54:48] [INFO ] Flow matrix only has 56 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2605034457341482234.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9887612471069197557.kers'
[2026-06-10 13:54:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2605034457341482234.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9887612471069197557.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 56 rows 69 cols 130 entries
Finished phase 1 with 54 SingleSign rule and 1 generalized
[2026-06-10 13:54:48] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9887612471069197557.kers
Total runtime 0 ms.
[2026-06-10 13:54:48] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-06-10 13:54:48] [INFO ] Flow matrix only has 56 transitions (discarded 19 similar events)
[2026-06-10 13:54:48] [INFO ] Invariant cache hit.
[2026-06-10 13:54:48] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-06-10 13:54:48] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 67 sub problems to find dead transitions.
[2026-06-10 13:54:48] [INFO ] Flow matrix only has 56 transitions (discarded 19 similar events)
[2026-06-10 13:54:48] [INFO ] Invariant cache hit.
[2026-06-10 13:54:48] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 1/70 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 56/126 variables, 70/106 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 24/130 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (OVERLAPS) 0/126 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 130 constraints, problems are : Problem set: 0 solved, 67 unsolved in 2628 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (OVERLAPS) 1/70 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 56/126 variables, 70/106 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 24/130 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 67/197 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (OVERLAPS) 0/126 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 197 constraints, problems are : Problem set: 0 solved, 67 unsolved in 1675 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4310ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 4310ms
Starting structural reductions in LTL mode, iteration 1 : 70/94 places, 75/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4440 ms. Remains : 70/94 places, 75/107 transitions.
[2026-06-10 13:54:53] [INFO ] Flatten gal took : 6 ms
[2026-06-10 13:54:53] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:54:53] [INFO ] Input system was already deterministic with 75 transitions.
[2026-06-10 13:54:53] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:54:53] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:54:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality10684392946208277446.gal : 1 ms
[2026-06-10 13:54:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality11741366494821759364.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/CTLCardinality10684392946208277446.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11741366494821759364.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,26711,0.022891,4444,2,467,5,1300,6,0,296,721,0


Converting to forward existential form...Done !
original formula: AF(AG((AG((AX(FALSE) * AX((array_9_8>=1)))) + (((array_3_2<=array_9_4)&&(array_2_2<=tmp_9_9)) * ((EX(TRUE) + (process_6<1)) + ((array_3_1...180
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((!(E(TRUE U !((!(EX(!(FALSE))) * !(EX(!((array_9_8>=1)))))))) + (((array_3_2<=array_9_...261
Reverse transition relation is NOT exact ! Due to transitions t0, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68,...284
dead was empty
(forward)formula 0,1,0.141211,10928,1,0,222,36906,177,95,1993,32888,202
FORMULA LastZero-PT-N08-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 107/107 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 87 transition count 100
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 87 transition count 100
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 82 transition count 95
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 82 transition count 95
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 77 transition count 85
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 77 transition count 85
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 72 transition count 80
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 72 transition count 80
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 68 transition count 72
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 68 transition count 72
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 64 transition count 68
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 64 transition count 68
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 61 transition count 62
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 61 transition count 62
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 58 transition count 59
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 58 transition count 59
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 55 transition count 53
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 55 transition count 53
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 81 place count 52 transition count 50
Iterating global reduction 0 with 3 rules applied. Total rules applied 84 place count 52 transition count 50
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 50 transition count 46
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 50 transition count 46
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 90 place count 48 transition count 44
Iterating global reduction 0 with 2 rules applied. Total rules applied 92 place count 48 transition count 44
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 47 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 47 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 46 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 46 transition count 41
Applied a total of 96 rules in 17 ms. Remains 46 /94 variables (removed 48) and now considering 41/107 (removed 66) transitions.
[2026-06-10 13:54:53] [INFO ] Flow matrix only has 32 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12335957722457181646.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2609059967262244262.kers'
[2026-06-10 13:54:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12335957722457181646.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2609059967262244262.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 32 rows 42 cols 69 entries
Finished phase 1 with 27 SingleSign rule and 4 generalized
[2026-06-10 13:54:53] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2609059967262244262.kers
Total runtime 0 ms.
[2026-06-10 13:54:53] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-06-10 13:54:53] [INFO ] Flow matrix only has 32 transitions (discarded 9 similar events)
[2026-06-10 13:54:53] [INFO ] Invariant cache hit.
[2026-06-10 13:54:53] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-06-10 13:54:53] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Running 33 sub problems to find dead transitions.
[2026-06-10 13:54:53] [INFO ] Flow matrix only has 32 transitions (discarded 9 similar events)
[2026-06-10 13:54:53] [INFO ] Invariant cache hit.
[2026-06-10 13:54:53] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 32/78 variables, 46/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 12/77 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/78 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 77 constraints, problems are : Problem set: 0 solved, 33 unsolved in 748 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 46/46 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 32/78 variables, 46/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 12/77 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 33/110 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/78 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 110 constraints, problems are : Problem set: 0 solved, 33 unsolved in 513 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 46/46 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1265ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 1265ms
Starting structural reductions in LTL mode, iteration 1 : 46/94 places, 41/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1371 ms. Remains : 46/94 places, 41/107 transitions.
[2026-06-10 13:54:54] [INFO ] Flatten gal took : 5 ms
[2026-06-10 13:54:54] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:54:54] [INFO ] Input system was already deterministic with 41 transitions.
[2026-06-10 13:54:54] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:54:54] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:54:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality1046877199088106852.gal : 1 ms
[2026-06-10 13:54:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality4724946021891357468.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/CTLCardinality1046877199088106852.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4724946021891357468.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,15388,0.011408,4112,2,178,5,604,6,0,190,359,0


Converting to forward existential form...Done !
original formula: EF(EG(AF(EX((tmp_9_5>lastzero_6)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!(EX((tmp_9_5>lastzero_6))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38, t39, t40, Intersection with reachable ...224
dead was empty
(forward)formula 0,0,0.086603,8668,1,0,250,27398,103,144,1153,32777,241
FORMULA LastZero-PT-N08-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 107/107 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 88 transition count 101
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 88 transition count 101
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 83 transition count 96
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 83 transition count 96
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 78 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 78 transition count 86
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 74 transition count 82
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 74 transition count 82
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 70 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 70 transition count 74
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 66 transition count 70
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 66 transition count 70
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 63 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 63 transition count 64
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 60 transition count 61
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 60 transition count 61
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 58 transition count 57
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 58 transition count 57
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 56 transition count 55
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 56 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 55 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 55 transition count 53
Applied a total of 78 rules in 6 ms. Remains 55 /94 variables (removed 39) and now considering 53/107 (removed 54) transitions.
[2026-06-10 13:54:54] [INFO ] Flow matrix only has 42 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10818223357141903452.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16786619508008911293.kers'
[2026-06-10 13:54:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10818223357141903452.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16786619508008911293.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 42 rows 54 cols 97 entries
Finished phase 1 with 39 SingleSign rule and 1 generalized
[2026-06-10 13:54:54] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16786619508008911293.kers
Total runtime 1 ms.
[2026-06-10 13:54:54] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-06-10 13:54:54] [INFO ] Flow matrix only has 42 transitions (discarded 11 similar events)
[2026-06-10 13:54:54] [INFO ] Invariant cache hit.
[2026-06-10 13:54:54] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-06-10 13:54:54] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 45 sub problems to find dead transitions.
[2026-06-10 13:54:54] [INFO ] Flow matrix only has 42 transitions (discarded 11 similar events)
[2026-06-10 13:54:54] [INFO ] Invariant cache hit.
[2026-06-10 13:54:54] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 1/55 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 42/97 variables, 55/79 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 0/97 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 96 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1041 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 1/55 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 42/97 variables, 55/79 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 45/141 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 0/97 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 141 constraints, problems are : Problem set: 0 solved, 45 unsolved in 818 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1863ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 1864ms
Starting structural reductions in LTL mode, iteration 1 : 55/94 places, 53/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1969 ms. Remains : 55/94 places, 53/107 transitions.
[2026-06-10 13:54:56] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:54:56] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:54:56] [INFO ] Input system was already deterministic with 53 transitions.
[2026-06-10 13:54:56] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:54:56] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:54:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality16939372104784721146.gal : 0 ms
[2026-06-10 13:54:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality9353394096036532524.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/CTLCardinality16939372104784721146.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9353394096036532524.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,17274,0.009557,4236,2,251,5,818,6,0,230,480,0


Converting to forward existential form...Done !
original formula: !(E((tmp_4_4<1) U (((EF((array_4_3<=0)) * AF((array_9_8>=1))) * (AG((array_3_1<=0)) * EX(TRUE))) * ((tmp_8_2<=1)&&(array_9_8<1)))))
=> equivalent forward existential formula: [(EY((((FwdU(Init,(tmp_4_4<1)) * ((tmp_8_2<=1)&&(array_9_8<1))) * (E(TRUE U (array_4_3<=0)) * !(EG(!((array_9_8>...215
Reverse transition relation is NOT exact ! Due to transitions t0, t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, Int...249
(forward)formula 0,1,0.106494,10104,1,0,280,33905,136,134,1499,36505,299
FORMULA LastZero-PT-N08-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 107/107 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 90 transition count 103
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 90 transition count 103
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 86 transition count 99
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 86 transition count 99
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 83 transition count 93
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 83 transition count 93
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 80 transition count 90
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 80 transition count 90
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 77 transition count 84
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 77 transition count 84
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 74 transition count 81
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 74 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 73 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 73 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 72 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 72 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 71 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 71 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 70 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 70 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 69 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 69 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 68 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 68 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 67 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 67 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 66 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 66 transition count 69
Applied a total of 56 rules in 17 ms. Remains 66 /94 variables (removed 28) and now considering 69/107 (removed 38) transitions.
[2026-06-10 13:54:56] [INFO ] Flow matrix only has 52 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3465345025249373593.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-482249934207572877.kers'
[2026-06-10 13:54:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3465345025249373593.kers, --Pflows, --basisKERS=/tmp/petrispot-output-482249934207572877.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 52 rows 64 cols 119 entries
Finished phase 1 with 49 SingleSign rule and 2 generalized
[2026-06-10 13:54:56] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-482249934207572877.kers
Total runtime 0 ms.
[2026-06-10 13:54:56] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-06-10 13:54:56] [INFO ] Flow matrix only has 52 transitions (discarded 17 similar events)
[2026-06-10 13:54:56] [INFO ] Invariant cache hit.
[2026-06-10 13:54:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-06-10 13:54:56] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2026-06-10 13:54:56] [INFO ] Flow matrix only has 52 transitions (discarded 17 similar events)
[2026-06-10 13:54:56] [INFO ] Invariant cache hit.
[2026-06-10 13:54:56] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/66 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 52/118 variables, 66/100 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 22/122 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 0/118 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 122 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2341 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 52/118 variables, 66/101 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 22/123 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 61/184 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/118 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 184 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1617 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3967ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 3967ms
Starting structural reductions in LTL mode, iteration 1 : 66/94 places, 69/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4100 ms. Remains : 66/94 places, 69/107 transitions.
[2026-06-10 13:55:00] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:55:00] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:55:00] [INFO ] Input system was already deterministic with 69 transitions.
[2026-06-10 13:55:00] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:55:00] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:55:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality12730303821849130512.gal : 2 ms
[2026-06-10 13:55:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality7680980107122855811.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/CTLCardinality12730303821849130512.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7680980107122855811.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,37552,0.015559,4384,2,431,5,1195,6,0,278,655,0


Converting to forward existential form...Done !
original formula: (E((tmp_9_5<=0) U AF((array_9_5<=0))) * !(A(AF(AG((array_9_3>=1))) U (((((process_5>=1)||(tmp_6_4>=1))&&(process_6>=1)) + !(AX((tmp_9_7<=...181
=> equivalent forward existential formula: (([(((FwdU((Init * E((tmp_9_5<=0) U !(EG(!((array_9_5<=0)))))),!((((((process_5>=1)||(tmp_6_4>=1))&&(process_6>=...761
Reverse transition relation is NOT exact ! Due to transitions t0, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t63, t64,...274
(forward)formula 0,1,0.263776,16644,1,0,417,71797,180,234,1956,78682,420
FORMULA LastZero-PT-N08-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-06-10 13:55:01] [INFO ] Flatten gal took : 8 ms
[2026-06-10 13:55:01] [INFO ] Flatten gal took : 4 ms
Total runtime 39231 ms.

BK_STOP 1781099701322

--------------------
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="LastZero-PT-N08"
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 LastZero-PT-N08, 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 r354-tall-178024402800081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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