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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.0K May 27 10:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 27 10:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 27 10:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 27 10:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 16 12:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 19K Jun 16 12:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 11K May 27 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K May 27 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 27 10:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K 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 787K 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-N12-LTLFireability-00
FORMULA_NAME LastZero-PT-N12-LTLFireability-01
FORMULA_NAME LastZero-PT-N12-LTLFireability-02
FORMULA_NAME LastZero-PT-N12-LTLFireability-03
FORMULA_NAME LastZero-PT-N12-LTLFireability-04
FORMULA_NAME LastZero-PT-N12-LTLFireability-05
FORMULA_NAME LastZero-PT-N12-LTLFireability-06
FORMULA_NAME LastZero-PT-N12-LTLFireability-07
FORMULA_NAME LastZero-PT-N12-LTLFireability-08
FORMULA_NAME LastZero-PT-N12-LTLFireability-09
FORMULA_NAME LastZero-PT-N12-LTLFireability-10
FORMULA_NAME LastZero-PT-N12-LTLFireability-11
FORMULA_NAME LastZero-PT-N12-LTLFireability-12
FORMULA_NAME LastZero-PT-N12-LTLFireability-13
FORMULA_NAME LastZero-PT-N12-LTLFireability-14
FORMULA_NAME LastZero-PT-N12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1781643091788

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LastZero-PT-N12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-06-16 20:51:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-16 20:51:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-16 20:51:33] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2026-06-16 20:51:33] [INFO ] Transformed 364 places.
[2026-06-16 20:51:33] [INFO ] Transformed 2485 transitions.
[2026-06-16 20:51:33] [INFO ] Parsed PT model containing 364 places and 2485 transitions and 7743 arcs in 225 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 170 places in 12 ms
Reduce places removed 170 places and 1601 transitions.
Reduce places removed 1 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA LastZero-PT-N12-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N12-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N12-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N12-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N12-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N12-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N12-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 884/884 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 884
Applied a total of 1 rules in 24 ms. Remains 192 /193 variables (removed 1) and now considering 884/884 (removed 0) transitions.
[2026-06-16 20:51:33] [INFO ] Flow matrix only has 818 transitions (discarded 66 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13851385971605192010.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9106349216981307004.kers'
[2026-06-16 20:51:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13851385971605192010.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9106349216981307004.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 818 rows 191 cols 2206 entries
Finished phase 1 with 180 SingleSign rule and 0 generalized
[2026-06-16 20:51:33] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9106349216981307004.kers
Total runtime 3 ms.
[2026-06-16 20:51:33] [INFO ] Implicit Places using invariants in 379 ms returned []
[2026-06-16 20:51:33] [INFO ] Flow matrix only has 818 transitions (discarded 66 similar events)
[2026-06-16 20:51:33] [INFO ] Invariant cache hit.
[2026-06-16 20:51:33] [INFO ] State equation strengthened by 156 read => feed constraints.
[2026-06-16 20:51:37] [INFO ] Implicit Places using invariants and state equation in 3699 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4123 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 191/193 places, 884/884 transitions.
Applied a total of 0 rules in 7 ms. Remains 191 /191 variables (removed 0) and now considering 884/884 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4167 ms. Remains : 191/193 places, 884/884 transitions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 884/884 transitions.
Applied a total of 0 rules in 7 ms. Remains 191 /191 variables (removed 0) and now considering 884/884 (removed 0) transitions.
[2026-06-16 20:51:37] [INFO ] Flow matrix only has 818 transitions (discarded 66 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17340689664433956369.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-568004534470210070.kers'
[2026-06-16 20:51:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17340689664433956369.kers, --Pflows, --basisKERS=/tmp/petrispot-output-568004534470210070.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 818 rows 190 cols 2194 entries
Finished phase 1 with 180 SingleSign rule and 0 generalized
[2026-06-16 20:51:37] [INFO ] Computed 11 invariants in 7 ms
Computed 11 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-568004534470210070.kers
Total runtime 9 ms.
[2026-06-16 20:51:37] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-06-16 20:51:37] [INFO ] Flow matrix only has 818 transitions (discarded 66 similar events)
[2026-06-16 20:51:37] [INFO ] Invariant cache hit.
[2026-06-16 20:51:37] [INFO ] State equation strengthened by 156 read => feed constraints.
[2026-06-16 20:51:39] [INFO ] Implicit Places using invariants and state equation in 1696 ms returned []
Implicit Place search using SMT with State Equation took 1819 ms to find 0 implicit places.
Running 872 sub problems to find dead transitions.
[2026-06-16 20:51:39] [INFO ] Flow matrix only has 818 transitions (discarded 66 similar events)
[2026-06-16 20:51:39] [INFO ] Invariant cache hit.
[2026-06-16 20:51:39] [INFO ] State equation strengthened by 156 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 872 unsolved
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem 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 TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 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 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 TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 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 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 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 TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
At refinement iteration 2 (OVERLAPS) 818/1008 variables, 190/201 constraints. Problems are: Problem set: 649 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1008 variables, 156/357 constraints. Problems are: Problem set: 649 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1008 variables, 0/357 constraints. Problems are: Problem set: 649 solved, 223 unsolved
Problem TDEAD645 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/1009 variables, 1/358 constraints. Problems are: Problem set: 650 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1009/1009 variables, and 358 constraints, problems are : Problem set: 650 solved, 222 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 191/191 constraints, ReadFeed: 156/156 constraints, PredecessorRefiner: 872/872 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 650 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 11/11 constraints. Problems are: Problem set: 650 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/11 constraints. Problems are: Problem set: 650 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 818/1008 variables, 190/201 constraints. Problems are: Problem set: 650 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1008 variables, 156/357 constraints. Problems are: Problem set: 650 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1008 variables, 222/579 constraints. Problems are: Problem set: 650 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1008 variables, 0/579 constraints. Problems are: Problem set: 650 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 1/1009 variables, 1/580 constraints. Problems are: Problem set: 650 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1009 variables, 0/580 constraints. Problems are: Problem set: 650 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1009 variables, and 580 constraints, problems are : Problem set: 650 solved, 222 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 191/191 constraints, ReadFeed: 156/156 constraints, PredecessorRefiner: 222/872 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60405ms problems are : Problem set: 650 solved, 222 unsolved
Search for dead transitions found 650 dead transitions in 60426ms
Found 650 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 650 transitions
Dead transitions reduction (with SMT) removed 650 transitions
Starting structural reductions in LTL mode, iteration 1 : 191/191 places, 234/884 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 182 transition count 225
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 182 transition count 225
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 174 transition count 217
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 174 transition count 217
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 168 transition count 205
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 168 transition count 205
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 163 transition count 200
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 163 transition count 200
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 159 transition count 192
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 159 transition count 192
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 156 transition count 189
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 156 transition count 189
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 154 transition count 185
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 154 transition count 185
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 152 transition count 183
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 152 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 151 transition count 181
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 151 transition count 181
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 150 transition count 180
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 150 transition count 180
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 149 transition count 178
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 149 transition count 178
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 148 transition count 177
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 148 transition count 177
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 147 transition count 175
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 147 transition count 175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 146 transition count 174
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 146 transition count 174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 145 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 145 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 144 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 144 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 143 transition count 169
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 143 transition count 169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 142 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 142 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 141 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 141 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 140 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 140 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 139 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 139 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 138 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 138 transition count 162
Applied a total of 106 rules in 39 ms. Remains 138 /191 variables (removed 53) and now considering 162/234 (removed 72) transitions.
[2026-06-16 20:52:39] [INFO ] Flow matrix only has 118 transitions (discarded 44 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2110201977249650934.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2833293002476116547.kers'
[2026-06-16 20:52:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2110201977249650934.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2833293002476116547.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 118 rows 136 cols 282 entries
Finished phase 1 with 113 SingleSign rule and 2 generalized
[2026-06-16 20:52:39] [INFO ] Computed 23 invariants in 1 ms
Computed 23 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2833293002476116547.kers
Total runtime 2 ms.
[2026-06-16 20:52:39] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-06-16 20:52:39] [INFO ] Flow matrix only has 118 transitions (discarded 44 similar events)
[2026-06-16 20:52:39] [INFO ] Invariant cache hit.
[2026-06-16 20:52:39] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-06-16 20:52:40] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 138/191 places, 162/884 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62609 ms. Remains : 138/191 places, 162/884 transitions.
Support contains 21 out of 138 places after structural reductions.
[2026-06-16 20:52:40] [INFO ] Flatten gal took : 43 ms
[2026-06-16 20:52:40] [INFO ] Flatten gal took : 22 ms
[2026-06-16 20:52:40] [INFO ] Input system was already deterministic with 162 transitions.
RANDOM walk for 40000 steps (1080 resets) in 1128 ms. (35 steps per ms) remains 7/11 properties
BEST_FIRST walk for 40003 steps (165 resets) in 131 ms. (303 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (164 resets) in 157 ms. (253 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (164 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (165 resets) in 98 ms. (404 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (165 resets) in 87 ms. (454 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (164 resets) in 74 ms. (533 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (168 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
[2026-06-16 20:52:40] [INFO ] Flow matrix only has 118 transitions (discarded 44 similar events)
[2026-06-16 20:52:40] [INFO ] Invariant cache hit.
[2026-06-16 20:52:40] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 53/67 variables, 9/9 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 4/13 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 62/129 variables, 67/80 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 15/95 constraints. Problems are: Problem set: 6 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/95 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/133 variables, 2/97 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 2/99 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/99 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/137 variables, 2/101 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 1/102 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/137 variables, 0/102 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/141 variables, 2/104 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/141 variables, 1/105 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/141 variables, 0/105 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/144 variables, 2/107 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/144 variables, 0/107 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/146 variables, 1/108 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/146 variables, 0/108 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/148 variables, 1/109 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/148 variables, 0/109 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/150 variables, 1/110 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/150 variables, 0/110 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 29/179 variables, 24/134 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/179 variables, 0/134 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 71/250 variables, 54/188 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/250 variables, 8/196 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/250 variables, 10/206 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/250 variables, 0/206 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 4/254 variables, 4/210 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/254 variables, 4/214 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/254 variables, 0/214 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 2/256 variables, 2/216 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/256 variables, 2/218 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/256 variables, 0/218 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 0/256 variables, 0/218 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 218 constraints, problems are : Problem set: 6 solved, 1 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 138/138 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/17 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/33 variables, 17/19 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/20 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/20 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/37 variables, 2/22 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/22 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/41 variables, 2/24 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 0/24 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/45 variables, 2/26 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/45 variables, 0/26 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/48 variables, 2/28 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/48 variables, 0/28 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/50 variables, 1/29 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/50 variables, 0/29 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/52 variables, 1/30 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/52 variables, 0/30 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/54 variables, 1/31 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/54 variables, 0/31 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 52/106 variables, 23/54 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/106 variables, 0/54 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 140/246 variables, 100/154 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/246 variables, 11/165 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/246 variables, 29/194 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/246 variables, 1/195 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/246 variables, 1/196 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/246 variables, 0/196 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 8/254 variables, 8/204 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/254 variables, 8/212 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/254 variables, 3/215 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/254 variables, 0/215 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 2/256 variables, 2/217 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/256 variables, 2/219 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/256 variables, 0/219 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/256 variables, 0/219 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 219 constraints, problems are : Problem set: 6 solved, 1 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 138/138 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/7 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 579ms problems are : Problem set: 6 solved, 1 unsolved
Finished Parikh walk after 61 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 8 ms.
Successfully simplified 6 atomic propositions for a total of 9 simplifications.
FORMULA LastZero-PT-N12-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N12-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N12-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N12-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N12-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 138 stabilizing places and 162 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 138 transition count 162
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(!p0))&&F(p0)))'
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 162/162 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 131 transition count 153
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 131 transition count 153
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 124 transition count 143
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 124 transition count 143
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 117 transition count 132
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 117 transition count 132
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 110 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 110 transition count 122
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 103 transition count 111
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 103 transition count 111
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 76 place count 97 transition count 103
Iterating global reduction 0 with 6 rules applied. Total rules applied 82 place count 97 transition count 103
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 88 place count 91 transition count 93
Iterating global reduction 0 with 6 rules applied. Total rules applied 94 place count 91 transition count 93
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 100 place count 85 transition count 85
Iterating global reduction 0 with 6 rules applied. Total rules applied 106 place count 85 transition count 85
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 111 place count 80 transition count 77
Iterating global reduction 0 with 5 rules applied. Total rules applied 116 place count 80 transition count 77
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 121 place count 75 transition count 70
Iterating global reduction 0 with 5 rules applied. Total rules applied 126 place count 75 transition count 70
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 130 place count 71 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 134 place count 71 transition count 64
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 137 place count 68 transition count 60
Iterating global reduction 0 with 3 rules applied. Total rules applied 140 place count 68 transition count 60
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 142 place count 66 transition count 57
Iterating global reduction 0 with 2 rules applied. Total rules applied 144 place count 66 transition count 57
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 146 place count 64 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 148 place count 64 transition count 54
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 150 place count 62 transition count 51
Iterating global reduction 0 with 2 rules applied. Total rules applied 152 place count 62 transition count 51
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 154 place count 60 transition count 48
Iterating global reduction 0 with 2 rules applied. Total rules applied 156 place count 60 transition count 48
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 157 place count 59 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 158 place count 59 transition count 47
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 160 place count 58 transition count 46
Applied a total of 160 rules in 62 ms. Remains 58 /138 variables (removed 80) and now considering 46/162 (removed 116) transitions.
[2026-06-16 20:52:41] [INFO ] Flow matrix only has 35 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4842857035402928149.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11379631581579805619.kers'
[2026-06-16 20:52:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4842857035402928149.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11379631581579805619.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 35 rows 46 cols 68 entries
Finished phase 1 with 24 SingleSign rule and 11 generalized
[2026-06-16 20:52:41] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11379631581579805619.kers
Total runtime 0 ms.
[2026-06-16 20:52:42] [INFO ] Implicit Places using invariants in 571 ms returned []
[2026-06-16 20:52:42] [INFO ] Flow matrix only has 35 transitions (discarded 11 similar events)
[2026-06-16 20:52:42] [INFO ] Invariant cache hit.
[2026-06-16 20:52:42] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-06-16 20:52:42] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
[2026-06-16 20:52:42] [INFO ] Redundant transitions in 1 ms returned []
Running 34 sub problems to find dead transitions.
[2026-06-16 20:52:42] [INFO ] Flow matrix only has 35 transitions (discarded 11 similar events)
[2026-06-16 20:52:42] [INFO ] Invariant cache hit.
[2026-06-16 20:52:42] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 35/93 variables, 58/81 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 0/93 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 93 constraints, problems are : Problem set: 0 solved, 34 unsolved in 569 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 58/58 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 35/93 variables, 58/81 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 34/127 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 0/93 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 127 constraints, problems are : Problem set: 0 solved, 34 unsolved in 588 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 58/58 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1160ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 1160ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/138 places, 46/162 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1870 ms. Remains : 58/138 places, 46/162 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(!p0))&&F(p0)))'
Stuttering acceptance computed with spot in 253 ms :[p0, p0, true, true]
Running random walk in product with property : LastZero-PT-N12-LTLFireability-01
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 10 ms.
FORMULA LastZero-PT-N12-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-PT-N12-LTLFireability-01 finished in 2221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 162/162 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 131 transition count 154
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 131 transition count 154
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 125 transition count 145
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 125 transition count 145
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 119 transition count 136
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 119 transition count 136
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 113 transition count 127
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 113 transition count 127
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 107 transition count 118
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 107 transition count 118
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 65 place count 102 transition count 111
Iterating global reduction 0 with 5 rules applied. Total rules applied 70 place count 102 transition count 111
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 75 place count 97 transition count 103
Iterating global reduction 0 with 5 rules applied. Total rules applied 80 place count 97 transition count 103
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 92 transition count 96
Iterating global reduction 0 with 5 rules applied. Total rules applied 90 place count 92 transition count 96
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 94 place count 88 transition count 90
Iterating global reduction 0 with 4 rules applied. Total rules applied 98 place count 88 transition count 90
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 102 place count 84 transition count 84
Iterating global reduction 0 with 4 rules applied. Total rules applied 106 place count 84 transition count 84
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 110 place count 80 transition count 78
Iterating global reduction 0 with 4 rules applied. Total rules applied 114 place count 80 transition count 78
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 117 place count 77 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 120 place count 77 transition count 74
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 122 place count 75 transition count 71
Iterating global reduction 0 with 2 rules applied. Total rules applied 124 place count 75 transition count 71
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 126 place count 73 transition count 68
Iterating global reduction 0 with 2 rules applied. Total rules applied 128 place count 73 transition count 68
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 130 place count 71 transition count 65
Iterating global reduction 0 with 2 rules applied. Total rules applied 132 place count 71 transition count 65
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 134 place count 69 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 136 place count 69 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 137 place count 68 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 138 place count 68 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 140 place count 67 transition count 60
Applied a total of 140 rules in 38 ms. Remains 67 /138 variables (removed 71) and now considering 60/162 (removed 102) transitions.
[2026-06-16 20:52:43] [INFO ] Flow matrix only has 44 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-13013426018250603695.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5072717108637893435.kers'
[2026-06-16 20:52:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13013426018250603695.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5072717108637893435.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 44 rows 59 cols 95 entries
Finished phase 1 with 39 SingleSign rule and 5 generalized
[2026-06-16 20:52:43] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5072717108637893435.kers
Total runtime 0 ms.
[2026-06-16 20:52:43] [INFO ] Implicit Places using invariants in 50 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/138 places, 60/162 transitions.
Applied a total of 0 rules in 6 ms. Remains 66 /66 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 95 ms. Remains : 66/138 places, 60/162 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LastZero-PT-N12-LTLFireability-04
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 1 ms.
FORMULA LastZero-PT-N12-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-PT-N12-LTLFireability-04 finished in 189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 162/162 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 131 transition count 153
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 131 transition count 153
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 124 transition count 143
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 124 transition count 143
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 117 transition count 132
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 117 transition count 132
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 110 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 110 transition count 122
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 103 transition count 111
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 103 transition count 111
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 76 place count 97 transition count 103
Iterating global reduction 0 with 6 rules applied. Total rules applied 82 place count 97 transition count 103
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 88 place count 91 transition count 93
Iterating global reduction 0 with 6 rules applied. Total rules applied 94 place count 91 transition count 93
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 100 place count 85 transition count 85
Iterating global reduction 0 with 6 rules applied. Total rules applied 106 place count 85 transition count 85
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 111 place count 80 transition count 77
Iterating global reduction 0 with 5 rules applied. Total rules applied 116 place count 80 transition count 77
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 120 place count 76 transition count 72
Iterating global reduction 0 with 4 rules applied. Total rules applied 124 place count 76 transition count 72
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 127 place count 73 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 130 place count 73 transition count 67
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 132 place count 71 transition count 65
Iterating global reduction 0 with 2 rules applied. Total rules applied 134 place count 71 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 135 place count 70 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 136 place count 70 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 137 place count 69 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 138 place count 69 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 139 place count 68 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 140 place count 68 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 141 place count 67 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 142 place count 67 transition count 59
Applied a total of 142 rules in 17 ms. Remains 67 /138 variables (removed 71) and now considering 59/162 (removed 103) transitions.
[2026-06-16 20:52:44] [INFO ] Flow matrix only has 44 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17164687744735295232.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12761673763087057078.kers'
[2026-06-16 20:52:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17164687744735295232.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12761673763087057078.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 44 rows 60 cols 95 entries
Finished phase 1 with 37 SingleSign rule and 7 generalized
[2026-06-16 20:52:44] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12761673763087057078.kers
Total runtime 0 ms.
[2026-06-16 20:52:44] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-06-16 20:52:44] [INFO ] Flow matrix only has 44 transitions (discarded 15 similar events)
[2026-06-16 20:52:44] [INFO ] Invariant cache hit.
[2026-06-16 20:52:44] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-06-16 20:52:44] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 47 sub problems to find dead transitions.
[2026-06-16 20:52:44] [INFO ] Flow matrix only has 44 transitions (discarded 15 similar events)
[2026-06-16 20:52:44] [INFO ] Invariant cache hit.
[2026-06-16 20:52:44] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 44/111 variables, 67/94 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 16/110 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/111 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 110 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1135 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 67/67 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 44/111 variables, 67/94 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 16/110 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 47/157 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/111 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 157 constraints, problems are : Problem set: 0 solved, 47 unsolved in 910 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 67/67 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2050ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 2051ms
Starting structural reductions in LTL mode, iteration 1 : 67/138 places, 59/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2190 ms. Remains : 67/138 places, 59/162 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : LastZero-PT-N12-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LastZero-PT-N12-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-PT-N12-LTLFireability-09 finished in 2315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 162/162 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 132 transition count 154
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 132 transition count 154
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 126 transition count 145
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 126 transition count 145
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 120 transition count 136
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 120 transition count 136
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 114 transition count 127
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 114 transition count 127
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 108 transition count 118
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 108 transition count 118
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 65 place count 103 transition count 111
Iterating global reduction 0 with 5 rules applied. Total rules applied 70 place count 103 transition count 111
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 75 place count 98 transition count 103
Iterating global reduction 0 with 5 rules applied. Total rules applied 80 place count 98 transition count 103
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 93 transition count 96
Iterating global reduction 0 with 5 rules applied. Total rules applied 90 place count 93 transition count 96
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 95 place count 88 transition count 88
Iterating global reduction 0 with 5 rules applied. Total rules applied 100 place count 88 transition count 88
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 105 place count 83 transition count 81
Iterating global reduction 0 with 5 rules applied. Total rules applied 110 place count 83 transition count 81
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 114 place count 79 transition count 75
Iterating global reduction 0 with 4 rules applied. Total rules applied 118 place count 79 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 121 place count 76 transition count 71
Iterating global reduction 0 with 3 rules applied. Total rules applied 124 place count 76 transition count 71
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 126 place count 74 transition count 68
Iterating global reduction 0 with 2 rules applied. Total rules applied 128 place count 74 transition count 68
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 130 place count 72 transition count 65
Iterating global reduction 0 with 2 rules applied. Total rules applied 132 place count 72 transition count 65
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 134 place count 70 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 136 place count 70 transition count 62
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 138 place count 68 transition count 59
Iterating global reduction 0 with 2 rules applied. Total rules applied 140 place count 68 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 141 place count 67 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 142 place count 67 transition count 58
Applied a total of 142 rules in 16 ms. Remains 67 /138 variables (removed 71) and now considering 58/162 (removed 104) transitions.
[2026-06-16 20:52:46] [INFO ] Flow matrix only has 44 transitions (discarded 14 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6793214188236656510.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2118107475016529466.kers'
[2026-06-16 20:52:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6793214188236656510.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2118107475016529466.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 44 rows 59 cols 93 entries
Finished phase 1 with 36 SingleSign rule and 8 generalized
[2026-06-16 20:52:46] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2118107475016529466.kers
Total runtime 0 ms.
[2026-06-16 20:52:46] [INFO ] Implicit Places using invariants in 334 ms returned []
[2026-06-16 20:52:46] [INFO ] Flow matrix only has 44 transitions (discarded 14 similar events)
[2026-06-16 20:52:46] [INFO ] Invariant cache hit.
[2026-06-16 20:52:46] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-06-16 20:52:46] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Running 46 sub problems to find dead transitions.
[2026-06-16 20:52:46] [INFO ] Flow matrix only has 44 transitions (discarded 14 similar events)
[2026-06-16 20:52:46] [INFO ] Invariant cache hit.
[2026-06-16 20:52:46] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 44/111 variables, 67/93 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 16/109 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 0/111 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 109 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1118 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 67/67 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 44/111 variables, 67/93 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 16/109 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 46/155 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 0/111 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 155 constraints, problems are : Problem set: 0 solved, 46 unsolved in 853 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 67/67 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1982ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 1984ms
Starting structural reductions in LTL mode, iteration 1 : 67/138 places, 58/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2436 ms. Remains : 67/138 places, 58/162 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Stuttering acceptance computed with spot in 188 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : LastZero-PT-N12-LTLFireability-14
Entered a terminal (fully accepting) state of product in 16599 steps with 448 reset in 77 ms.
FORMULA LastZero-PT-N12-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-PT-N12-LTLFireability-14 finished in 2735 ms.
All properties solved by simple procedures.
Total runtime 76209 ms.

BK_STOP 1781643169122

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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