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-178024402800107.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is LastZero-PT-N14, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402800107
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 5.6K May 27 10:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 27 10:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 27 10:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 27 10:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 16 12:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 16 12:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 16 12:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 16 12:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 7.7K May 27 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K May 27 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 27 10:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 27 10:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 16 12:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 16 12:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 4 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 1.2M Jun 10 11:58 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME LastZero-PT-N14-LTLCardinality-00
FORMULA_NAME LastZero-PT-N14-LTLCardinality-01
FORMULA_NAME LastZero-PT-N14-LTLCardinality-02
FORMULA_NAME LastZero-PT-N14-LTLCardinality-03
FORMULA_NAME LastZero-PT-N14-LTLCardinality-04
FORMULA_NAME LastZero-PT-N14-LTLCardinality-05
FORMULA_NAME LastZero-PT-N14-LTLCardinality-06
FORMULA_NAME LastZero-PT-N14-LTLCardinality-07
FORMULA_NAME LastZero-PT-N14-LTLCardinality-08
FORMULA_NAME LastZero-PT-N14-LTLCardinality-09
FORMULA_NAME LastZero-PT-N14-LTLCardinality-10
FORMULA_NAME LastZero-PT-N14-LTLCardinality-11
FORMULA_NAME LastZero-PT-N14-LTLCardinality-12
FORMULA_NAME LastZero-PT-N14-LTLCardinality-13
FORMULA_NAME LastZero-PT-N14-LTLCardinality-14
FORMULA_NAME LastZero-PT-N14-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1781642949068

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LastZero-PT-N14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-06-16 20:49:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-16 20:49:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-16 20:49:10] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2026-06-16 20:49:10] [INFO ] Transformed 480 places.
[2026-06-16 20:49:10] [INFO ] Transformed 3767 transitions.
[2026-06-16 20:49:10] [INFO ] Parsed PT model containing 480 places and 3767 transitions and 11693 arcs in 278 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 226 places in 29 ms
Reduce places removed 226 places and 2437 transitions.
Reduce places removed 1 places and 0 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA LastZero-PT-N14-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N14-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N14-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N14-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N14-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N14-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N14-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N14-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N14-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N14-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N14-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N14-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 1330/1330 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 252 transition count 1330
Applied a total of 1 rules in 44 ms. Remains 252 /253 variables (removed 1) and now considering 1330/1330 (removed 0) transitions.
[2026-06-16 20:49:10] [INFO ] Flow matrix only has 1239 transitions (discarded 91 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10365478618056333747.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6476790252833069164.kers'
[2026-06-16 20:49:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10365478618056333747.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6476790252833069164.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1239 rows 251 cols 3386 entries
Finished phase 1 with 238 SingleSign rule and 0 generalized
[2026-06-16 20:49:10] [INFO ] Computed 14 invariants in 4 ms
Computed 14 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-6476790252833069164.kers
Total runtime 6 ms.
[2026-06-16 20:49:11] [INFO ] Implicit Places using invariants in 482 ms returned []
[2026-06-16 20:49:11] [INFO ] Flow matrix only has 1239 transitions (discarded 91 similar events)
[2026-06-16 20:49:11] [INFO ] Invariant cache hit.
[2026-06-16 20:49:11] [INFO ] State equation strengthened by 210 read => feed constraints.
[2026-06-16 20:49:21] [INFO ] Implicit Places using invariants and state equation in 9738 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10270 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 251/253 places, 1330/1330 transitions.
Applied a total of 0 rules in 12 ms. Remains 251 /251 variables (removed 0) and now considering 1330/1330 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10340 ms. Remains : 251/253 places, 1330/1330 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 1330/1330 transitions.
Applied a total of 0 rules in 7 ms. Remains 251 /251 variables (removed 0) and now considering 1330/1330 (removed 0) transitions.
[2026-06-16 20:49:21] [INFO ] Flow matrix only has 1239 transitions (discarded 91 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2862277176028765165.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11372843422217684426.kers'
[2026-06-16 20:49:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2862277176028765165.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11372843422217684426.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1239 rows 250 cols 3372 entries
Finished phase 1 with 238 SingleSign rule and 0 generalized
[2026-06-16 20:49:21] [INFO ] Computed 13 invariants in 3 ms
Computed 13 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11372843422217684426.kers
Total runtime 4 ms.
[2026-06-16 20:49:21] [INFO ] Implicit Places using invariants in 177 ms returned []
[2026-06-16 20:49:21] [INFO ] Flow matrix only has 1239 transitions (discarded 91 similar events)
[2026-06-16 20:49:21] [INFO ] Invariant cache hit.
[2026-06-16 20:49:21] [INFO ] State equation strengthened by 210 read => feed constraints.
[2026-06-16 20:49:30] [INFO ] Implicit Places using invariants and state equation in 8812 ms returned []
Implicit Place search using SMT with State Equation took 8991 ms to find 0 implicit places.
Running 1316 sub problems to find dead transitions.
[2026-06-16 20:49:30] [INFO ] Flow matrix only has 1239 transitions (discarded 91 similar events)
[2026-06-16 20:49:30] [INFO ] Invariant cache hit.
[2026-06-16 20:49:30] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1316 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1316 unsolved
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
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 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 TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 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 TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 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 TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 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 TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 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 TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 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 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 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 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 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 TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 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
At refinement iteration 2 (OVERLAPS) 1239/1489 variables, 250/263 constraints. Problems are: Problem set: 1014 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1489 variables, 210/473 constraints. Problems are: Problem set: 1014 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1489/1490 variables, and 473 constraints, problems are : Problem set: 1014 solved, 302 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 250/251 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 1316/1316 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1014 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 13/13 constraints. Problems are: Problem set: 1014 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/13 constraints. Problems are: Problem set: 1014 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 1239/1489 variables, 250/263 constraints. Problems are: Problem set: 1014 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1489 variables, 210/473 constraints. Problems are: Problem set: 1014 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1489 variables, 302/775 constraints. Problems are: Problem set: 1014 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1489 variables, 0/775 constraints. Problems are: Problem set: 1014 solved, 302 unsolved
At refinement iteration 6 (OVERLAPS) 1/1490 variables, 1/776 constraints. Problems are: Problem set: 1014 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1490/1490 variables, and 776 constraints, problems are : Problem set: 1014 solved, 302 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 251/251 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 302/1316 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60642ms problems are : Problem set: 1014 solved, 302 unsolved
Search for dead transitions found 1014 dead transitions in 60664ms
Found 1014 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1014 transitions
Dead transitions reduction (with SMT) removed 1014 transitions
Starting structural reductions in LTL mode, iteration 1 : 251/251 places, 316/1330 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 238 transition count 303
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 238 transition count 303
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 225 transition count 290
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 225 transition count 290
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 64 place count 213 transition count 266
Iterating global reduction 0 with 12 rules applied. Total rules applied 76 place count 213 transition count 266
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 88 place count 201 transition count 254
Iterating global reduction 0 with 12 rules applied. Total rules applied 100 place count 201 transition count 254
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 111 place count 190 transition count 232
Iterating global reduction 0 with 11 rules applied. Total rules applied 122 place count 190 transition count 232
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 180 transition count 222
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 180 transition count 222
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 170 transition count 202
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 170 transition count 202
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 172 place count 160 transition count 192
Iterating global reduction 0 with 10 rules applied. Total rules applied 182 place count 160 transition count 192
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 190 place count 152 transition count 176
Iterating global reduction 0 with 8 rules applied. Total rules applied 198 place count 152 transition count 176
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 204 place count 146 transition count 170
Iterating global reduction 0 with 6 rules applied. Total rules applied 210 place count 146 transition count 170
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 215 place count 141 transition count 160
Iterating global reduction 0 with 5 rules applied. Total rules applied 220 place count 141 transition count 160
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 225 place count 136 transition count 155
Iterating global reduction 0 with 5 rules applied. Total rules applied 230 place count 136 transition count 155
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 234 place count 132 transition count 147
Iterating global reduction 0 with 4 rules applied. Total rules applied 238 place count 132 transition count 147
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 241 place count 129 transition count 144
Iterating global reduction 0 with 3 rules applied. Total rules applied 244 place count 129 transition count 144
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 246 place count 127 transition count 140
Iterating global reduction 0 with 2 rules applied. Total rules applied 248 place count 127 transition count 140
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 250 place count 125 transition count 138
Iterating global reduction 0 with 2 rules applied. Total rules applied 252 place count 125 transition count 138
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 253 place count 124 transition count 136
Iterating global reduction 0 with 1 rules applied. Total rules applied 254 place count 124 transition count 136
Applied a total of 254 rules in 63 ms. Remains 124 /251 variables (removed 127) and now considering 136/316 (removed 180) transitions.
[2026-06-16 20:50:30] [INFO ] Flow matrix only has 103 transitions (discarded 33 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17650419006796140023.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10323173204036759769.kers'
[2026-06-16 20:50:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17650419006796140023.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10323173204036759769.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 103 rows 120 cols 242 entries
Finished phase 1 with 95 SingleSign rule and 3 generalized
[2026-06-16 20:50:30] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10323173204036759769.kers
Total runtime 1 ms.
[2026-06-16 20:50:30] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-06-16 20:50:30] [INFO ] Flow matrix only has 103 transitions (discarded 33 similar events)
[2026-06-16 20:50:30] [INFO ] Invariant cache hit.
[2026-06-16 20:50:31] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-06-16 20:50:31] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 124/251 places, 136/1330 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70068 ms. Remains : 124/251 places, 136/1330 transitions.
Support contains 9 out of 124 places after structural reductions.
[2026-06-16 20:50:31] [INFO ] Flatten gal took : 39 ms
[2026-06-16 20:50:31] [INFO ] Flatten gal took : 22 ms
[2026-06-16 20:50:31] [INFO ] Input system was already deterministic with 136 transitions.
RANDOM walk for 40000 steps (928 resets) in 1015 ms. (39 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (124 resets) in 144 ms. (275 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (125 resets) in 111 ms. (357 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (119 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (125 resets) in 101 ms. (392 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (125 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (125 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
[2026-06-16 20:50:31] [INFO ] Flow matrix only has 103 transitions (discarded 33 similar events)
[2026-06-16 20:50:31] [INFO ] Invariant cache hit.
[2026-06-16 20:50:31] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (OVERLAPS) 19/26 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 7/33 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/36 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 7 (OVERLAPS) 1/37 variables, 1/8 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 34/71 variables, 37/45 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 0/45 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 24/95 variables, 24/69 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/95 variables, 0/69 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 55/150 variables, 40/109 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/150 variables, 2/111 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/150 variables, 4/115 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/150 variables, 0/115 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 5/155 variables, 5/120 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/155 variables, 5/125 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/155 variables, 0/125 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 1/156 variables, 1/126 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/156 variables, 1/127 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/156 variables, 0/127 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 4/160 variables, 2/129 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/160 variables, 0/129 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 3/163 variables, 2/131 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/163 variables, 0/131 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 2/165 variables, 1/132 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/165 variables, 0/132 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 2/167 variables, 1/133 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/167 variables, 0/133 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 12/179 variables, 10/143 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/179 variables, 0/143 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 42/221 variables, 29/172 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/221 variables, 5/177 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/221 variables, 7/184 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/221 variables, 0/184 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 4/225 variables, 4/188 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/225 variables, 4/192 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/225 variables, 0/192 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 1/226 variables, 1/193 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/226 variables, 1/194 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/226 variables, 0/194 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 1/227 variables, 1/195 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/227 variables, 0/195 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 45 (OVERLAPS) 0/227 variables, 0/195 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 195 constraints, problems are : Problem set: 3 solved, 3 unsolved in 676 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/19 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 18/37 variables, 19/23 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/23 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 12/49 variables, 12/35 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 31/80 variables, 21/56 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 2/58 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/80 variables, 3/61 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/80 variables, 0/61 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 5/85 variables, 4/65 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/85 variables, 3/68 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/85 variables, 0/68 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 5/90 variables, 4/72 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/90 variables, 0/72 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 4/94 variables, 2/74 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/94 variables, 0/74 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 4/98 variables, 2/76 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/98 variables, 0/76 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 3/101 variables, 2/78 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/101 variables, 0/78 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 2/103 variables, 1/79 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/103 variables, 0/79 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 2/105 variables, 1/80 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/105 variables, 0/80 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 26/131 variables, 14/94 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/131 variables, 0/94 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 86/217 variables, 59/153 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/217 variables, 9/162 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/217 variables, 17/179 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/217 variables, 0/179 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 6/223 variables, 6/185 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/223 variables, 6/191 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/223 variables, 0/191 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 3/226 variables, 3/194 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/226 variables, 3/197 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/226 variables, 0/197 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 1/227 variables, 1/198 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/227 variables, 0/198 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 42 (OVERLAPS) 0/227 variables, 0/198 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 198 constraints, problems are : Problem set: 3 solved, 3 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1114ms problems are : Problem set: 3 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 3 properties in 11 ms.
Successfully simplified 3 atomic propositions for a total of 4 simplifications.
Computed a total of 124 stabilizing places and 136 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 124 transition count 136
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA LastZero-PT-N14-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(X(X(G(p0))))))'
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 136/136 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 118 transition count 129
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 118 transition count 129
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 114 transition count 122
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 114 transition count 122
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 110 transition count 117
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 110 transition count 117
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 106 transition count 110
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 106 transition count 110
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 102 transition count 105
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 102 transition count 105
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 98 transition count 98
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 98 transition count 98
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 94 transition count 93
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 94 transition count 93
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 90 transition count 86
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 90 transition count 86
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 72 place count 86 transition count 81
Iterating global reduction 0 with 4 rules applied. Total rules applied 76 place count 86 transition count 81
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 82 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 82 transition count 74
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 78 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 78 transition count 69
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 96 place count 74 transition count 62
Iterating global reduction 0 with 4 rules applied. Total rules applied 100 place count 74 transition count 62
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 103 place count 71 transition count 59
Iterating global reduction 0 with 3 rules applied. Total rules applied 106 place count 71 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 107 place count 70 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 108 place count 70 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 109 place count 69 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 110 place count 69 transition count 56
Applied a total of 110 rules in 15 ms. Remains 69 /124 variables (removed 55) and now considering 56/136 (removed 80) transitions.
[2026-06-16 20:50:33] [INFO ] Flow matrix only has 43 transitions (discarded 13 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15909249083821818638.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17887672422238044799.kers'
[2026-06-16 20:50:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15909249083821818638.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17887672422238044799.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 43 rows 56 cols 84 entries
Finished phase 1 with 31 SingleSign rule and 12 generalized
[2026-06-16 20:50:33] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17887672422238044799.kers
Total runtime 0 ms.
[2026-06-16 20:50:33] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-06-16 20:50:33] [INFO ] Flow matrix only has 43 transitions (discarded 13 similar events)
[2026-06-16 20:50:33] [INFO ] Invariant cache hit.
[2026-06-16 20:50:33] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-06-16 20:50:33] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 42 sub problems to find dead transitions.
[2026-06-16 20:50:33] [INFO ] Flow matrix only has 43 transitions (discarded 13 similar events)
[2026-06-16 20:50:33] [INFO ] Invariant cache hit.
[2026-06-16 20:50:33] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 43/111 variables, 68/94 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 15/109 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Problem TDEAD48 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/112 variables, 1/110 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 0/112 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 110 constraints, problems are : Problem set: 1 solved, 41 unsolved in 701 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 69/69 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 14/14 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 12/26 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 43/111 variables, 68/94 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 15/109 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 41/150 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 1/112 variables, 1/151 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 0/112 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 151 constraints, problems are : Problem set: 1 solved, 41 unsolved in 837 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 69/69 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 41/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1541ms problems are : Problem set: 1 solved, 41 unsolved
Search for dead transitions found 1 dead transitions in 1541ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 69/124 places, 55/136 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 55/55 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1676 ms. Remains : 69/124 places, 55/136 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(X(X(G(p0))))))'
Stuttering acceptance computed with spot in 335 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LastZero-PT-N14-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 90 steps with 2 reset in 4 ms.
FORMULA LastZero-PT-N14-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-PT-N14-LTLCardinality-01 finished in 2078 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(G(p0))))'
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 136/136 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 130
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 130
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 115 transition count 123
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 115 transition count 123
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 111 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 111 transition count 118
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 107 transition count 111
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 107 transition count 111
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 103 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 103 transition count 106
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 100 transition count 101
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 100 transition count 101
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 97 transition count 97
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 97 transition count 97
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 94 transition count 92
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 94 transition count 92
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 91 transition count 88
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 91 transition count 88
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 88 transition count 83
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 88 transition count 83
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 85 transition count 79
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 85 transition count 79
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 81 place count 82 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 84 place count 82 transition count 74
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 80 transition count 72
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 80 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 79 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 79 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 78 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 78 transition count 69
Applied a total of 92 rules in 17 ms. Remains 78 /124 variables (removed 46) and now considering 69/136 (removed 67) transitions.
[2026-06-16 20:50:35] [INFO ] Flow matrix only has 53 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1772158585930943859.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3904877278467567488.kers'
[2026-06-16 20:50:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1772158585930943859.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3904877278467567488.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 53 rows 69 cols 112 entries
Finished phase 1 with 44 SingleSign rule and 8 generalized
[2026-06-16 20:50:35] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3904877278467567488.kers
Total runtime 0 ms.
[2026-06-16 20:50:35] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-06-16 20:50:35] [INFO ] Flow matrix only has 53 transitions (discarded 16 similar events)
[2026-06-16 20:50:35] [INFO ] Invariant cache hit.
[2026-06-16 20:50:35] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-06-16 20:50:35] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 55 sub problems to find dead transitions.
[2026-06-16 20:50:35] [INFO ] Flow matrix only has 53 transitions (discarded 16 similar events)
[2026-06-16 20:50:35] [INFO ] Invariant cache hit.
[2026-06-16 20:50:35] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 53/130 variables, 77/107 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 55 unsolved
Problem TDEAD56 is UNSAT
At refinement iteration 7 (OVERLAPS) 1/131 variables, 1/128 constraints. Problems are: Problem set: 1 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/128 constraints. Problems are: Problem set: 1 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 0/131 variables, 0/128 constraints. Problems are: Problem set: 1 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 128 constraints, problems are : Problem set: 1 solved, 54 unsolved in 1512 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 78/78 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 18/18 constraints. Problems are: Problem set: 1 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 8/26 constraints. Problems are: Problem set: 1 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 4/30 constraints. Problems are: Problem set: 1 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 53/130 variables, 77/108 constraints. Problems are: Problem set: 1 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 20/128 constraints. Problems are: Problem set: 1 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 54/182 constraints. Problems are: Problem set: 1 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 1/131 variables, 1/183 constraints. Problems are: Problem set: 1 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/183 constraints. Problems are: Problem set: 1 solved, 54 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/183 constraints. Problems are: Problem set: 1 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 183 constraints, problems are : Problem set: 1 solved, 54 unsolved in 1476 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 78/78 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 54/55 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2993ms problems are : Problem set: 1 solved, 54 unsolved
Search for dead transitions found 1 dead transitions in 2993ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 78/124 places, 68/136 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3168 ms. Remains : 78/124 places, 68/136 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(G(p0))))'
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LastZero-PT-N14-LTLCardinality-02
Product exploration explored 100000 steps with 2325 reset in 228 ms.
Product exploration explored 100000 steps with 2325 reset in 212 ms.
Computed a total of 78 stabilizing places and 68 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 78 transition count 68
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 48 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (928 resets) in 238 ms. (167 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (124 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1765297 steps, run visited all 1 properties in 2008 ms. (steps per millisecond=879 )
Probabilistic random walk after 1765297 steps, saw 238198 distinct states, run finished after 2013 ms. (steps per millisecond=876 ) properties seen :1
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 2400 ms.
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 68/68 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2026-06-16 20:50:41] [INFO ] Flow matrix only has 52 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5819452328508179387.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3365265654572419924.kers'
[2026-06-16 20:50:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5819452328508179387.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3365265654572419924.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 52 rows 69 cols 111 entries
Finished phase 1 with 42 SingleSign rule and 9 generalized
[2026-06-16 20:50:41] [INFO ] Computed 27 invariants in 0 ms
Computed 27 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3365265654572419924.kers
Total runtime 0 ms.
[2026-06-16 20:50:41] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-06-16 20:50:41] [INFO ] Flow matrix only has 52 transitions (discarded 16 similar events)
[2026-06-16 20:50:41] [INFO ] Invariant cache hit.
[2026-06-16 20:50:41] [INFO ] State equation strengthened by 19 read => feed constraints.
[2026-06-16 20:50:41] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2026-06-16 20:50:41] [INFO ] Flow matrix only has 52 transitions (discarded 16 similar events)
[2026-06-16 20:50:41] [INFO ] Invariant cache hit.
[2026-06-16 20:50:41] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 1/78 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 52/130 variables, 78/110 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 19/129 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 0/130 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 129 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1436 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 78/78 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 1/78 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 52/130 variables, 78/110 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 19/129 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 54/183 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 183 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1174 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 78/78 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2614ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 2614ms
Finished structural reductions in LTL mode , in 1 iterations and 2740 ms. Remains : 78/78 places, 68/68 transitions.
Computed a total of 78 stabilizing places and 68 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 78 transition count 68
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 52 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (928 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (124 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1765297 steps, run visited all 1 properties in 1845 ms. (steps per millisecond=956 )
Probabilistic random walk after 1765297 steps, saw 238198 distinct states, run finished after 1845 ms. (steps per millisecond=956 ) properties seen :1
Knowledge based reduction with 3 factoid took 53 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 2151 ms.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 82627 steps with 1921 reset in 122 ms.
FORMULA LastZero-PT-N14-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-PT-N14-LTLCardinality-02 finished in 11603 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 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 136/136 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 129
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 129
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 115 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 115 transition count 124
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 112 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 112 transition count 120
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 109 transition count 115
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 109 transition count 115
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 106 transition count 111
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 106 transition count 111
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 103 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 103 transition count 106
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 100 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 100 transition count 102
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 97 transition count 97
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 97 transition count 97
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 94 transition count 93
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 94 transition count 93
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 91 transition count 88
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 91 transition count 88
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 88 transition count 84
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 88 transition count 84
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 85 transition count 79
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 85 transition count 79
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 83 transition count 77
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 83 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 82 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 82 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 81 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 81 transition count 74
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 86 place count 80 transition count 73
Applied a total of 86 rules in 30 ms. Remains 80 /124 variables (removed 44) and now considering 73/136 (removed 63) transitions.
[2026-06-16 20:50:46] [INFO ] Flow matrix only has 55 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3170713389915680622.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8948845717239688387.kers'
[2026-06-16 20:50:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3170713389915680622.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8948845717239688387.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 55 rows 72 cols 119 entries
Finished phase 1 with 48 SingleSign rule and 6 generalized
[2026-06-16 20:50:46] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8948845717239688387.kers
Total runtime 3 ms.
[2026-06-16 20:50:46] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-06-16 20:50:47] [INFO ] Flow matrix only has 55 transitions (discarded 18 similar events)
[2026-06-16 20:50:47] [INFO ] Invariant cache hit.
[2026-06-16 20:50:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-06-16 20:50:47] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2026-06-16 20:50:47] [INFO ] Redundant transitions in 3 ms returned []
Running 59 sub problems to find dead transitions.
[2026-06-16 20:50:47] [INFO ] Flow matrix only has 55 transitions (discarded 18 similar events)
[2026-06-16 20:50:47] [INFO ] Invariant cache hit.
[2026-06-16 20:50:47] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 1/80 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Problem TDEAD56 is UNSAT
At refinement iteration 6 (OVERLAPS) 55/135 variables, 80/112 constraints. Problems are: Problem set: 1 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 22/134 constraints. Problems are: Problem set: 1 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/135 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 134 constraints, problems are : Problem set: 1 solved, 58 unsolved in 1665 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 80/80 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 19/19 constraints. Problems are: Problem set: 1 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 6/25 constraints. Problems are: Problem set: 1 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 6/31 constraints. Problems are: Problem set: 1 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 1/79 variables, 1/32 constraints. Problems are: Problem set: 1 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 54/133 variables, 79/111 constraints. Problems are: Problem set: 1 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 21/132 constraints. Problems are: Problem set: 1 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 58/190 constraints. Problems are: Problem set: 1 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/190 constraints. Problems are: Problem set: 1 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 2/135 variables, 1/191 constraints. Problems are: Problem set: 1 solved, 58 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 1/192 constraints. Problems are: Problem set: 1 solved, 58 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/135 variables, 0/192 constraints. Problems are: Problem set: 1 solved, 58 unsolved
At refinement iteration 13 (OVERLAPS) 0/135 variables, 0/192 constraints. Problems are: Problem set: 1 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 192 constraints, problems are : Problem set: 1 solved, 58 unsolved in 1726 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 80/80 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 58/59 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3396ms problems are : Problem set: 1 solved, 58 unsolved
Search for dead transitions found 1 dead transitions in 3397ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 80/124 places, 72/136 transitions.
Applied a total of 0 rules in 6 ms. Remains 80 /80 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2026-06-16 20:50:50] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 3625 ms. Remains : 80/124 places, 72/136 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 39 ms :[(NOT p0)]
Running random walk in product with property : LastZero-PT-N14-LTLCardinality-10
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 0 ms.
FORMULA LastZero-PT-N14-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-PT-N14-LTLCardinality-10 finished in 3695 ms.
All properties solved by simple procedures.
Total runtime 100361 ms.

BK_STOP 1781643050984

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LastZero-PT-N14"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is LastZero-PT-N14, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r354-tall-178024402800107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LastZero-PT-N14.tgz
mv LastZero-PT-N14 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;