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-178024402700011.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-COL-N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402700011
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 6.3K May 27 10:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 27 10:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 27 10:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 27 10:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 27 10:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 27 10:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 27 10:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.8K May 27 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K May 27 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 27 10:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 27 10:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 27 10:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 27 10:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_pt
-rw-r--r-- 1 mcc users 4 May 26 18:17 instance
-rw-r--r-- 1 mcc users 5 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 30K Jun 10 17:28 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-COL-N10-LTLCardinality-00
FORMULA_NAME LastZero-COL-N10-LTLCardinality-01
FORMULA_NAME LastZero-COL-N10-LTLCardinality-02
FORMULA_NAME LastZero-COL-N10-LTLCardinality-03
FORMULA_NAME LastZero-COL-N10-LTLCardinality-04
FORMULA_NAME LastZero-COL-N10-LTLCardinality-05
FORMULA_NAME LastZero-COL-N10-LTLCardinality-06
FORMULA_NAME LastZero-COL-N10-LTLCardinality-07
FORMULA_NAME LastZero-COL-N10-LTLCardinality-08
FORMULA_NAME LastZero-COL-N10-LTLCardinality-09
FORMULA_NAME LastZero-COL-N10-LTLCardinality-10
FORMULA_NAME LastZero-COL-N10-LTLCardinality-11
FORMULA_NAME LastZero-COL-N10-LTLCardinality-12
FORMULA_NAME LastZero-COL-N10-LTLCardinality-13
FORMULA_NAME LastZero-COL-N10-LTLCardinality-14
FORMULA_NAME LastZero-COL-N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1781118214749

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LastZero-COL-N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202604301425
[2026-06-10 19:03:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-10 19:03:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-10 19:03:36] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-06-10 19:03:36] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-06-10 19:03:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 494 ms
[2026-06-10 19:03:36] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 264 PT places and 1573.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2026-06-10 19:03:36] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions 11 arcs in 5 ms.
[2026-06-10 19:03:36] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA LastZero-COL-N10-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 2 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
FORMULA LastZero-COL-N10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-COL-N10-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-COL-N10-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-COL-N10-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40017 steps (1736 resets) in 299 ms. (133 steps per ms) remains 4/14 properties
BEST_FIRST walk for 40000 steps (1000 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1024 resets) in 287 ms. (138 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1000 resets) in 155 ms. (256 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1024 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4973674799638937579.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6868778063907009212.kers'
[2026-06-10 19:03:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4973674799638937579.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6868778063907009212.kers]
Normalized transition count is 2 out of 3 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 2 rows 2 cols 3 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-06-10 19:03:37] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6868778063907009212.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Real declared 4/5 variables, and 2 constraints, problems are : Problem set: 4 solved, 0 unsolved in 131 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 174ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
FORMULA LastZero-COL-N10-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-COL-N10-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 19:03:37] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2026-06-10 19:03:37] [INFO ] Flatten gal took : 13 ms
FORMULA LastZero-COL-N10-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 19:03:37] [INFO ] Flatten gal took : 1 ms
Domain [ID(11), ID(11)] of place array breaks symmetries in sort ID
[2026-06-10 19:03:37] [INFO ] Unfolded HLPN to a Petri net with 264 places and 1531 transitions 4793 arcs in 34 ms.
[2026-06-10 19:03:37] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Deduced a syphon composed of 122 places in 6 ms
Reduce places removed 122 places and 981 transitions.
Reduce places removed 1 places and 0 transitions.
Support contains 65 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 550/550 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 140 transition count 550
Applied a total of 1 rules in 14 ms. Remains 140 /141 variables (removed 1) and now considering 550/550 (removed 0) transitions.
[2026-06-10 19:03:37] [INFO ] Flow matrix only has 505 transitions (discarded 45 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4637216915801120863.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13924861103728296874.kers'
[2026-06-10 19:03:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4637216915801120863.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13924861103728296874.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 505 rows 139 cols 1338 entries
Finished phase 1 with 130 SingleSign rule and 0 generalized
[2026-06-10 19:03:37] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13924861103728296874.kers
Total runtime 4 ms.
[2026-06-10 19:03:37] [INFO ] Implicit Places using invariants in 157 ms returned []
[2026-06-10 19:03:37] [INFO ] Flow matrix only has 505 transitions (discarded 45 similar events)
[2026-06-10 19:03:37] [INFO ] Invariant cache hit.
[2026-06-10 19:03:37] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-06-10 19:03:38] [INFO ] Implicit Places using invariants and state equation in 691 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 868 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/141 places, 550/550 transitions.
Applied a total of 0 rules in 7 ms. Remains 139 /139 variables (removed 0) and now considering 550/550 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 896 ms. Remains : 139/141 places, 550/550 transitions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 550/550 transitions.
Applied a total of 0 rules in 5 ms. Remains 139 /139 variables (removed 0) and now considering 550/550 (removed 0) transitions.
[2026-06-10 19:03:38] [INFO ] Flow matrix only has 505 transitions (discarded 45 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-665205278305094580.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3396932198595283421.kers'
[2026-06-10 19:03:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-665205278305094580.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3396932198595283421.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 505 rows 138 cols 1328 entries
Finished phase 1 with 130 SingleSign rule and 0 generalized
[2026-06-10 19:03:38] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3396932198595283421.kers
Total runtime 2 ms.
[2026-06-10 19:03:38] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-06-10 19:03:38] [INFO ] Flow matrix only has 505 transitions (discarded 45 similar events)
[2026-06-10 19:03:38] [INFO ] Invariant cache hit.
[2026-06-10 19:03:38] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-06-10 19:03:38] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2026-06-10 19:03:38] [INFO ] Flow matrix only has 505 transitions (discarded 45 similar events)
[2026-06-10 19:03:38] [INFO ] Invariant cache hit.
[2026-06-10 19:03:38] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 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 TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 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 TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 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 TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 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
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
At refinement iteration 2 (OVERLAPS) 505/643 variables, 138/147 constraints. Problems are: Problem set: 384 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/643 variables, 110/257 constraints. Problems are: Problem set: 384 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/643 variables, 0/257 constraints. Problems are: Problem set: 384 solved, 156 unsolved
Problem TDEAD110 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/644 variables, 1/258 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/644 variables, 0/258 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/644 variables, 0/258 constraints. Problems are: Problem set: 385 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 644/644 variables, and 258 constraints, problems are : Problem set: 385 solved, 155 unsolved in 28299 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 139/139 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 385 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 9/9 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/9 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 505/643 variables, 138/147 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/643 variables, 110/257 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/643 variables, 155/412 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/643 variables, 0/412 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 1/644 variables, 1/413 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/644 variables, 0/413 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 8 (OVERLAPS) 0/644 variables, 0/413 constraints. Problems are: Problem set: 385 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 644/644 variables, and 413 constraints, problems are : Problem set: 385 solved, 155 unsolved in 19544 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 139/139 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 155/540 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48060ms problems are : Problem set: 385 solved, 155 unsolved
Search for dead transitions found 385 dead transitions in 48068ms
Found 385 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 385 transitions
Dead transitions reduction (with SMT) removed 385 transitions
Starting structural reductions in LTL mode, iteration 1 : 139/139 places, 165/550 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 130 transition count 156
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 130 transition count 156
Applied a total of 18 rules in 6 ms. Remains 130 /139 variables (removed 9) and now considering 156/165 (removed 9) transitions.
[2026-06-10 19:04:26] [INFO ] Flow matrix only has 120 transitions (discarded 36 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3629053639373772342.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5922910182808771600.kers'
[2026-06-10 19:04:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3629053639373772342.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5922910182808771600.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 120 rows 129 cols 283 entries
Finished phase 1 with 110 SingleSign rule and 1 generalized
[2026-06-10 19:04:26] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5922910182808771600.kers
Total runtime 1 ms.
[2026-06-10 19:04:26] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-06-10 19:04:26] [INFO ] Flow matrix only has 120 transitions (discarded 36 similar events)
[2026-06-10 19:04:26] [INFO ] Invariant cache hit.
[2026-06-10 19:04:27] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-06-10 19:04:27] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 130/139 places, 156/550 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48870 ms. Remains : 130/139 places, 156/550 transitions.
Support contains 65 out of 130 places after structural reductions.
[2026-06-10 19:04:27] [INFO ] Flatten gal took : 17 ms
[2026-06-10 19:04:27] [INFO ] Flatten gal took : 13 ms
[2026-06-10 19:04:27] [INFO ] Input system was already deterministic with 156 transitions.
RANDOM walk for 40000 steps (1288 resets) in 820 ms. (48 steps per ms) remains 3/12 properties
BEST_FIRST walk for 40003 steps (196 resets) in 181 ms. (219 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (196 resets) in 206 ms. (193 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (253 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
[2026-06-10 19:04:27] [INFO ] Flow matrix only has 120 transitions (discarded 36 similar events)
[2026-06-10 19:04:27] [INFO ] Invariant cache hit.
[2026-06-10 19:04:27] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 45/110 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 8/118 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1/119 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Real declared 120/250 variables, and 25 constraints, problems are : Problem set: 3 solved, 0 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/130 constraints, ReadFeed: 0/55 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 547ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA LastZero-COL-N10-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA LastZero-COL-N10-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 6 simplifications.
Computed a total of 130 stabilizing places and 156 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 130 transition count 156
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 10 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 156/156 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 121 transition count 147
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 121 transition count 147
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 113 transition count 131
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 113 transition count 131
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 105 transition count 123
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 105 transition count 123
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 57 place count 98 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 98 transition count 109
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 71 place count 91 transition count 102
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 91 transition count 102
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 84 place count 85 transition count 90
Iterating global reduction 0 with 6 rules applied. Total rules applied 90 place count 85 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 96 place count 79 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 102 place count 79 transition count 84
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 107 place count 74 transition count 74
Iterating global reduction 0 with 5 rules applied. Total rules applied 112 place count 74 transition count 74
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 117 place count 69 transition count 69
Iterating global reduction 0 with 5 rules applied. Total rules applied 122 place count 69 transition count 69
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 126 place count 65 transition count 61
Iterating global reduction 0 with 4 rules applied. Total rules applied 130 place count 65 transition count 61
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 134 place count 61 transition count 57
Iterating global reduction 0 with 4 rules applied. Total rules applied 138 place count 61 transition count 57
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 141 place count 58 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 144 place count 58 transition count 51
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 147 place count 55 transition count 48
Iterating global reduction 0 with 3 rules applied. Total rules applied 150 place count 55 transition count 48
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 152 place count 53 transition count 44
Iterating global reduction 0 with 2 rules applied. Total rules applied 154 place count 53 transition count 44
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 156 place count 51 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 158 place count 51 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 159 place count 50 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 160 place count 50 transition count 40
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 161 place count 49 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 162 place count 49 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 164 place count 48 transition count 38
Applied a total of 164 rules in 40 ms. Remains 48 /130 variables (removed 82) and now considering 38/156 (removed 118) transitions.
[2026-06-10 19:04:28] [INFO ] Flow matrix only has 29 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-12501988921206034427.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12932931349998259126.kers'
[2026-06-10 19:04:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12501988921206034427.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12932931349998259126.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 29 rows 38 cols 56 entries
Finished phase 1 with 20 SingleSign rule and 9 generalized
[2026-06-10 19:04:28] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12932931349998259126.kers
Total runtime 1 ms.
[2026-06-10 19:04:28] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-06-10 19:04:28] [INFO ] Flow matrix only has 29 transitions (discarded 9 similar events)
[2026-06-10 19:04:28] [INFO ] Invariant cache hit.
[2026-06-10 19:04:28] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-06-10 19:04:28] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2026-06-10 19:04:28] [INFO ] Redundant transitions in 1 ms returned []
Running 28 sub problems to find dead transitions.
[2026-06-10 19:04:28] [INFO ] Flow matrix only has 29 transitions (discarded 9 similar events)
[2026-06-10 19:04:28] [INFO ] Invariant cache hit.
[2026-06-10 19:04:28] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 1/48 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 29/77 variables, 48/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 10/77 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 77 constraints, problems are : Problem set: 0 solved, 28 unsolved in 449 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 1/48 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 29/77 variables, 48/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 10/77 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/77 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 105 constraints, problems are : Problem set: 0 solved, 28 unsolved in 394 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 847ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 847ms
Starting structural reductions in SI_LTL mode, iteration 1 : 48/130 places, 38/156 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 997 ms. Remains : 48/130 places, 38/156 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 158 ms :[(NOT p0)]
Running random walk in product with property : LastZero-COL-N10-LTLCardinality-02
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 4 ms.
FORMULA LastZero-COL-N10-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-COL-N10-LTLCardinality-02 finished in 1231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 65 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 156/156 transitions.
Applied a total of 0 rules in 9 ms. Remains 130 /130 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-06-10 19:04:29] [INFO ] Flow matrix only has 120 transitions (discarded 36 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14787672995415666021.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9548498090023307276.kers'
[2026-06-10 19:04:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14787672995415666021.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9548498090023307276.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 120 rows 129 cols 283 entries
Finished phase 1 with 110 SingleSign rule and 1 generalized
[2026-06-10 19:04:29] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9548498090023307276.kers
Total runtime 1 ms.
[2026-06-10 19:04:29] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-06-10 19:04:29] [INFO ] Flow matrix only has 120 transitions (discarded 36 similar events)
[2026-06-10 19:04:29] [INFO ] Invariant cache hit.
[2026-06-10 19:04:29] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-06-10 19:04:29] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2026-06-10 19:04:29] [INFO ] Redundant transitions in 7 ms returned []
Running 146 sub problems to find dead transitions.
[2026-06-10 19:04:29] [INFO ] Flow matrix only has 120 transitions (discarded 36 similar events)
[2026-06-10 19:04:29] [INFO ] Invariant cache hit.
[2026-06-10 19:04:29] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 10/68 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 120/250 variables, 130/199 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 55/254 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/250 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 254 constraints, problems are : Problem set: 0 solved, 146 unsolved in 11642 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 50/68 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 1/130 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 120/250 variables, 130/199 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 55/254 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 146/400 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (OVERLAPS) 0/250 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 400 constraints, problems are : Problem set: 0 solved, 146 unsolved in 9811 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21471ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 21473ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21716 ms. Remains : 130/130 places, 156/156 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : LastZero-COL-N10-LTLCardinality-05
Product exploration explored 100000 steps with 3225 reset in 482 ms.
Product exploration explored 100000 steps with 3225 reset in 416 ms.
Computed a total of 130 stabilizing places and 156 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 130 transition count 156
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 32 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 69 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2026-06-10 19:04:52] [INFO ] Flow matrix only has 120 transitions (discarded 36 similar events)
[2026-06-10 19:04:52] [INFO ] Invariant cache hit.
[2026-06-10 19:04:52] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2026-06-10 19:04:52] [INFO ] [Real]Absence check using 18 positive and 1 generalized place invariants in 1 ms returned sat
[2026-06-10 19:04:52] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2026-06-10 19:04:52] [INFO ] Solution in real domain found non-integer solution.
[2026-06-10 19:04:52] [INFO ] [Nat]Absence check using 18 positive place invariants in 5 ms returned sat
[2026-06-10 19:04:52] [INFO ] [Nat]Absence check using 18 positive and 1 generalized place invariants in 15 ms returned sat
[2026-06-10 19:04:53] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2026-06-10 19:04:53] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-06-10 19:04:53] [INFO ] [Nat]Added 55 Read/Feed constraints in 9 ms returned sat
[2026-06-10 19:04:53] [INFO ] Computed and/alt/rep : 110/120/104 causal constraints (skipped 6 transitions) in 6 ms.
[2026-06-10 19:04:53] [INFO ] Added : 13 causal constraints over 3 iterations in 68 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 835 ms.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Support contains 65 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 156/156 transitions.
Applied a total of 0 rules in 11 ms. Remains 130 /130 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-06-10 19:04:53] [INFO ] Flow matrix only has 120 transitions (discarded 36 similar events)
[2026-06-10 19:04:53] [INFO ] Invariant cache hit.
[2026-06-10 19:04:53] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-06-10 19:04:53] [INFO ] Flow matrix only has 120 transitions (discarded 36 similar events)
[2026-06-10 19:04:53] [INFO ] Invariant cache hit.
[2026-06-10 19:04:53] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-06-10 19:04:53] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2026-06-10 19:04:53] [INFO ] Redundant transitions in 7 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 239 ms. Remains : 130/130 places, 156/156 transitions.
Computed a total of 130 stabilizing places and 156 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 130 transition count 156
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 60 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 32 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 69 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2026-06-10 19:04:53] [INFO ] Flow matrix only has 120 transitions (discarded 36 similar events)
[2026-06-10 19:04:53] [INFO ] Invariant cache hit.
[2026-06-10 19:04:53] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2026-06-10 19:04:53] [INFO ] [Real]Absence check using 18 positive and 1 generalized place invariants in 1 ms returned sat
[2026-06-10 19:04:53] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2026-06-10 19:04:53] [INFO ] Solution in real domain found non-integer solution.
[2026-06-10 19:04:53] [INFO ] [Nat]Absence check using 18 positive place invariants in 5 ms returned sat
[2026-06-10 19:04:54] [INFO ] [Nat]Absence check using 18 positive and 1 generalized place invariants in 16 ms returned sat
[2026-06-10 19:04:54] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2026-06-10 19:04:54] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-06-10 19:04:54] [INFO ] [Nat]Added 55 Read/Feed constraints in 9 ms returned sat
[2026-06-10 19:04:54] [INFO ] Computed and/alt/rep : 110/120/104 causal constraints (skipped 6 transitions) in 10 ms.
[2026-06-10 19:04:54] [INFO ] Added : 13 causal constraints over 3 iterations in 71 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 789 ms.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3225 reset in 392 ms.
Product exploration explored 100000 steps with 3225 reset in 416 ms.
Built C files in :
/tmp/ltsmin16477321271365592709
[2026-06-10 19:04:55] [INFO ] Computing symmetric may disable matrix : 156 transitions.
[2026-06-10 19:04:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:04:55] [INFO ] Computing symmetric may enable matrix : 156 transitions.
[2026-06-10 19:04:55] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:04:55] [INFO ] Computing Do-Not-Accords matrix : 156 transitions.
[2026-06-10 19:04:55] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:04:55] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16477321271365592709
Running compilation step : cd /tmp/ltsmin16477321271365592709;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 432 ms.
Running link step : cd /tmp/ltsmin16477321271365592709;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin16477321271365592709;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15067916837935657561.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 65 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 156/156 transitions.
Applied a total of 0 rules in 5 ms. Remains 130 /130 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-06-10 19:05:10] [INFO ] Flow matrix only has 120 transitions (discarded 36 similar events)
[2026-06-10 19:05:10] [INFO ] Invariant cache hit.
[2026-06-10 19:05:10] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-06-10 19:05:10] [INFO ] Flow matrix only has 120 transitions (discarded 36 similar events)
[2026-06-10 19:05:10] [INFO ] Invariant cache hit.
[2026-06-10 19:05:10] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-06-10 19:05:10] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2026-06-10 19:05:10] [INFO ] Redundant transitions in 6 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 245 ms. Remains : 130/130 places, 156/156 transitions.
Built C files in :
/tmp/ltsmin13074727739638876270
[2026-06-10 19:05:10] [INFO ] Computing symmetric may disable matrix : 156 transitions.
[2026-06-10 19:05:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:05:10] [INFO ] Computing symmetric may enable matrix : 156 transitions.
[2026-06-10 19:05:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:05:10] [INFO ] Computing Do-Not-Accords matrix : 156 transitions.
[2026-06-10 19:05:10] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:05:10] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13074727739638876270
Running compilation step : cd /tmp/ltsmin13074727739638876270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 323 ms.
Running link step : cd /tmp/ltsmin13074727739638876270;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13074727739638876270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16890455534662091630.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-06-10 19:05:25] [INFO ] Flatten gal took : 9 ms
[2026-06-10 19:05:25] [INFO ] Flatten gal took : 8 ms
[2026-06-10 19:05:25] [INFO ] Time to serialize gal into /tmp/LTL15756602523997106506.gal : 3 ms
[2026-06-10 19:05:25] [INFO ] Time to serialize properties into /tmp/LTL15187790251314211181.prop : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15756602523997106506.gal' '-t' 'CGAL' '-hoa' '/tmp/aut700952055957047986.hoa' '-atoms' '/tmp/LTL15187790251314211181.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15187790251314211181.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut700952055957047986.hoa
Reverse transition relation is NOT exact ! Due to transitions t55, t56, t57, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, t70, t71, t72, t73...453
Computing Next relation with stutter on 256 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
861 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.63903,244088,1,0,647,963906,342,368,19025,1.73776e+06,893
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LastZero-COL-N10-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property LastZero-COL-N10-LTLCardinality-05 finished in 66404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 10 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 156/156 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 121 transition count 147
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 121 transition count 147
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 113 transition count 131
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 113 transition count 131
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 105 transition count 123
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 105 transition count 123
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 57 place count 98 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 98 transition count 109
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 71 place count 91 transition count 102
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 91 transition count 102
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 84 place count 85 transition count 90
Iterating global reduction 0 with 6 rules applied. Total rules applied 90 place count 85 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 96 place count 79 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 102 place count 79 transition count 84
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 107 place count 74 transition count 74
Iterating global reduction 0 with 5 rules applied. Total rules applied 112 place count 74 transition count 74
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 117 place count 69 transition count 69
Iterating global reduction 0 with 5 rules applied. Total rules applied 122 place count 69 transition count 69
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 126 place count 65 transition count 61
Iterating global reduction 0 with 4 rules applied. Total rules applied 130 place count 65 transition count 61
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 134 place count 61 transition count 57
Iterating global reduction 0 with 4 rules applied. Total rules applied 138 place count 61 transition count 57
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 141 place count 58 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 144 place count 58 transition count 51
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 147 place count 55 transition count 48
Iterating global reduction 0 with 3 rules applied. Total rules applied 150 place count 55 transition count 48
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 152 place count 53 transition count 44
Iterating global reduction 0 with 2 rules applied. Total rules applied 154 place count 53 transition count 44
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 156 place count 51 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 158 place count 51 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 159 place count 50 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 160 place count 50 transition count 40
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 161 place count 49 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 162 place count 49 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 164 place count 48 transition count 38
Applied a total of 164 rules in 32 ms. Remains 48 /130 variables (removed 82) and now considering 38/156 (removed 118) transitions.
[2026-06-10 19:05:36] [INFO ] Flow matrix only has 29 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-5496226107703911864.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6992672022876596083.kers'
[2026-06-10 19:05:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5496226107703911864.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6992672022876596083.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 29 rows 38 cols 56 entries
Finished phase 1 with 20 SingleSign rule and 9 generalized
[2026-06-10 19:05:36] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6992672022876596083.kers
Total runtime 0 ms.
[2026-06-10 19:05:36] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-06-10 19:05:36] [INFO ] Flow matrix only has 29 transitions (discarded 9 similar events)
[2026-06-10 19:05:36] [INFO ] Invariant cache hit.
[2026-06-10 19:05:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-06-10 19:05:36] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2026-06-10 19:05:36] [INFO ] Redundant transitions in 1 ms returned []
Running 28 sub problems to find dead transitions.
[2026-06-10 19:05:36] [INFO ] Flow matrix only has 29 transitions (discarded 9 similar events)
[2026-06-10 19:05:36] [INFO ] Invariant cache hit.
[2026-06-10 19:05:36] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 1/48 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 29/77 variables, 48/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 10/77 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 77 constraints, problems are : Problem set: 0 solved, 28 unsolved in 532 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 1/48 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 29/77 variables, 48/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 10/77 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/77 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 105 constraints, problems are : Problem set: 0 solved, 28 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 973ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 974ms
Starting structural reductions in SI_LTL mode, iteration 1 : 48/130 places, 38/156 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1172 ms. Remains : 48/130 places, 38/156 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LastZero-COL-N10-LTLCardinality-07
Product exploration explored 100000 steps with 5381 reset in 212 ms.
Product exploration explored 100000 steps with 5371 reset in 208 ms.
Computed a total of 48 stabilizing places and 38 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 38
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 74 steps (0 resets) in 5 ms. (12 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 53 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
[2026-06-10 19:05:37] [INFO ] Flow matrix only has 29 transitions (discarded 9 similar events)
[2026-06-10 19:05:37] [INFO ] Invariant cache hit.
[2026-06-10 19:05:38] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2026-06-10 19:05:38] [INFO ] [Real]Absence check using 10 positive and 9 generalized place invariants in 2 ms returned sat
[2026-06-10 19:05:38] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2026-06-10 19:05:38] [INFO ] Solution in real domain found non-integer solution.
[2026-06-10 19:05:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2026-06-10 19:05:38] [INFO ] [Nat]Absence check using 10 positive and 9 generalized place invariants in 2 ms returned sat
[2026-06-10 19:05:38] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2026-06-10 19:05:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-06-10 19:05:38] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2026-06-10 19:05:38] [INFO ] Computed and/alt/rep : 19/28/19 causal constraints (skipped 0 transitions) in 2 ms.
[2026-06-10 19:05:38] [INFO ] Added : 15 causal constraints over 3 iterations in 27 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 415 ms.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 10 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 38/38 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2026-06-10 19:05:38] [INFO ] Flow matrix only has 29 transitions (discarded 9 similar events)
[2026-06-10 19:05:38] [INFO ] Invariant cache hit.
[2026-06-10 19:05:38] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-06-10 19:05:38] [INFO ] Flow matrix only has 29 transitions (discarded 9 similar events)
[2026-06-10 19:05:38] [INFO ] Invariant cache hit.
[2026-06-10 19:05:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-06-10 19:05:38] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2026-06-10 19:05:38] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 116 ms. Remains : 48/48 places, 38/38 transitions.
Computed a total of 48 stabilizing places and 38 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 38
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 61 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 74 steps (0 resets) in 6 ms. (10 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
[2026-06-10 19:05:38] [INFO ] Flow matrix only has 29 transitions (discarded 9 similar events)
[2026-06-10 19:05:38] [INFO ] Invariant cache hit.
[2026-06-10 19:05:38] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2026-06-10 19:05:38] [INFO ] [Real]Absence check using 10 positive and 9 generalized place invariants in 2 ms returned sat
[2026-06-10 19:05:38] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-06-10 19:05:38] [INFO ] Solution in real domain found non-integer solution.
[2026-06-10 19:05:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2026-06-10 19:05:38] [INFO ] [Nat]Absence check using 10 positive and 9 generalized place invariants in 2 ms returned sat
[2026-06-10 19:05:38] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2026-06-10 19:05:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-06-10 19:05:38] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2026-06-10 19:05:38] [INFO ] Computed and/alt/rep : 19/28/19 causal constraints (skipped 0 transitions) in 2 ms.
[2026-06-10 19:05:38] [INFO ] Added : 15 causal constraints over 3 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 384 ms.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5367 reset in 181 ms.
Product exploration explored 100000 steps with 5384 reset in 196 ms.
Built C files in :
/tmp/ltsmin9791449857551938309
[2026-06-10 19:05:39] [INFO ] Computing symmetric may disable matrix : 38 transitions.
[2026-06-10 19:05:39] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:05:39] [INFO ] Computing symmetric may enable matrix : 38 transitions.
[2026-06-10 19:05:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:05:39] [INFO ] Computing Do-Not-Accords matrix : 38 transitions.
[2026-06-10 19:05:39] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:05:39] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9791449857551938309
Running compilation step : cd /tmp/ltsmin9791449857551938309;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 125 ms.
Running link step : cd /tmp/ltsmin9791449857551938309;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9791449857551938309;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7167497062779667926.hoa' '--buchi-type=spotba'
LTSmin run took 381 ms.
FORMULA LastZero-COL-N10-LTLCardinality-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LastZero-COL-N10-LTLCardinality-07 finished in 3834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 10 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 156/156 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 121 transition count 147
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 121 transition count 147
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 113 transition count 131
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 113 transition count 131
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 105 transition count 123
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 105 transition count 123
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 57 place count 98 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 98 transition count 109
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 71 place count 91 transition count 102
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 91 transition count 102
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 84 place count 85 transition count 90
Iterating global reduction 0 with 6 rules applied. Total rules applied 90 place count 85 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 96 place count 79 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 102 place count 79 transition count 84
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 107 place count 74 transition count 74
Iterating global reduction 0 with 5 rules applied. Total rules applied 112 place count 74 transition count 74
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 117 place count 69 transition count 69
Iterating global reduction 0 with 5 rules applied. Total rules applied 122 place count 69 transition count 69
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 126 place count 65 transition count 61
Iterating global reduction 0 with 4 rules applied. Total rules applied 130 place count 65 transition count 61
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 134 place count 61 transition count 57
Iterating global reduction 0 with 4 rules applied. Total rules applied 138 place count 61 transition count 57
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 141 place count 58 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 144 place count 58 transition count 51
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 147 place count 55 transition count 48
Iterating global reduction 0 with 3 rules applied. Total rules applied 150 place count 55 transition count 48
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 152 place count 53 transition count 44
Iterating global reduction 0 with 2 rules applied. Total rules applied 154 place count 53 transition count 44
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 156 place count 51 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 158 place count 51 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 159 place count 50 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 160 place count 50 transition count 40
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 161 place count 49 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 162 place count 49 transition count 39
Applied a total of 162 rules in 11 ms. Remains 49 /130 variables (removed 81) and now considering 39/156 (removed 117) transitions.
[2026-06-10 19:05:39] [INFO ] Flow matrix only has 30 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-14146604545193393699.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5663431754384386190.kers'
[2026-06-10 19:05:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14146604545193393699.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5663431754384386190.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 30 rows 40 cols 59 entries
Finished phase 1 with 21 SingleSign rule and 9 generalized
[2026-06-10 19:05:39] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5663431754384386190.kers
Total runtime 0 ms.
[2026-06-10 19:05:39] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-06-10 19:05:39] [INFO ] Flow matrix only has 30 transitions (discarded 9 similar events)
[2026-06-10 19:05:39] [INFO ] Invariant cache hit.
[2026-06-10 19:05:39] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-06-10 19:05:39] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2026-06-10 19:05:39] [INFO ] Flow matrix only has 30 transitions (discarded 9 similar events)
[2026-06-10 19:05:39] [INFO ] Invariant cache hit.
[2026-06-10 19:05:39] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 1/49 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 30/79 variables, 49/68 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 10/78 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 0/79 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 78 constraints, problems are : Problem set: 0 solved, 29 unsolved in 512 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 1/49 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 30/79 variables, 49/68 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 10/78 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 29/107 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/79 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 107 constraints, problems are : Problem set: 0 solved, 29 unsolved in 451 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 964ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 965ms
Starting structural reductions in LTL mode, iteration 1 : 49/130 places, 39/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1081 ms. Remains : 49/130 places, 39/156 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : LastZero-COL-N10-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 111 ms.
Product exploration explored 100000 steps with 50000 reset in 117 ms.
Computed a total of 49 stabilizing places and 39 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49 transition count 39
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 10 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 53 ms.
FORMULA LastZero-COL-N10-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LastZero-COL-N10-LTLCardinality-10 finished in 1478 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&X((!p2 U (p3||G(!p2))))))'
Support contains 65 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 130 /130 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-06-10 19:05:41] [INFO ] Flow matrix only has 120 transitions (discarded 36 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4291557495971939610.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8210671530359091535.kers'
[2026-06-10 19:05:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4291557495971939610.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8210671530359091535.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 120 rows 129 cols 283 entries
Finished phase 1 with 110 SingleSign rule and 1 generalized
[2026-06-10 19:05:41] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8210671530359091535.kers
Total runtime 1 ms.
[2026-06-10 19:05:41] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-06-10 19:05:41] [INFO ] Flow matrix only has 120 transitions (discarded 36 similar events)
[2026-06-10 19:05:41] [INFO ] Invariant cache hit.
[2026-06-10 19:05:41] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-06-10 19:05:41] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2026-06-10 19:05:41] [INFO ] Flow matrix only has 120 transitions (discarded 36 similar events)
[2026-06-10 19:05:41] [INFO ] Invariant cache hit.
[2026-06-10 19:05:41] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 10/68 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 120/250 variables, 130/199 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 55/254 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/250 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 254 constraints, problems are : Problem set: 0 solved, 146 unsolved in 11768 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 50/68 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 1/130 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 120/250 variables, 130/199 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 55/254 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 146/400 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (OVERLAPS) 0/250 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 400 constraints, problems are : Problem set: 0 solved, 146 unsolved in 9655 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21436ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 21438ms
Finished structural reductions in LTL mode , in 1 iterations and 21674 ms. Remains : 130/130 places, 156/156 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&X((!p2 U (p3||G(!p2))))))'
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p1) (AND p2 (NOT p3))), true, (NOT p1), (AND (NOT p3) p2)]
Running random walk in product with property : LastZero-COL-N10-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LastZero-COL-N10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-COL-N10-LTLCardinality-11 finished in 21892 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 10 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 156/156 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 121 transition count 147
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 121 transition count 147
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 113 transition count 131
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 113 transition count 131
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 105 transition count 123
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 105 transition count 123
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 57 place count 98 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 98 transition count 109
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 71 place count 91 transition count 102
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 91 transition count 102
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 84 place count 85 transition count 90
Iterating global reduction 0 with 6 rules applied. Total rules applied 90 place count 85 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 96 place count 79 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 102 place count 79 transition count 84
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 107 place count 74 transition count 74
Iterating global reduction 0 with 5 rules applied. Total rules applied 112 place count 74 transition count 74
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 117 place count 69 transition count 69
Iterating global reduction 0 with 5 rules applied. Total rules applied 122 place count 69 transition count 69
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 126 place count 65 transition count 61
Iterating global reduction 0 with 4 rules applied. Total rules applied 130 place count 65 transition count 61
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 134 place count 61 transition count 57
Iterating global reduction 0 with 4 rules applied. Total rules applied 138 place count 61 transition count 57
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 141 place count 58 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 144 place count 58 transition count 51
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 147 place count 55 transition count 48
Iterating global reduction 0 with 3 rules applied. Total rules applied 150 place count 55 transition count 48
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 152 place count 53 transition count 44
Iterating global reduction 0 with 2 rules applied. Total rules applied 154 place count 53 transition count 44
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 156 place count 51 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 158 place count 51 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 159 place count 50 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 160 place count 50 transition count 40
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 161 place count 49 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 162 place count 49 transition count 39
Applied a total of 162 rules in 11 ms. Remains 49 /130 variables (removed 81) and now considering 39/156 (removed 117) transitions.
[2026-06-10 19:06:03] [INFO ] Flow matrix only has 30 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-9510770288267197986.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6597324724419502157.kers'
[2026-06-10 19:06:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9510770288267197986.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6597324724419502157.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 30 rows 40 cols 59 entries
Finished phase 1 with 21 SingleSign rule and 9 generalized
[2026-06-10 19:06:03] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6597324724419502157.kers
Total runtime 0 ms.
[2026-06-10 19:06:03] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-06-10 19:06:03] [INFO ] Flow matrix only has 30 transitions (discarded 9 similar events)
[2026-06-10 19:06:03] [INFO ] Invariant cache hit.
[2026-06-10 19:06:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-06-10 19:06:03] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2026-06-10 19:06:03] [INFO ] Flow matrix only has 30 transitions (discarded 9 similar events)
[2026-06-10 19:06:03] [INFO ] Invariant cache hit.
[2026-06-10 19:06:03] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 1/49 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 30/79 variables, 49/68 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 10/78 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 0/79 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 78 constraints, problems are : Problem set: 0 solved, 29 unsolved in 493 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 1/49 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 30/79 variables, 49/68 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 10/78 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 29/107 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/79 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 107 constraints, problems are : Problem set: 0 solved, 29 unsolved in 443 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 939ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 939ms
Starting structural reductions in LTL mode, iteration 1 : 49/130 places, 39/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1035 ms. Remains : 49/130 places, 39/156 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : LastZero-COL-N10-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA LastZero-COL-N10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-COL-N10-LTLCardinality-12 finished in 1151 ms.
All properties solved by simple procedures.
Total runtime 148468 ms.

BK_STOP 1781118364766

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-COL-N10"
export BK_EXAMINATION="LTLCardinality"
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-COL-N10, examination is LTLCardinality"
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-178024402700011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LastZero-COL-N10.tgz
mv LastZero-COL-N10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;