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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.8K May 27 10:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 27 10:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 27 10:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 27 10:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 27 10:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 27 10:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 27 10:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 15K May 27 10:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K May 27 10:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 27 10:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 27 10:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 27 10:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 27 10:53 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 36K 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-N16-LTLFireability-00
FORMULA_NAME LastZero-COL-N16-LTLFireability-01
FORMULA_NAME LastZero-COL-N16-LTLFireability-02
FORMULA_NAME LastZero-COL-N16-LTLFireability-03
FORMULA_NAME LastZero-COL-N16-LTLFireability-04
FORMULA_NAME LastZero-COL-N16-LTLFireability-05
FORMULA_NAME LastZero-COL-N16-LTLFireability-06
FORMULA_NAME LastZero-COL-N16-LTLFireability-07
FORMULA_NAME LastZero-COL-N16-LTLFireability-08
FORMULA_NAME LastZero-COL-N16-LTLFireability-09
FORMULA_NAME LastZero-COL-N16-LTLFireability-10
FORMULA_NAME LastZero-COL-N16-LTLFireability-11
FORMULA_NAME LastZero-COL-N16-LTLFireability-12
FORMULA_NAME LastZero-COL-N16-LTLFireability-13
FORMULA_NAME LastZero-COL-N16-LTLFireability-14
FORMULA_NAME LastZero-COL-N16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1781118594083

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LastZero-COL-N16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202604301425
[2026-06-10 19:09:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-10 19:09:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-10 19:09:55] [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:09:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-06-10 19:09:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 486 ms
[2026-06-10 19:09:55] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 612 PT places and 5491.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2026-06-10 19:09:55] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions 11 arcs in 4 ms.
[2026-06-10 19:09:55] [INFO ] Skeletonized 6 HLPN properties in 1 ms. Removed 10 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA LastZero-COL-N16-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-COL-N16-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 2 stable transitions
Remains 1 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
[2026-06-10 19:09:56] [INFO ] Flatten gal took : 12 ms
[2026-06-10 19:09:56] [INFO ] Flatten gal took : 0 ms
Domain [ID(17), ID(17)] of place array breaks symmetries in sort ID
[2026-06-10 19:09:56] [INFO ] Unfolded HLPN to a Petri net with 612 places and 5425 transitions 16787 arcs in 68 ms.
[2026-06-10 19:09:56] [INFO ] Unfolded 14 HLPN properties in 23 ms.
Deduced a syphon composed of 290 places in 21 ms
Reduce places removed 290 places and 3521 transitions.
Reduce places removed 1 places and 0 transitions.
Support contains 320 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 1904/1904 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 320 transition count 1904
Applied a total of 1 rules in 23 ms. Remains 320 /321 variables (removed 1) and now considering 1904/1904 (removed 0) transitions.
[2026-06-10 19:09:57] [INFO ] Flow matrix only has 1784 transitions (discarded 120 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17798978208814012237.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15069568006758761178.kers'
[2026-06-10 19:09:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17798978208814012237.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15069568006758761178.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 1784 rows 319 cols 4926 entries
Finished phase 1 with 304 SingleSign rule and 0 generalized
[2026-06-10 19:09:57] [INFO ] Computed 16 invariants in 5 ms
Computed 16 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-15069568006758761178.kers
Total runtime 7 ms.
[2026-06-10 19:09:58] [INFO ] Implicit Places using invariants in 214 ms returned []
[2026-06-10 19:09:58] [INFO ] Flow matrix only has 1784 transitions (discarded 120 similar events)
[2026-06-10 19:09:58] [INFO ] Invariant cache hit.
[2026-06-10 19:09:58] [INFO ] State equation strengthened by 272 read => feed constraints.
[2026-06-10 19:09:58] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
Running 1888 sub problems to find dead transitions.
[2026-06-10 19:09:58] [INFO ] Flow matrix only has 1784 transitions (discarded 120 similar events)
[2026-06-10 19:09:58] [INFO ] Invariant cache hit.
[2026-06-10 19:09:58] [INFO ] State equation strengthened by 272 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 319/2104 variables, and 16 constraints, problems are : Problem set: 0 solved, 1888 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/320 constraints, ReadFeed: 0/272 constraints, PredecessorRefiner: 1888/1888 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1888 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 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 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 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 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 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 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 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 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
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1420 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1525 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1530 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1541 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1673 is UNSAT
Problem TDEAD1674 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1676 is UNSAT
Problem TDEAD1677 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1695 is UNSAT
Problem TDEAD1696 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1698 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1706 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1712 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1724 is UNSAT
Problem TDEAD1725 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1728 is UNSAT
Problem TDEAD1729 is UNSAT
Problem TDEAD1730 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1734 is UNSAT
Problem TDEAD1735 is UNSAT
Problem TDEAD1736 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1745 is UNSAT
Problem TDEAD1746 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1748 is UNSAT
Problem TDEAD1749 is UNSAT
Problem TDEAD1750 is UNSAT
Problem TDEAD1751 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1755 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1757 is UNSAT
Problem TDEAD1758 is UNSAT
Problem TDEAD1759 is UNSAT
Problem TDEAD1760 is UNSAT
Problem TDEAD1761 is UNSAT
Problem TDEAD1762 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1765 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 is UNSAT
At refinement iteration 2 (OVERLAPS) 1784/2103 variables, 319/335 constraints. Problems are: Problem set: 1495 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2103 variables, 272/607 constraints. Problems are: Problem set: 1495 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2103 variables, 393/1000 constraints. Problems are: Problem set: 1495 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2103/2104 variables, and 1000 constraints, problems are : Problem set: 1495 solved, 393 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 319/320 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 393/1888 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61013ms problems are : Problem set: 1495 solved, 393 unsolved
Search for dead transitions found 1495 dead transitions in 61042ms
Found 1495 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1495 transitions
Dead transitions reduction (with SMT) removed 1495 transitions
Starting structural reductions in LTL mode, iteration 1 : 320/321 places, 409/1904 transitions.
Applied a total of 0 rules in 3 ms. Remains 320 /320 variables (removed 0) and now considering 409/409 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61804 ms. Remains : 320/321 places, 409/1904 transitions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 409/409 transitions.
Applied a total of 0 rules in 3 ms. Remains 320 /320 variables (removed 0) and now considering 409/409 (removed 0) transitions.
[2026-06-10 19:10:59] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15071809881715571391.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14006240164445100196.kers'
[2026-06-10 19:10:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15071809881715571391.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14006240164445100196.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 289 rows 319 cols 711 entries
Finished phase 1 with 289 SingleSign rule and 0 generalized
[2026-06-10 19:10:59] [INFO ] Computed 31 invariants in 1 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14006240164445100196.kers
Total runtime 3 ms.
[2026-06-10 19:10:59] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-06-10 19:10:59] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
[2026-06-10 19:10:59] [INFO ] Invariant cache hit.
[2026-06-10 19:10:59] [INFO ] State equation strengthened by 137 read => feed constraints.
[2026-06-10 19:10:59] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2026-06-10 19:10:59] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
[2026-06-10 19:10:59] [INFO ] Invariant cache hit.
[2026-06-10 19:10:59] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 10/161 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 319/609 variables, and 161 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 0/320 constraints, ReadFeed: 0/137 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 130/130 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 130/161 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 289/608 variables, 319/480 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/608 variables, 137/617 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/608 variables, 393/1010 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/609 variables, and 1010 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 319/320 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 130/130 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Finished structural reductions in LTL mode , in 1 iterations and 60306 ms. Remains : 320/320 places, 409/409 transitions.
Support contains 320 out of 320 places after structural reductions.
[2026-06-10 19:12:00] [INFO ] Flatten gal took : 185 ms
[2026-06-10 19:12:00] [INFO ] Flatten gal took : 135 ms
[2026-06-10 19:12:01] [INFO ] Input system was already deterministic with 409 transitions.
Reduction of identical properties reduced properties to check from 11 to 6
RANDOM walk for 142 steps (0 resets) in 36 ms. (3 steps per ms) remains 0/6 properties
FORMULA LastZero-COL-N16-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 320 stabilizing places and 409 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 320 transition count 409
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((p0&&X(F(p1)))) U X(X(!p2))))'
Support contains 183 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 409/409 transitions.
Applied a total of 0 rules in 12 ms. Remains 320 /320 variables (removed 0) and now considering 409/409 (removed 0) transitions.
[2026-06-10 19:12:02] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
[2026-06-10 19:12:02] [INFO ] Invariant cache hit.
[2026-06-10 19:12:02] [INFO ] Implicit Places using invariants in 116 ms returned [135]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 118 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 319/320 places, 409/409 transitions.
Applied a total of 0 rules in 8 ms. Remains 319 /319 variables (removed 0) and now considering 409/409 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 138 ms. Remains : 319/320 places, 409/409 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((X(F(p0))&&p1)) U X(X(!p2))))'
Stuttering acceptance computed with spot in 581 ms :[p2, (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), p2, (AND (NOT p0) p2), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND (NOT p0) p2), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : LastZero-COL-N16-LTLFireability-01
Product exploration explored 100000 steps with 39949 reset in 423 ms.
Product exploration explored 100000 steps with 40000 reset in 353 ms.
Computed a total of 319 stabilizing places and 409 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 319 transition count 409
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 10 factoid took 182 ms. Reduced automaton from 11 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 6 to 4
RANDOM walk for 119 steps (0 resets) in 10 ms. (10 steps per ms) remains 0/4 properties
Knowledge based reduction with 10 factoid took 167 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 431 ms :[p2, p2, (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND (NOT p0) p2), (OR (NOT p1) (NOT p0)), (NOT p0)]
Knowledge-based reduction took 937 ms.
Stuttering acceptance computed with spot in 404 ms :[p2, p2, (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND (NOT p0) p2), (OR (NOT p1) (NOT p0)), (NOT p0)]
Support contains 183 out of 319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 409/409 transitions.
Applied a total of 0 rules in 10 ms. Remains 319 /319 variables (removed 0) and now considering 409/409 (removed 0) transitions.
[2026-06-10 19:12:05] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6637758773812453481.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10929005128580616860.kers'
[2026-06-10 19:12:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6637758773812453481.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10929005128580616860.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 289 rows 318 cols 695 entries
Finished phase 1 with 289 SingleSign rule and 0 generalized
[2026-06-10 19:12:05] [INFO ] Computed 30 invariants in 1 ms
Computed 30 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10929005128580616860.kers
Total runtime 2 ms.
[2026-06-10 19:12:05] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-06-10 19:12:05] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
[2026-06-10 19:12:05] [INFO ] Invariant cache hit.
[2026-06-10 19:12:05] [INFO ] State equation strengthened by 137 read => feed constraints.
[2026-06-10 19:12:05] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2026-06-10 19:12:05] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
[2026-06-10 19:12:05] [INFO ] Invariant cache hit.
[2026-06-10 19:12:05] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 8/158 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 318/608 variables, and 158 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 0/319 constraints, ReadFeed: 0/137 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 128/128 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 128/158 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 289/607 variables, 318/476 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/607 variables, 137/613 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/607 variables, 393/1006 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 607/608 variables, and 1006 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 318/319 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 128/128 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Finished structural reductions in LTL mode , in 1 iterations and 60665 ms. Remains : 319/319 places, 409/409 transitions.
Computed a total of 319 stabilizing places and 409 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 319 transition count 409
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 6 factoid took 136 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 6 to 4
RANDOM walk for 154 steps (1 resets) in 13 ms. (11 steps per ms) remains 0/4 properties
Knowledge based reduction with 6 factoid took 163 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[p2, p2, (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND (NOT p0) p2), (OR (NOT p1) (NOT p0)), (NOT p0)]
Knowledge-based reduction took 759 ms.
Stuttering acceptance computed with spot in 352 ms :[p2, p2, (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND (NOT p0) p2), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 322 ms :[p2, p2, (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND (NOT p0) p2), (OR (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 33250 reset in 581 ms.
Product exploration explored 100000 steps with 33241 reset in 552 ms.
Spot run failed in 74 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin13901701250266326687
[2026-06-10 19:13:08] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13901701250266326687
Running compilation step : cd /tmp/ltsmin13901701250266326687;'/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 794 ms.
Running link step : cd /tmp/ltsmin13901701250266326687;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin13901701250266326687;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased3845949350857832699.hoa' '--buchi-type=spotba'
LTSmin run took 59 ms.
FORMULA LastZero-COL-N16-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LastZero-COL-N16-LTLFireability-01 finished in 67238 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)&&F(p1))))'
Support contains 304 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 409/409 transitions.
Applied a total of 0 rules in 15 ms. Remains 320 /320 variables (removed 0) and now considering 409/409 (removed 0) transitions.
[2026-06-10 19:13:09] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7505691821039132327.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14126430600299582311.kers'
[2026-06-10 19:13:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7505691821039132327.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14126430600299582311.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 289 rows 319 cols 711 entries
Finished phase 1 with 289 SingleSign rule and 0 generalized
[2026-06-10 19:13:09] [INFO ] Computed 31 invariants in 1 ms
Computed 31 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14126430600299582311.kers
Total runtime 1 ms.
[2026-06-10 19:13:09] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-06-10 19:13:09] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
[2026-06-10 19:13:09] [INFO ] Invariant cache hit.
[2026-06-10 19:13:09] [INFO ] State equation strengthened by 137 read => feed constraints.
[2026-06-10 19:13:09] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2026-06-10 19:13:09] [INFO ] Redundant transitions in 33 ms returned []
Running 393 sub problems to find dead transitions.
[2026-06-10 19:13:09] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
[2026-06-10 19:13:09] [INFO ] Invariant cache hit.
[2026-06-10 19:13:09] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 10/161 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 319/609 variables, and 161 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 0/320 constraints, ReadFeed: 0/137 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 130/130 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 130/161 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 289/608 variables, 319/480 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/608 variables, 137/617 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/608 variables, 393/1010 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/609 variables, and 1010 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 319/320 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 130/130 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60382 ms. Remains : 320/320 places, 409/409 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)&&F(p1))))'
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : LastZero-COL-N16-LTLFireability-02
Stuttering criterion allowed to conclude after 48 steps with 0 reset in 2 ms.
FORMULA LastZero-COL-N16-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-COL-N16-LTLFireability-02 finished in 60532 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((X(!p1)||p0)) U (p2 U X(p3)))))'
Support contains 320 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 409/409 transitions.
Applied a total of 0 rules in 3 ms. Remains 320 /320 variables (removed 0) and now considering 409/409 (removed 0) transitions.
[2026-06-10 19:14:10] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
[2026-06-10 19:14:10] [INFO ] Invariant cache hit.
[2026-06-10 19:14:10] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-06-10 19:14:10] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
[2026-06-10 19:14:10] [INFO ] Invariant cache hit.
[2026-06-10 19:14:10] [INFO ] State equation strengthened by 137 read => feed constraints.
[2026-06-10 19:14:10] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 186 ms. Remains : 320/320 places, 409/409 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((X(!p1)||p0)) U (p2 U X(p3)))))'
Stuttering acceptance computed with spot in 402 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p3) p1), (AND (NOT p0) (NOT p3) p1), (AND p1 (NOT p3)), true, p1, (AND (NOT p0) p1), (NOT p3), (NOT p3)]
Running random walk in product with property : LastZero-COL-N16-LTLFireability-03
Entered a terminal (fully accepting) state of product in 6 steps with 1 reset in 3 ms.
FORMULA LastZero-COL-N16-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-COL-N16-LTLFireability-03 finished in 649 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 151 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 409/409 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 305 transition count 394
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 305 transition count 394
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 290 transition count 379
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 290 transition count 379
Applied a total of 60 rules in 27 ms. Remains 290 /320 variables (removed 30) and now considering 379/409 (removed 30) transitions.
[2026-06-10 19:14:10] [INFO ] Flow matrix only has 259 transitions (discarded 120 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11004504593748093527.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8757984911481354449.kers'
[2026-06-10 19:14:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11004504593748093527.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8757984911481354449.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 259 rows 288 cols 635 entries
Finished phase 1 with 258 SingleSign rule and 1 generalized
[2026-06-10 19:14:10] [INFO ] Computed 31 invariants in 0 ms
Computed 31 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8757984911481354449.kers
Total runtime 1 ms.
[2026-06-10 19:14:10] [INFO ] Implicit Places using invariants in 93 ms returned [135]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/320 places, 379/409 transitions.
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 2 place count 288 transition count 378
Applied a total of 2 rules in 18 ms. Remains 288 /289 variables (removed 1) and now considering 378/379 (removed 1) transitions.
[2026-06-10 19:14:10] [INFO ] Flow matrix only has 258 transitions (discarded 120 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6798654639279977574.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16419475589340786682.kers'
[2026-06-10 19:14:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6798654639279977574.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16419475589340786682.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 258 rows 286 cols 632 entries
Finished phase 1 with 258 SingleSign rule and 0 generalized
[2026-06-10 19:14:10] [INFO ] Computed 30 invariants in 1 ms
Computed 30 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16419475589340786682.kers
Total runtime 1 ms.
[2026-06-10 19:14:10] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-06-10 19:14:10] [INFO ] Flow matrix only has 258 transitions (discarded 120 similar events)
[2026-06-10 19:14:10] [INFO ] Invariant cache hit.
[2026-06-10 19:14:11] [INFO ] State equation strengthened by 122 read => feed constraints.
[2026-06-10 19:14:11] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 288/320 places, 378/409 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 789 ms. Remains : 288/320 places, 378/409 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 34 ms :[(NOT p0)]
Running random walk in product with property : LastZero-COL-N16-LTLFireability-05
Product exploration explored 100000 steps with 2083 reset in 996 ms.
Product exploration explored 100000 steps with 2083 reset in 946 ms.
Computed a total of 288 stabilizing places and 378 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 288 transition count 378
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 4 factoid took 10 ms. Proved property starting from automaton with 1 states, 2 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 106 ms.
FORMULA LastZero-COL-N16-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LastZero-COL-N16-LTLFireability-05 finished in 2895 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((X(p1)||p0)) U X(G((F(p3)||p2)))))'
Support contains 304 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 409/409 transitions.
Applied a total of 0 rules in 4 ms. Remains 320 /320 variables (removed 0) and now considering 409/409 (removed 0) transitions.
[2026-06-10 19:14:13] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3041738785886259205.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1619602064146169929.kers'
[2026-06-10 19:14:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3041738785886259205.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1619602064146169929.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 289 rows 319 cols 711 entries
Finished phase 1 with 289 SingleSign rule and 0 generalized
[2026-06-10 19:14:13] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1619602064146169929.kers
Total runtime 3 ms.
[2026-06-10 19:14:13] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-06-10 19:14:13] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
[2026-06-10 19:14:13] [INFO ] Invariant cache hit.
[2026-06-10 19:14:13] [INFO ] State equation strengthened by 137 read => feed constraints.
[2026-06-10 19:14:13] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 272 ms. Remains : 320/320 places, 409/409 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((X(p1)||p0)) U X(G((F(p3)||p2)))))'
Stuttering acceptance computed with spot in 442 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : LastZero-COL-N16-LTLFireability-06
Stuttering criterion allowed to conclude after 1361 steps with 549 reset in 138 ms.
FORMULA LastZero-COL-N16-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-COL-N16-LTLFireability-06 finished in 935 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(X(p0)))'
Support contains 152 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 409/409 transitions.
Applied a total of 0 rules in 7 ms. Remains 320 /320 variables (removed 0) and now considering 409/409 (removed 0) transitions.
[2026-06-10 19:14:14] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
[2026-06-10 19:14:14] [INFO ] Invariant cache hit.
[2026-06-10 19:14:14] [INFO ] Implicit Places using invariants in 116 ms returned [135]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 319/320 places, 409/409 transitions.
Applied a total of 0 rules in 3 ms. Remains 319 /319 variables (removed 0) and now considering 409/409 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 127 ms. Remains : 319/320 places, 409/409 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(X(p0)))'
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : LastZero-COL-N16-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA LastZero-COL-N16-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-COL-N16-LTLFireability-07 finished in 250 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((X(G(!p1))||p0)))'
Support contains 304 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 409/409 transitions.
Applied a total of 0 rules in 1 ms. Remains 320 /320 variables (removed 0) and now considering 409/409 (removed 0) transitions.
[2026-06-10 19:14:14] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
[2026-06-10 19:14:14] [INFO ] Invariant cache hit.
[2026-06-10 19:14:14] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-06-10 19:14:14] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
[2026-06-10 19:14:14] [INFO ] Invariant cache hit.
[2026-06-10 19:14:14] [INFO ] State equation strengthened by 137 read => feed constraints.
[2026-06-10 19:14:14] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 320/320 places, 409/409 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((X(G(p1))||p0)))'
Stuttering acceptance computed with spot in 85 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : LastZero-COL-N16-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA LastZero-COL-N16-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-COL-N16-LTLFireability-08 finished in 390 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((X(X(X(p0)))||(!p0 U (p1||G(!p0)))))))'
Support contains 304 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 409/409 transitions.
Applied a total of 0 rules in 2 ms. Remains 320 /320 variables (removed 0) and now considering 409/409 (removed 0) transitions.
[2026-06-10 19:14:15] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
[2026-06-10 19:14:15] [INFO ] Invariant cache hit.
[2026-06-10 19:14:15] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-06-10 19:14:15] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
[2026-06-10 19:14:15] [INFO ] Invariant cache hit.
[2026-06-10 19:14:15] [INFO ] State equation strengthened by 137 read => feed constraints.
[2026-06-10 19:14:15] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 268 ms. Remains : 320/320 places, 409/409 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((X(X(X(p0)))||(!p0 U (p1||G(!p0)))))))'
Stuttering acceptance computed with spot in 313 ms :[false, false, false, false, false, false, false, false]
Running random walk in product with property : LastZero-COL-N16-LTLFireability-09
Product exploration explored 100000 steps with 16456 reset in 7847 ms.
Product exploration explored 100000 steps with 16389 reset in 7768 ms.
Computed a total of 320 stabilizing places and 409 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 320 transition count 409
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 8 factoid took 22 ms. Proved property starting from automaton with 8 states, 12 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 229 ms.
FORMULA LastZero-COL-N16-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LastZero-COL-N16-LTLFireability-09 finished in 16514 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(X(p0)))'
Support contains 151 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 409/409 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 305 transition count 394
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 305 transition count 394
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 290 transition count 379
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 290 transition count 379
Applied a total of 60 rules in 13 ms. Remains 290 /320 variables (removed 30) and now considering 379/409 (removed 30) transitions.
[2026-06-10 19:14:31] [INFO ] Flow matrix only has 259 transitions (discarded 120 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5850479881750259493.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11761491706768145288.kers'
[2026-06-10 19:14:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5850479881750259493.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11761491706768145288.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 259 rows 288 cols 635 entries
Finished phase 1 with 258 SingleSign rule and 1 generalized
[2026-06-10 19:14:31] [INFO ] Computed 31 invariants in 0 ms
Computed 31 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11761491706768145288.kers
Total runtime 1 ms.
[2026-06-10 19:14:31] [INFO ] Implicit Places using invariants in 115 ms returned [135]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 289/320 places, 379/409 transitions.
Applied a total of 0 rules in 2 ms. Remains 289 /289 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 134 ms. Remains : 289/320 places, 379/409 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(X(p0)))'
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : LastZero-COL-N16-LTLFireability-10
Product exploration explored 100000 steps with 33333 reset in 190 ms.
Product exploration explored 100000 steps with 33333 reset in 211 ms.
Computed a total of 289 stabilizing places and 379 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 289 transition count 379
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 16 ms. Proved property starting from automaton with 4 states, 4 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 119 ms.
FORMULA LastZero-COL-N16-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LastZero-COL-N16-LTLFireability-10 finished in 820 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(!p0))'
Support contains 151 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 409/409 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 305 transition count 394
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 305 transition count 394
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 290 transition count 379
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 290 transition count 379
Applied a total of 60 rules in 25 ms. Remains 290 /320 variables (removed 30) and now considering 379/409 (removed 30) transitions.
[2026-06-10 19:14:32] [INFO ] Flow matrix only has 259 transitions (discarded 120 similar events)
[2026-06-10 19:14:32] [INFO ] Invariant cache hit.
[2026-06-10 19:14:32] [INFO ] Implicit Places using invariants in 93 ms returned [135]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 94 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/320 places, 379/409 transitions.
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 2 place count 288 transition count 378
Applied a total of 2 rules in 13 ms. Remains 288 /289 variables (removed 1) and now considering 378/379 (removed 1) transitions.
[2026-06-10 19:14:32] [INFO ] Flow matrix only has 258 transitions (discarded 120 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6382206874270981605.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11642546901901628156.kers'
[2026-06-10 19:14:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6382206874270981605.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11642546901901628156.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 258 rows 286 cols 632 entries
Finished phase 1 with 258 SingleSign rule and 0 generalized
[2026-06-10 19:14:32] [INFO ] Computed 30 invariants in 2 ms
Computed 30 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11642546901901628156.kers
Total runtime 3 ms.
[2026-06-10 19:14:32] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-06-10 19:14:32] [INFO ] Flow matrix only has 258 transitions (discarded 120 similar events)
[2026-06-10 19:14:32] [INFO ] Invariant cache hit.
[2026-06-10 19:14:32] [INFO ] State equation strengthened by 122 read => feed constraints.
[2026-06-10 19:14:33] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 288/320 places, 378/409 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 762 ms. Remains : 288/320 places, 378/409 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(p0))'
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : LastZero-COL-N16-LTLFireability-11
Product exploration explored 100000 steps with 3296 reset in 375 ms.
Product exploration explored 100000 steps with 3290 reset in 396 ms.
Computed a total of 288 stabilizing places and 378 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 288 transition count 378
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 4 factoid took 15 ms. Proved property starting from automaton with 1 states, 1 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 114 ms.
FORMULA LastZero-COL-N16-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LastZero-COL-N16-LTLFireability-11 finished in 1721 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||F((p0&&F(p1))))))'
Support contains 304 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 409/409 transitions.
Applied a total of 0 rules in 2 ms. Remains 320 /320 variables (removed 0) and now considering 409/409 (removed 0) transitions.
[2026-06-10 19:14:34] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11112658740882238665.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1495686056093504463.kers'
[2026-06-10 19:14:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11112658740882238665.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1495686056093504463.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 289 rows 319 cols 711 entries
Finished phase 1 with 289 SingleSign rule and 0 generalized
[2026-06-10 19:14:34] [INFO ] Computed 31 invariants in 3 ms
Computed 31 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1495686056093504463.kers
Total runtime 3 ms.
[2026-06-10 19:14:34] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-06-10 19:14:34] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
[2026-06-10 19:14:34] [INFO ] Invariant cache hit.
[2026-06-10 19:14:34] [INFO ] State equation strengthened by 137 read => feed constraints.
[2026-06-10 19:14:34] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 265 ms. Remains : 320/320 places, 409/409 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((F((p0&&F(p1)))||!p0)))'
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : LastZero-COL-N16-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 451 ms.
Product exploration explored 100000 steps with 50000 reset in 459 ms.
Computed a total of 320 stabilizing places and 409 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 320 transition count 409
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 6 factoid took 15 ms. Proved property starting from automaton with 3 states, 3 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 163 ms.
FORMULA LastZero-COL-N16-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LastZero-COL-N16-LTLFireability-12 finished in 1543 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(F(!p0))||(p0&&X(F(!p0))))))'
Support contains 288 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 409/409 transitions.
Applied a total of 0 rules in 13 ms. Remains 320 /320 variables (removed 0) and now considering 409/409 (removed 0) transitions.
[2026-06-10 19:14:35] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
[2026-06-10 19:14:35] [INFO ] Invariant cache hit.
[2026-06-10 19:14:35] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-06-10 19:14:35] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
[2026-06-10 19:14:35] [INFO ] Invariant cache hit.
[2026-06-10 19:14:35] [INFO ] State equation strengthened by 137 read => feed constraints.
[2026-06-10 19:14:36] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2026-06-10 19:14:36] [INFO ] Redundant transitions in 11 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 367 ms. Remains : 320/320 places, 409/409 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(F(p0))||(X(F(p0))&&!p0))))'
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LastZero-COL-N16-LTLFireability-13
Product exploration explored 100000 steps with 3161 reset in 3045 ms.
Product exploration explored 100000 steps with 3150 reset in 3041 ms.
Computed a total of 320 stabilizing places and 409 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 320 transition count 409
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 3 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).
RANDOM walk for 4 steps (0 resets) in 7 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 107 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)]
Knowledge-based reduction took 443 ms.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Support contains 288 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 409/409 transitions.
Applied a total of 0 rules in 9 ms. Remains 320 /320 variables (removed 0) and now considering 409/409 (removed 0) transitions.
[2026-06-10 19:14:43] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
[2026-06-10 19:14:43] [INFO ] Invariant cache hit.
[2026-06-10 19:14:43] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-06-10 19:14:43] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
[2026-06-10 19:14:43] [INFO ] Invariant cache hit.
[2026-06-10 19:14:43] [INFO ] State equation strengthened by 137 read => feed constraints.
[2026-06-10 19:14:43] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2026-06-10 19:14:43] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 369 ms. Remains : 320/320 places, 409/409 transitions.
Computed a total of 320 stabilizing places and 409 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 320 transition count 409
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 3 factoid took 101 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 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 101 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 86 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 453 ms.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3123 reset in 3035 ms.
Product exploration explored 100000 steps with 3153 reset in 3027 ms.
Built C files in :
/tmp/ltsmin1297854577830361989
[2026-06-10 19:14:50] [INFO ] Computing symmetric may disable matrix : 409 transitions.
[2026-06-10 19:14:50] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:14:50] [INFO ] Computing symmetric may enable matrix : 409 transitions.
[2026-06-10 19:14:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:14:50] [INFO ] Computing Do-Not-Accords matrix : 409 transitions.
[2026-06-10 19:14:50] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:14:50] [INFO ] Built C files in 158ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1297854577830361989
Running compilation step : cd /tmp/ltsmin1297854577830361989;'/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 1208 ms.
Running link step : cd /tmp/ltsmin1297854577830361989;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin1297854577830361989;'/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/stateBased7991851093742862081.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 288 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 409/409 transitions.
Applied a total of 0 rules in 12 ms. Remains 320 /320 variables (removed 0) and now considering 409/409 (removed 0) transitions.
[2026-06-10 19:15:05] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
[2026-06-10 19:15:05] [INFO ] Invariant cache hit.
[2026-06-10 19:15:05] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-06-10 19:15:05] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
[2026-06-10 19:15:05] [INFO ] Invariant cache hit.
[2026-06-10 19:15:05] [INFO ] State equation strengthened by 137 read => feed constraints.
[2026-06-10 19:15:05] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2026-06-10 19:15:05] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 357 ms. Remains : 320/320 places, 409/409 transitions.
Built C files in :
/tmp/ltsmin11156638637476096182
[2026-06-10 19:15:05] [INFO ] Computing symmetric may disable matrix : 409 transitions.
[2026-06-10 19:15:05] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:15:05] [INFO ] Computing symmetric may enable matrix : 409 transitions.
[2026-06-10 19:15:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:15:05] [INFO ] Computing Do-Not-Accords matrix : 409 transitions.
[2026-06-10 19:15:05] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:15:05] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11156638637476096182
Running compilation step : cd /tmp/ltsmin11156638637476096182;'/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 1239 ms.
Running link step : cd /tmp/ltsmin11156638637476096182;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin11156638637476096182;'/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/stateBased11637882994274565439.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-06-10 19:15:20] [INFO ] Flatten gal took : 21 ms
[2026-06-10 19:15:21] [INFO ] Flatten gal took : 20 ms
[2026-06-10 19:15:21] [INFO ] Time to serialize gal into /tmp/LTL9105072161550884151.gal : 6 ms
[2026-06-10 19:15:21] [INFO ] Time to serialize properties into /tmp/LTL5658400447236573123.prop : 12 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/LTL9105072161550884151.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8470797545076558309.hoa' '-atoms' '/tmp/LTL5658400447236573123.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...317
Loading property file /tmp/LTL5658400447236573123.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8470797545076558309.hoa
Reverse transition relation is NOT exact ! Due to transitions t136, t138, t139, t140, t141, t142, t143, t144, t145, t146, t147, t148, t149, t150, t151, t15...985
Computing Next relation with stutter on 32768 deadlock states
Detected timeout of ITS tools.
[2026-06-10 19:15:36] [INFO ] Flatten gal took : 32 ms
[2026-06-10 19:15:36] [INFO ] Flatten gal took : 31 ms
[2026-06-10 19:15:36] [INFO ] Time to serialize gal into /tmp/LTL8475945772867006192.gal : 3 ms
[2026-06-10 19:15:36] [INFO ] Time to serialize properties into /tmp/LTL13570005407934999583.ltl : 34 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/LTL8475945772867006192.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13570005407934999583.ltl' '-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...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(((((((((((((array_241<1)||(tmp_239<1))&&((array_283<1)||(tmp_275<1)))&&(((array_210<1)||(tmp_211<1))&&((array_252<1)||(tmp...159563
Formula 0 simplified : G(FG!"(((((((((((((array_241<1)||(tmp_239<1))&&((array_283<1)||(tmp_275<1)))&&(((array_210<1)||(tmp_211<1))&&((array_252<1)||(tmp_24...159551
Reverse transition relation is NOT exact ! Due to transitions t136, t138, t139, t140, t141, t142, t143, t144, t145, t146, t147, t148, t149, t150, t151, t15...985
Computing Next relation with stutter on 32768 deadlock states
Detected timeout of ITS tools.
[2026-06-10 19:15:51] [INFO ] Flatten gal took : 29 ms
[2026-06-10 19:15:51] [INFO ] Applying decomposition
[2026-06-10 19:15:51] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph895068258157779717.txt' '-o' '/tmp/graph895068258157779717.bin' '-w' '/tmp/graph895068258157779717.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph895068258157779717.bin' '-l' '-1' '-v' '-w' '/tmp/graph895068258157779717.weights' '-q' '0' '-e' '0.001'
[2026-06-10 19:15:51] [INFO ] Decomposing Gal with order
[2026-06-10 19:15:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 19:15:51] [INFO ] Removed a total of 410 redundant transitions.
[2026-06-10 19:15:51] [INFO ] Flatten gal took : 193 ms
[2026-06-10 19:15:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 14 ms.
[2026-06-10 19:15:52] [INFO ] Time to serialize gal into /tmp/LTL5247204385935605591.gal : 7 ms
[2026-06-10 19:15:52] [INFO ] Time to serialize properties into /tmp/LTL10877730480708813307.ltl : 27 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/LTL5247204385935605591.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10877730480708813307.ltl' '-c' '-stutter-deadlock'

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...255
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(((((((((((((i2.u94.array_241<1)||(i1.u93.tmp_239<1))&&((i2.u112.array_283<1)||(i2.u101.tmp_275<1)))&&(((i4.u30.array_210<1...236789
Formula 0 simplified : G(FG!"(((((((((((((i2.u94.array_241<1)||(i1.u93.tmp_239<1))&&((i2.u112.array_283<1)||(i2.u101.tmp_275<1)))&&(((i4.u30.array_210<1)||...236777
Reverse transition relation is NOT exact ! Due to transitions t158, t159, t160, t161, t162, t182, t184, t185, t186, t187, t188, t190, t191, t216, t219, t22...1382
Computing Next relation with stutter on 32768 deadlock states
Detected timeout of ITS tools.
Treatment of property LastZero-COL-N16-LTLFireability-13 finished in 91559 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(!p0)||(F(p0)&&(!p1 U G(p2)))))'
Support contains 320 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 409/409 transitions.
Applied a total of 0 rules in 8 ms. Remains 320 /320 variables (removed 0) and now considering 409/409 (removed 0) transitions.
[2026-06-10 19:16:07] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
[2026-06-10 19:16:07] [INFO ] Invariant cache hit.
[2026-06-10 19:16:07] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-06-10 19:16:07] [INFO ] Flow matrix only has 289 transitions (discarded 120 similar events)
[2026-06-10 19:16:07] [INFO ] Invariant cache hit.
[2026-06-10 19:16:07] [INFO ] State equation strengthened by 137 read => feed constraints.
[2026-06-10 19:16:07] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2026-06-10 19:16:07] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 224 ms. Remains : 320/320 places, 409/409 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(p0)||(F(!p0)&&(!p1 U G(p2)))))'
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : LastZero-COL-N16-LTLFireability-14
Entered a terminal (fully accepting) state of product in 31 steps with 0 reset in 1 ms.
FORMULA LastZero-COL-N16-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-COL-N16-LTLFireability-14 finished in 528 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(F(!p0))||(p0&&X(F(!p0))))))'
Spot run failed in 39 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-06-10 19:16:07] [INFO ] Flatten gal took : 40 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15014602396852376041
[2026-06-10 19:16:07] [INFO ] Applying decomposition
[2026-06-10 19:16:07] [INFO ] Computing symmetric may disable matrix : 409 transitions.
[2026-06-10 19:16:07] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:16:07] [INFO ] Computing symmetric may enable matrix : 409 transitions.
[2026-06-10 19:16:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:16:07] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16614005397465697699.txt' '-o' '/tmp/graph16614005397465697699.bin' '-w' '/tmp/graph16614005397465697699.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16614005397465697699.bin' '-l' '-1' '-v' '-w' '/tmp/graph16614005397465697699.weights' '-q' '0' '-e' '0.001'
[2026-06-10 19:16:08] [INFO ] Decomposing Gal with order
[2026-06-10 19:16:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 19:16:08] [INFO ] Computing Do-Not-Accords matrix : 409 transitions.
[2026-06-10 19:16:08] [INFO ] Removed a total of 393 redundant transitions.
[2026-06-10 19:16:08] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:16:08] [INFO ] Built C files in 178ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15014602396852376041
Running compilation step : cd /tmp/ltsmin15014602396852376041;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' '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'
[2026-06-10 19:16:08] [INFO ] Flatten gal took : 58 ms
[2026-06-10 19:16:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 105 labels/synchronizations in 11 ms.
[2026-06-10 19:16:08] [INFO ] Time to serialize gal into /tmp/LTLFireability10217749653151238113.gal : 5 ms
[2026-06-10 19:16:08] [INFO ] Time to serialize properties into /tmp/LTLFireability9267915387343678437.ltl : 20 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/LTLFireability10217749653151238113.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9267915387343678437.ltl' '-c' '-stutter-deadlock'

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...277
Read 1 LTL properties
Checking formula 0 : !((F((G(F(!("(((((((((((((i2.i1.u36.array_241>=1)&&(i2.i1.u33.tmp_239>=1))||((i4.u42.array_283>=1)&&(i4.u93.tmp_275>=1)))||(((i2.i1.u8...252761
Formula 0 simplified : G(FG"(((((((((((((i2.i1.u36.array_241>=1)&&(i2.i1.u33.tmp_239>=1))||((i4.u42.array_283>=1)&&(i4.u93.tmp_275>=1)))||(((i2.i1.u87.arra...252741
Compilation finished in 1306 ms.
Running link step : cd /tmp/ltsmin15014602396852376041;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15014602396852376041;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '<>(([](<>(!(LTLAPp0==true)))||((LTLAPp0==true)&&X(<>(!(LTLAPp0==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t138, t139, t165, t169, t172, t185, t192, t193, t197, t199, t201, t226, t228, t229, t231, t23...1472
Computing Next relation with stutter on 32768 deadlock states
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
2484 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,24.8829,646696,1,0,676561,676,19029,5.34936e+06,183,3896,1820794
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LastZero-COL-N16-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 403092 ms.

BK_STOP 1781118998683

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

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