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.r018-smll-177946788100276.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 BART-PT-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946788100276
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 92M
-rw-r--r-- 1 mcc users 3.5M Mar 5 09:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 13M Mar 5 09:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7M Mar 5 09:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 8.3M Mar 5 09:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 1.9M Mar 15 07:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 4.8M Mar 15 07:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Mar 15 07:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.4M Mar 15 07:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0M Mar 5 10:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15M Mar 5 10:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9M Mar 5 09:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16M Mar 5 09:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 673K Mar 15 07:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 1.4M Mar 15 07:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 12M Mar 3 18:30 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 BART-PT-050-LTLFireability-00
FORMULA_NAME BART-PT-050-LTLFireability-01
FORMULA_NAME BART-PT-050-LTLFireability-02
FORMULA_NAME BART-PT-050-LTLFireability-03
FORMULA_NAME BART-PT-050-LTLFireability-04
FORMULA_NAME BART-PT-050-LTLFireability-05
FORMULA_NAME BART-PT-050-LTLFireability-06
FORMULA_NAME BART-PT-050-LTLFireability-07
FORMULA_NAME BART-PT-050-LTLFireability-08
FORMULA_NAME BART-PT-050-LTLFireability-09
FORMULA_NAME BART-PT-050-LTLFireability-10
FORMULA_NAME BART-PT-050-LTLFireability-11
FORMULA_NAME BART-PT-050-LTLFireability-12
FORMULA_NAME BART-PT-050-LTLFireability-13
FORMULA_NAME BART-PT-050-LTLFireability-14
FORMULA_NAME BART-PT-050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779559201790

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 18:00:04] [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-05-23 18:00:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 18:00:05] [INFO ] Load time of PNML (sax parser for PT used): 1196 ms
[2026-05-23 18:00:05] [INFO ] Transformed 6810 places.
[2026-05-23 18:00:05] [INFO ] Transformed 10100 transitions.
[2026-05-23 18:00:05] [INFO ] Found NUPN structural information;
[2026-05-23 18:00:05] [INFO ] Parsed PT model containing 6810 places and 10100 transitions and 81000 arcs in 1685 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 301 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-050-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 6600 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Applied a total of 0 rules in 92 ms. Remains 6600 /6600 variables (removed 0) and now considering 10100/10100 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-956730265137573685.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10143055332021327619.kers'
[2026-05-23 18:00:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-956730265137573685.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10143055332021327619.kers]
Culled 0 columns in 7 ms.
// Phase 1: matrix 10100 rows 6600 cols 20200 entries
Finished phase 1 with 6550 SingleSign rule and 0 generalized
[2026-05-23 18:00:07] [INFO ] Computed 50 invariants in 53 ms
Computed 50 P flows in 55 ms.
Exported basis to /tmp/petrispot-output-10143055332021327619.kers
Total runtime 64 ms.
[2026-05-23 18:00:11] [INFO ] Implicit Places using invariants in 4024 ms returned []
Implicit Place search using SMT only with invariants took 4090 ms to find 0 implicit places.
Running 8300 sub problems to find dead transitions.
[2026-05-23 18:00:12] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/6550 variables, 6550/6550 constraints. Problems are: Problem set: 0 solved, 8300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6550/16700 variables, and 6550 constraints, problems are : Problem set: 0 solved, 8300 unsolved in 30425 ms.
Refiners :[Domain max(s): 6550/6600 constraints, Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/6600 constraints, PredecessorRefiner: 8300/8300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6550 variables, 6550/6550 constraints. Problems are: Problem set: 0 solved, 8300 unsolved
(s1755 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1321 1)
(s1322 1)
(s1323 1)
(s1324 1)
(s1325 1)
(s1326 1)
(s1327 1)
(s1328 1)
(s1329 1)
(s1330 1)
(s1331 1)
(s1332 1)
(s1333 1)
(s1334 1)
(s1335 1)
(s1336 1)
(s1337 1)
(s1338 1)
(s1339 1)
(s1340 1)
(s1341 1)
(s1342 1)
(s1343 1)
(s1344 1)
(s1345 1)
(s1346 1)
(s1347 1)
(s1348 1)
(s1349 1)
(s1350 1)
(s1351 1)
(s1352 1)
(s1353 1)
(s1354 1)
(s1355 1)
(s1356 1)
(s1357 1)
(s1358 1)
(s1359 1)
(s1360 1)
(s1361 1)
(s1362 1)
(s1363 1)
(s1364 1)
(s1365 1)
(s1366 1)
(s1367 1)
(s1368 1)
(s1369 1)
(s1370 1)
(s1371 1)
(s1372 1)
(s1373 1)
(s1374 1)
(s1375 1)
(s1376 1)
(s1377 1)
(s1378 1)
(s1379 1)
(s1380 1)
(s1381 1)
(s1382 1)
(s1383 1)
(s1384 1)
(s1385 1)
(s1386 1)
(s1387 1)
(s1388 1)
(s1389 1)
(s1390 1)
(s1391 1)
(s1392 1)
(s1393 1)
(s1394 1)
(s1395 1)
(s1396 1)
(s1397 1)
(s1398 1)
(s1399 1)
(s1400 1)
(s1401 1)
(s1402 1)
(s1403 1)
(s1404 1)
(s1405 1)
(s1406 1)
(s1407 1)
(s1408 1)
(s1409 1)
(s1410 1)
(s1411 1)
(s1412 1)
(s1413 1)
(s1414 1)
(s1415 1)
(s1416 1)
(s1417 1)
(s1418 1)
(s1419 1)
(s1420 1)
(s1421 1)
(s1422 1)
(s1423 1)
(s1424 1)
(s1425 1)
(s1426 1)
(s1427 1)
(s1428 1)
(s1429 1)
(s1430 1)
(s1431 1)
(s1432 1)
(s1433 1)
(s1434 1)
(s1435 1)
(s1436 1)
(s1437 1)
(s1438 1)
(s1439 1)
(s1440 1)
(s1441 1)
(s1442 1)
(s1443 1)
(s1444 1)
(s1445 1)
(s1446 1)
(s1447 1)
(s1448 1)
(s1449 1)
(s1450 1)
(s1451 1)
(s1452 1)
(s1453 1)
(s1454 1)
(s1455 1)
(s1456 1)
(s1457 1)
(s1458 1)
(s1459 1)
(s1460 1)
(s1461 1)
(s1462 1)
(s1463 1)
(s1464 1)
(s1465 1)
(s1466 1)
(s1467 1)
(s1468 1)
(s1469 1)
(s1470 1)
(s1471 1)
(s1472 1)
(s1473 1)
(s1474 1)
(s1475 1)
(s1476 1)
(s1477 1)
(s1478 1)
(s1479 1)
(s1480 1)
(s1481 1)
(s1482 1)
(s1483 1)
(s1484 1)
(s1485 1)
(s1486 1)
(s1487 1)
(s1488 1)
(s1489 1)
(s1490 1)
(s1491 1)
(s1492 1)
(s1493 1)
(s1494 1)
(s1495 1)
(s1496 1)
(s1497 1)
(s1498 1)
(s1499 1)
(s1500 1)
(s1501 1)
(s1502 1)
(s1503 1)
(s1504 1)
(s1505 1)
(s1506 1)
(s1507 1)
(s1508 1)
(s1509 1)
(s1510 1)
(s1511 1)
(s1512 1)
(s1513 1)
(s1514 1)
(s1515 1)
(s1516 1)
(s1517 1)
(s1518 1)
(s1519 1)
(s1520 1)
(s1521 1)
(s1522 1)
(s1523 1)
(s1524 1)
(s1525 1)
(s1526 1)
(s1527 1)
(s1528 1)
(s1529 1)
(s1530 1)
(s1531 1)
(s1532 1)
(s1533 1)
(s1534 1)
(s1535 1)
(s1536 1)
(s1537 1)
(s1538 1)
(s1539 1)
(s1540 1)
(s1541 1)
(s1542 1)
(s1543 1)
(s1544 1)
(s1545 1)
(s1546 1)
(s1547 1)
(s1548 1)
(s1549 1)
(s1550 1)
(s1551 1)
(s1552 1)
(s1553 1)
(s1554 1)
(s1555 1)
(s1556 1)
(s1557 1)
(s1558 1)
(s1559 1)
(s1560 1)
(s1561 1)
(s1562 1)
(s1563 1)
(s1564 1)
(s1565 1)
(s1566 1)
(s1567 1)
(s1568 1)
(s1569 1)
(s1570 1)
(s1571 1)
(s1572 1)
(s1573 1)
(s1574 1)
(s1575 1)
(s1576 1)
(s1577 1)
(s1578 1)
(s1579 1)
(s1580 1)
(s1581 1)
(s1582 1)
(s1583 1)
(s1584 1)
(s1585 1)
(s1586 1)
(s1587 1)
(s1588 1)
(s1589 1)
(s1590 1)
(s1591 1)
(s1592 1)
(s1593 1)
(s1594 1)
(s1595 1)
(s1596 1)
(s1597 1)
(s1598 1)
(s1599 1)
(s1600 1)
(s1601 1)
(s1602 1)
(s1603 1)
(s1604 1)
(s1605 1)
(s1606 1)
(s1607 1)
(s1608 1)
(s1609 1)
(s1610 1)
(s1611 1)
(s1612 1)
(s1613 1)
(s1614 1)
(s1615 1)
(s1616 1)
(s1617 1)
(s1618 1)
(s1619 1)
(s1620 1)
(s1621 1)
(s1622 1)
(s1623 1)
(s1624 1)
(s1625 1)
(s1626 1)
(s1627 1)
(s1628 1)
(s1629 1)
(s1630 1)
(s1631 1)
(s1632 1)
(s1633 1)
(s1634 1)
(s1635 1)
(s1636 1)
(s1637 1)
(s1638 1)
(s1639 1)
(s1640 1)
(s1641 1)
(s1642 1)
(s1643 1)
(s1644 1)
(s1645 1)
(s1646 1)
(s1647 1)
(s1648 1)
(s1649 1)
(s1650 1)
(s1651 1)
(s1652 1)
(s1653 1)
(s1654 1)
(s1655 1)
(s1656 1)
(s1657 1)
(s1658 1)
(s1659 1)
(s1660 1)
(s1661 1)
(s1662 1)
(s1663 1)
(s1664 1)
(s1665 1)
(s1666 1)
(s1667 1)
(s1668 1)
(s1669 1)
(s1670 1)
(s1671 1)
(s1672 1)
(s1673 1)
(s1674 1)
(s1675 1)
(s1676 1)
(s1677 1)
(s1678 1)
(s1679 1)
(s1680 1)
(s1681 1)
(s1682 1)
(s1683 1)
(s1684 1)
(s1685 1)
(s1686 1)
(s1687 1)
(s1688 1)
(s1689 1)
(s1690 1)
(s1691 1)
(s1692 1)
(s1693 1)
(s1694 1)
(s1695 1)
(s1696 1)
(s1697 1)
(s1698 1)
(s1699 1)
(s1700 1)
(s1701 1)
(s1702 1)
(s1703 1)
(s1704 1)
(s1705 1)
(s1706 1)
(s1707 1)
(s1708 1)
(s1709 1)
(s1710 1)
(s1711 1)
(s1712 1)
(s1713 1)
(s1714 1)
(s1715 1)
(s1716 1)
(s1717 1)
(s1718 1)
(s1719 1)
(s1720 1)
(s1721 1)
(s1722 1)
(s1723 1)
(s1724 1)
(s1725 1)
(s1726 1)
(s1727 1)
(s1728 1)
(s1729 1)
(s1730 1)
(s1731 1)
(s1732 1)
(s1733 1)
(s1734 1)
(s1735 1)
(s1736 1)
(s1737 1)
(s1738 1)
(s1739 1)
(s1740 1)
(s1741 1)
(s1742 1)
(s1743 1)
(s1744 1)
(s1745 1)
(s1746 1)
(s1747 1)
(s1748 1)
(s1749 1)
(s1750 1)
(s1751 1)
(s1752 1)
(s1753 1)
(s1754 1)
(s1755 1timeout
)
(s1756 1)
(s1757 1)
(s1758 1)
(s1759 1)
(s1760 1)
(s1761 1)
(s1762 1)
(s1763 1)
(s1764 1)
(s1765 1)
(s1766 1)
(s1767 1)
(s1768 1)
(s1769 1)
(s1770 1)
(s1771 1)
(s1772 1)
(s1773 1)
(s1774 1)
(s1775 1)
(s1776 1)
(s1777 1)
(s1778 1)
(s1779 1)
(s1780 1)
(s1781 1)
(s1782 1)
(s1783 1)
(s1784 1)
(s1785 1)
(s1786 1)
(s1787 1)
(s1788 1)
(s1789 1)
(s1790 1)
(s1791 1)
(s1792 1)
(s1793 1)
(s1794 1)
(s1795 1)
(s1796 1)
(s1797 1)
(s1798 1)
(s1799 1)
(s1800 1)
(s1801 1)
(s1802 1)
(s1803 1)
(s1804 1)
(s1805 1)
(s1806 1)
(s1807 1)
(s1808 1)
(s1809 1)
(s1810 1)
(s1811 1)
(s1812 1)
(s1813 1)
(s1814 1)
(s1815 1)
(s1816 1)
(s1817 1)
(s1818 1)
(s1819 1)
(s1820 1)
(s1821 1)
(s1822 1)
(s1823 1)
(s1824 1)
(s1825 1)
(s1826 1)
(s1827 1)
(s1828 1)
(s1829 1)
(s1830 1)
(s1831 1)
(s1832 1)
(s1833 1)
(s1834 1)
(s1835 1)
(s1836 1)
(s1837 1)
(s1838 1)
(s1839 1)
(s1840 1)
(s1841 1)
(s1842 1)
(s1843 1)
(s1844 1)
(s1845 1)
(s1846 1)
(s1847 1)
(s1848 1)
(s1849 1)
(s1850 1)
(s1851 1)
(s1852 1)
(s1853 1)
(s1854 1)
(s1855 1)
(s1856 1)
(s1857 1)
(s1858 1)
(s1859 1)
(s1860 1)
(s1861 1)
(s1862 1)
(s1863 1)
(s1864 1)
(s1865 1)
(s1866 1)
(s1867 1)
(s1868 1)
(s1869 1)
(s1870 1)
(s1871 1)
(s1872 1)
(s1873 1)
(s1874 1)
(s1875 1)
(s1876 1)
(s1877 1)
(s1878 1)
(s1879 1)
(s1880 1)
(s1881 1)
(s1882 1)
(s1883 1)
(s1884 1)
(s1885 1)
(s1886 1)
(s1887 1)
(s1888 1)
(s1889 1)
(s1890 1)
(s1891 1)
(s1892 1)
(s1893 1)
(s1894 1)
(s1895 1)
(s1896 1)
(s1897 1)
(s1898 1)
(s1899 1)
(s1900 1)
(s1901 1)
(s1902 1)
(s1903 1)
(s1904 1)
(s1905 1)
(s1906 1)
(s1907 1)
(s1908 1)
(s1909 1)
(s1910 1)
(s1911 1)
(s1912 1)
(s1913 1)
(s1914 1)
(s1915 1)
(s1916 1)
(s1917 1)
(s1918 1)
(s1919 1)
(s1920 1)
(s1921 1)
(s1922 1)
(s1923 1)
(s1924 1)
(s1925 1)
(s1926 1)
(s1927 1)
(s1928 1)
(s1929 1)
(s1930 1)
(s1931 1)
(s1932 1)
(s1933 1)
(s1934 1)
(s1935 1)
(s1936 1)
(s1937 1)
(s1938 1)
(s1939 1)
(s1940 1)
(s1941 1)
(s1942 1)
(s1943 1)
(s1944 1)
(s1945 1)
(s1946 1)
(s1947 1)
(s1948 1)
(s1949 1)
(s1950 1)
(s1951 1)
(s1952 1)
(s1953 1)
(s1954 1)
(s1955 1)
(s1956 1)
(s1957 1)
(s1958 1)
(s1959 1)
(s1960 1)
(s1961 1)
(s1962 1)
(s1963 1)
(s1964 1)
(s1965 1)
(s1966 1)
(s1967 1)
(s1968 1)
(s1969 1)
(s1970 1)
(s1971 1)
(s1972 1)
(s1973 1)
(s1974 1)
(s1975 1)
(s1976 1)
(s1977 1)
(s1978 1)
(s1979 1)
(s1980 1)
(s1981 1)
(s1982 1)
(s1983 1)
(s1984 1)
(s1985 1)
(s1986 1)
(s1987 1)
(s1988 1)
(s1989 1)
(s1990 1)
(s1991 1)
(s1992 1)
(s1993 1)
(s1994 1)
(s1995 1)
(s1996 1)
(s1997 1)
(s1998 1)
(s1999 1)
(s2000 1)
(s2001 1)
(s2002 1)
(s2003 1)
(s2004 1)
(s2005 1)
(s2006 1)
(s2007 1)
(s2008 1)
(s2009 1)
(s2010 1)
(s2011 1)
(s2012 1)
(s2013 1)
(s2014 1)
(s2015 1)
(s2016 1)
(s2017 1)
(s2018 1)
(s2019 1)
(s2020 1)
(s2021 1)
(s2022 1)
(s2023 1)
(s2024 1)
(s2025 1)
(s2026 1)
(s2027 1)
(s2028 1)
(s2029 1)
(s2030 1)
(s2031 1)
(s2032 1)
(s2033 1)
(s2034 1)
(s2035 1)
(s2036 1)
(s2037 1)
(s2038 1)
(s2039 1)
(s2040 1)
(s2041 1)
(s2042 1)
(s2043 1)
(s2044 1)
(s2045 1)
(s2046 1)
(s2047 1)
(s2048 1)
(s2049 1)
(s2050 1)
(s2051 1)
(s2052 1)
(s2053 1)
(s2054 1)
(s2055 1)
(s2056 1)
(s2057 1)
(s2058 1)
(s2059 1)
(s2060 1)
(s2061 1)
(s2062 1)
(s2063 1)
(s2064 1)
(s2065 1)
(s2066 1)
(s2067 1)
(s2068 1)
(s2069 1)
(s2070 1)
(s2071 1)
(s2072 1)
(s2073 1)
(s2074 1)
(s2075 1)
(s2076 1)
(s2077 1)
(s2078 1)
(s2079 1)
(s2080 1)
(s2081 1)
(s2082 1)
(s2083 1)
(s2084 1)
(s2085 1)
(s2086 1)
(s2087 1)
(s2088 1)
(s2089 1)
(s2090 1)
(s2091 1)
(s2092 1)
(s2093 1)
(s2094 1)
(s2095 1)
(s2096 1)
(s2097 1)
(s2098 1)
(s2099 1)
(s2100 1)
(s2101 1)
(s2102 1)
(s2103 1)
(s2104 1)
(s2105 1)
(s2106 1)
(s2107 1)
(s2108 1)
(s2109 1)
(s2110 1)
(s2111 1)
(s2112 1)
(s2113 1)
(s2114 1)
(s2115 1)
(s2116 1)
(s2117 1)
(s2118 1)
(s2119 1)
(s2120 1)
(s2121 1)
(s2122 1)
(s2123 1)
(s2124 1)
(s2125 1)
(s2126 1)
(s2127 1)
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6550/16700 variables, and 6550 constraints, problems are : Problem set: 0 solved, 8300 unsolved in 30239 ms.
Refiners :[Domain max(s): 6550/6600 constraints, Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/6600 constraints, PredecessorRefiner: 0/8300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68569ms problems are : Problem set: 0 solved, 8300 unsolved
Search for dead transitions found 0 dead transitions in 68717ms
Finished structural reductions in LTL mode , in 1 iterations and 73068 ms. Remains : 6600/6600 places, 10100/10100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Applied a total of 0 rules in 69 ms. Remains 6600 /6600 variables (removed 0) and now considering 10100/10100 (removed 0) transitions.
[2026-05-23 18:01:20] [INFO ] Invariant cache hit.
[2026-05-23 18:01:23] [INFO ] Implicit Places using invariants in 2534 ms returned []
Implicit Place search using SMT only with invariants took 2536 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2613 ms. Remains : 6600/6600 places, 10100/10100 transitions.
Support contains 6600 out of 6600 places after structural reductions.
[2026-05-23 18:01:24] [INFO ] Flatten gal took : 556 ms
[2026-05-23 18:01:25] [INFO ] Flatten gal took : 355 ms
[2026-05-23 18:01:26] [INFO ] Input system was already deterministic with 10100 transitions.
Reduction of identical properties reduced properties to check from 25 to 22
RANDOM walk for 40000 steps (8 resets) in 2638 ms. (15 steps per ms) remains 1/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 1/1 properties
[2026-05-23 18:01:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 262/264 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 262/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 404/668 variables, 264/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/668 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 668/16700 variables, and 530 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1240 ms.
Refiners :[Domain max(s): 264/6600 constraints, Positive P Invariants (semi-flows): 2/50 constraints, State Equation: 264/6600 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 262/264 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 262/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 404/668 variables, 264/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/668 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 668/16700 variables, and 531 constraints, problems are : Problem set: 0 solved, 1 unsolved in 770 ms.
Refiners :[Domain max(s): 264/6600 constraints, Positive P Invariants (semi-flows): 2/50 constraints, State Equation: 264/6600 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2100ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 20 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(p1))))'
Support contains 3450 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 150 place count 6450 transition count 9950
Iterating global reduction 0 with 150 rules applied. Total rules applied 300 place count 6450 transition count 9950
Applied a total of 300 rules in 1464 ms. Remains 6450 /6600 variables (removed 150) and now considering 9950/10100 (removed 150) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-441404166595950890.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18141603599126405773.kers'
[2026-05-23 18:01:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-441404166595950890.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18141603599126405773.kers]
Culled 0 columns in 11 ms.
// Phase 1: matrix 9950 rows 6450 cols 19900 entries
Finished phase 1 with 6400 SingleSign rule and 0 generalized
[2026-05-23 18:01:31] [INFO ] Computed 50 invariants in 84 ms
Computed 50 P flows in 85 ms.
Exported basis to /tmp/petrispot-output-18141603599126405773.kers
Total runtime 97 ms.
[2026-05-23 18:01:32] [INFO ] Implicit Places using invariants in 1601 ms returned []
[2026-05-23 18:01:32] [INFO ] Invariant cache hit.
[2026-05-23 18:01:40] [INFO ] Implicit Places using invariants and state equation in 7490 ms returned []
Implicit Place search using SMT with State Equation took 9094 ms to find 0 implicit places.
Running 8150 sub problems to find dead transitions.
[2026-05-23 18:01:40] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6400/16400 variables, and 0 constraints, problems are : Problem set: 0 solved, 8150 unsolved in 30153 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/6450 constraints, PredecessorRefiner: 8150/8150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8150 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6400/16400 variables, and 0 constraints, problems are : Problem set: 0 solved, 8150 unsolved in 30244 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/6450 constraints, PredecessorRefiner: 0/8150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67994ms problems are : Problem set: 0 solved, 8150 unsolved
Search for dead transitions found 0 dead transitions in 68023ms
Starting structural reductions in LTL mode, iteration 1 : 6450/6600 places, 9950/10100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78609 ms. Remains : 6450/6600 places, 9950/10100 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(p1))))'
Stuttering acceptance computed with spot in 829 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : BART-PT-050-LTLFireability-00
Product exploration timeout after 80450 steps with 26812 reset in 10001 ms.
Product exploration timeout after 91600 steps with 30532 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 4 factoid took 118 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 1493 ms. (26 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6166 ms. (6 steps per ms) remains 1/1 properties
[2026-05-23 18:03:20] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3450 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3000/6450 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6450 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5050ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3450 out of 6450 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6450/6450 places, 9950/9950 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 6450 transition count 9800
Reduce places removed 150 places and 0 transitions.
Performed 1200 Post agglomeration using F-continuation condition.Transition count delta: 1200
Iterating post reduction 1 with 1350 rules applied. Total rules applied 1500 place count 6300 transition count 8600
Reduce places removed 1200 places and 0 transitions.
Iterating post reduction 2 with 1200 rules applied. Total rules applied 2700 place count 5100 transition count 8600
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 200
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 3100 place count 4900 transition count 8400
Drop transitions (Redundant composition of simpler transitions.) removed 1750 transitions
Redundant transition composition rules discarded 1750 transitions
Iterating global reduction 3 with 1750 rules applied. Total rules applied 4850 place count 4900 transition count 6650
Applied a total of 4850 rules in 1363 ms. Remains 4900 /6450 variables (removed 1550) and now considering 6650/9950 (removed 3300) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1365 ms. Remains : 4900/6450 places, 6650/9950 transitions.
RANDOM walk for 40000 steps (8 resets) in 709 ms. (56 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4624 ms. (8 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 40100 steps, run visited all 1 properties in 260 ms. (steps per millisecond=154 )
Probabilistic random walk after 40100 steps, saw 38992 distinct states, run finished after 265 ms. (steps per millisecond=151 ) properties seen :1
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
[2026-05-23 18:03:43] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Knowledge-based reduction took 49344 ms.
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 3450 out of 6450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6450/6450 places, 9950/9950 transitions.
Applied a total of 0 rules in 703 ms. Remains 6450 /6450 variables (removed 0) and now considering 9950/9950 (removed 0) transitions.
[2026-05-23 18:03:59] [INFO ] Invariant cache hit.
[2026-05-23 18:04:01] [INFO ] Implicit Places using invariants in 1493 ms returned []
[2026-05-23 18:04:01] [INFO ] Invariant cache hit.
[2026-05-23 18:04:08] [INFO ] Implicit Places using invariants and state equation in 7445 ms returned []
Implicit Place search using SMT with State Equation took 8940 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 9651 ms. Remains : 6450/6450 places, 9950/9950 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 1657 ms. (24 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5553 ms. (7 steps per ms) remains 1/1 properties
[2026-05-23 18:04:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3450 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3000/6450 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6450 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5043ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3450 out of 6450 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6450/6450 places, 9950/9950 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 6450 transition count 9800
Reduce places removed 150 places and 0 transitions.
Performed 1200 Post agglomeration using F-continuation condition.Transition count delta: 1200
Iterating post reduction 1 with 1350 rules applied. Total rules applied 1500 place count 6300 transition count 8600
Reduce places removed 1200 places and 0 transitions.
Iterating post reduction 2 with 1200 rules applied. Total rules applied 2700 place count 5100 transition count 8600
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 200
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 3100 place count 4900 transition count 8400
Drop transitions (Redundant composition of simpler transitions.) removed 1750 transitions
Redundant transition composition rules discarded 1750 transitions
Iterating global reduction 3 with 1750 rules applied. Total rules applied 4850 place count 4900 transition count 6650
Applied a total of 4850 rules in 1027 ms. Remains 4900 /6450 variables (removed 1550) and now considering 6650/9950 (removed 3300) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1028 ms. Remains : 4900/6450 places, 6650/9950 transitions.
RANDOM walk for 40000 steps (8 resets) in 696 ms. (57 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5653 ms. (7 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 40100 steps, run visited all 1 properties in 251 ms. (steps per millisecond=159 )
Probabilistic random walk after 40100 steps, saw 38992 distinct states, run finished after 252 ms. (steps per millisecond=159 ) properties seen :1
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
[2026-05-23 18:04:43] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Knowledge-based reduction took 49675 ms.
Stuttering acceptance computed with spot in 296 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 284 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration timeout after 89100 steps with 29698 reset in 10001 ms.
Product exploration timeout after 96080 steps with 32023 reset in 10002 ms.
Spot run failed in 122 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin10478707930775929863
[2026-05-23 18:05:19] [INFO ] Built C files in 213ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10478707930775929863
Running compilation step : cd /tmp/ltsmin10478707930775929863;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10478707930775929863;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10478707930775929863;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3450 out of 6450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6450/6450 places, 9950/9950 transitions.
Applied a total of 0 rules in 753 ms. Remains 6450 /6450 variables (removed 0) and now considering 9950/9950 (removed 0) transitions.
[2026-05-23 18:05:23] [INFO ] Invariant cache hit.
[2026-05-23 18:05:24] [INFO ] Implicit Places using invariants in 1721 ms returned []
[2026-05-23 18:05:24] [INFO ] Invariant cache hit.
[2026-05-23 18:05:32] [INFO ] Implicit Places using invariants and state equation in 7528 ms returned []
Implicit Place search using SMT with State Equation took 9260 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 10018 ms. Remains : 6450/6450 places, 9950/9950 transitions.
Built C files in :
/tmp/ltsmin16187023696181068033
[2026-05-23 18:05:32] [INFO ] Built C files in 163ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16187023696181068033
Running compilation step : cd /tmp/ltsmin16187023696181068033;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16187023696181068033;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16187023696181068033;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 18:05:36] [INFO ] Flatten gal took : 196 ms
[2026-05-23 18:05:36] [INFO ] Flatten gal took : 228 ms
[2026-05-23 18:05:36] [INFO ] Time to serialize gal into /tmp/LTL15657099781070778606.gal : 77 ms
[2026-05-23 18:05:36] [INFO ] Time to serialize properties into /tmp/LTL15225133529314142906.prop : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15657099781070778606.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2247632914043176941.hoa' '-atoms' '/tmp/LTL15225133529314142906.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15225133529314142906.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2247632914043176941.hoa
Detected timeout of ITS tools.
[2026-05-23 18:05:52] [INFO ] Flatten gal took : 247 ms
[2026-05-23 18:05:52] [INFO ] Flatten gal took : 260 ms
[2026-05-23 18:05:52] [INFO ] Time to serialize gal into /tmp/LTL6146592910126251585.gal : 56 ms
[2026-05-23 18:05:52] [INFO ] Time to serialize properties into /tmp/LTL10044608846441774684.ltl : 19 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6146592910126251585.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10044608846441774684.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((TrainState_12_0_0==1)||(TrainState_23_0_0==1))||((TrainState_47_0_0==1)||(TrainState_33_0_0==1)))||(((TrainState_19_0_0=...91915
Formula 0 simplified : G!"(((((((TrainState_12_0_0==1)||(TrainState_23_0_0==1))||((TrainState_47_0_0==1)||(TrainState_33_0_0==1)))||(((TrainState_19_0_0==1...91906
Detected timeout of ITS tools.
[2026-05-23 18:06:07] [INFO ] Flatten gal took : 211 ms
[2026-05-23 18:06:07] [INFO ] Applying decomposition
[2026-05-23 18:06:08] [INFO ] Flatten gal took : 246 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13790907004947494327.txt' '-o' '/tmp/graph13790907004947494327.bin' '-w' '/tmp/graph13790907004947494327.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13790907004947494327.bin' '-l' '-1' '-v' '-w' '/tmp/graph13790907004947494327.weights' '-q' '0' '-e' '0.001'
[2026-05-23 18:06:08] [INFO ] Decomposing Gal with order
[2026-05-23 18:06:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 18:06:14] [INFO ] Removed a total of 723 redundant transitions.
[2026-05-23 18:06:14] [INFO ] Flatten gal took : 705 ms
[2026-05-23 18:06:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 70 ms.
[2026-05-23 18:06:17] [INFO ] Time to serialize gal into /tmp/LTL3775808841805586488.gal : 101 ms
[2026-05-23 18:06:17] [INFO ] Time to serialize properties into /tmp/LTL333299657621068026.ltl : 17 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3775808841805586488.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL333299657621068026.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((i43.i0.u105.TrainState_12_0_0==1)||(i26.i0.u109.TrainState_23_0_0==1))||((i32.i0.u265.TrainState_47_0_0==1)||(i16.i0.u16...133447
Formula 0 simplified : G!"(((((((i43.i0.u105.TrainState_12_0_0==1)||(i26.i0.u109.TrainState_23_0_0==1))||((i32.i0.u265.TrainState_47_0_0==1)||(i16.i0.u169....133438
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
8 unique states visited
0 strongly connected components in search stack
7 transitions explored
8 items max in DFS search stack
1186 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.2304,92568,1,0,108836,10089,38427,213800,2318,24172,282304
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BART-PT-050-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BART-PT-050-LTLFireability-00 finished in 301553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 50 out of 6600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3200 transitions
Trivial Post-agglo rules discarded 3200 transitions
Performed 3200 trivial Post agglomeration. Transition count delta: 3200
Iterating post reduction 0 with 3200 rules applied. Total rules applied 3200 place count 6600 transition count 6900
Reduce places removed 3200 places and 0 transitions.
Iterating post reduction 1 with 3200 rules applied. Total rules applied 6400 place count 3400 transition count 6900
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 6400 place count 3400 transition count 6650
Deduced a syphon composed of 250 places in 1 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 6900 place count 3150 transition count 6650
Discarding 300 places :
Symmetric choice reduction at 2 with 300 rule applications. Total rules 7200 place count 2850 transition count 6350
Iterating global reduction 2 with 300 rules applied. Total rules applied 7500 place count 2850 transition count 6350
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 2 with 50 rules applied. Total rules applied 7550 place count 2850 transition count 6300
Discarding 200 places :
Symmetric choice reduction at 3 with 200 rule applications. Total rules 7750 place count 2650 transition count 6100
Iterating global reduction 3 with 200 rules applied. Total rules applied 7950 place count 2650 transition count 6100
Discarding 150 places :
Symmetric choice reduction at 3 with 150 rule applications. Total rules 8100 place count 2500 transition count 5950
Iterating global reduction 3 with 150 rules applied. Total rules applied 8250 place count 2500 transition count 5950
Discarding 150 places :
Symmetric choice reduction at 3 with 150 rule applications. Total rules 8400 place count 2350 transition count 5800
Iterating global reduction 3 with 150 rules applied. Total rules applied 8550 place count 2350 transition count 5800
Discarding 100 places :
Symmetric choice reduction at 3 with 100 rule applications. Total rules 8650 place count 2250 transition count 5700
Iterating global reduction 3 with 100 rules applied. Total rules applied 8750 place count 2250 transition count 5700
Discarding 100 places :
Symmetric choice reduction at 3 with 100 rule applications. Total rules 8850 place count 2150 transition count 5600
Iterating global reduction 3 with 100 rules applied. Total rules applied 8950 place count 2150 transition count 5600
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 9000 place count 2100 transition count 5550
Iterating global reduction 3 with 50 rules applied. Total rules applied 9050 place count 2100 transition count 5550
Performed 350 Post agglomeration using F-continuation condition.Transition count delta: 350
Deduced a syphon composed of 350 places in 1 ms
Reduce places removed 350 places and 0 transitions.
Iterating global reduction 3 with 700 rules applied. Total rules applied 9750 place count 1750 transition count 5200
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 3 with 200 rules applied. Total rules applied 9950 place count 1750 transition count 5000
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 4 with 200 rules applied. Total rules applied 10150 place count 1650 transition count 4900
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 4 with 200 rules applied. Total rules applied 10350 place count 1650 transition count 4700
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 5 with 200 rules applied. Total rules applied 10550 place count 1550 transition count 4600
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 5 with 200 rules applied. Total rules applied 10750 place count 1550 transition count 4400
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 6 with 200 rules applied. Total rules applied 10950 place count 1450 transition count 4300
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 6 with 200 rules applied. Total rules applied 11150 place count 1450 transition count 4100
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 7 with 200 rules applied. Total rules applied 11350 place count 1350 transition count 4000
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 7 with 200 rules applied. Total rules applied 11550 place count 1350 transition count 3800
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 8 with 200 rules applied. Total rules applied 11750 place count 1250 transition count 3700
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 8 with 200 rules applied. Total rules applied 11950 place count 1250 transition count 3500
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 9 with 200 rules applied. Total rules applied 12150 place count 1150 transition count 3400
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 9 with 200 rules applied. Total rules applied 12350 place count 1150 transition count 3200
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 10 with 200 rules applied. Total rules applied 12550 place count 1050 transition count 3100
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 10 with 200 rules applied. Total rules applied 12750 place count 1050 transition count 2900
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 11 with 200 rules applied. Total rules applied 12950 place count 950 transition count 2800
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 11 with 200 rules applied. Total rules applied 13150 place count 950 transition count 2600
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 12 with 200 rules applied. Total rules applied 13350 place count 850 transition count 2500
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 12 with 200 rules applied. Total rules applied 13550 place count 850 transition count 2300
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 13 with 200 rules applied. Total rules applied 13750 place count 750 transition count 2200
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 13 with 200 rules applied. Total rules applied 13950 place count 750 transition count 2000
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 14 with 200 rules applied. Total rules applied 14150 place count 650 transition count 1900
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 14 with 200 rules applied. Total rules applied 14350 place count 650 transition count 1700
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 15 with 200 rules applied. Total rules applied 14550 place count 550 transition count 1600
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 15 with 200 rules applied. Total rules applied 14750 place count 550 transition count 1400
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 16 with 200 rules applied. Total rules applied 14950 place count 450 transition count 1300
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 16 with 200 rules applied. Total rules applied 15150 place count 450 transition count 1100
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 17 with 200 rules applied. Total rules applied 15350 place count 350 transition count 1000
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 17 with 200 rules applied. Total rules applied 15550 place count 350 transition count 800
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 18 with 200 rules applied. Total rules applied 15750 place count 250 transition count 700
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 18 with 200 rules applied. Total rules applied 15950 place count 250 transition count 500
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 19 with 200 rules applied. Total rules applied 16150 place count 150 transition count 400
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Iterating post reduction 19 with 250 rules applied. Total rules applied 16400 place count 150 transition count 150
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 20 with 100 rules applied. Total rules applied 16500 place count 100 transition count 100
Applied a total of 16500 rules in 3640 ms. Remains 100 /6600 variables (removed 6500) and now considering 100/10100 (removed 10000) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7517725111620230693.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9926100708101275484.kers'
[2026-05-23 18:06:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7517725111620230693.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9926100708101275484.kers]
Culling duplicate invariants (modulo rational): removing 50 columns.
Culled 50 columns in 0 ms.
// Phase 1: matrix 100 rows 50 cols 100 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-23 18:06:35] [INFO ] Computed 50 invariants in 0 ms
Computed 50 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9926100708101275484.kers
Total runtime 1 ms.
[2026-05-23 18:06:35] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-23 18:06:35] [INFO ] Invariant cache hit.
[2026-05-23 18:06:35] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2026-05-23 18:06:35] [INFO ] Redundant transitions in 2 ms returned []
Running 50 sub problems to find dead transitions.
[2026-05-23 18:06:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 50/100 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 100/200 variables, 100/150 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 0/200 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 150 constraints, problems are : Problem set: 0 solved, 50 unsolved in 2389 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 50/100 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 100/200 variables, 100/150 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 50/200 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 200 constraints, problems are : Problem set: 0 solved, 50 unsolved in 2164 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4558ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 4558ms
Starting structural reductions in SI_LTL mode, iteration 1 : 100/6600 places, 100/10100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8356 ms. Remains : 100/6600 places, 100/10100 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BART-PT-050-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 703 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 1 ms.
FORMULA BART-PT-050-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-050-LTLFireability-01 finished in 9287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(G(p1)))))'
Support contains 50 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 1600 places :
Symmetric choice reduction at 0 with 1600 rule applications. Total rules 1600 place count 5000 transition count 8500
Iterating global reduction 0 with 1600 rules applied. Total rules applied 3200 place count 5000 transition count 8500
Discarding 1350 places :
Symmetric choice reduction at 0 with 1350 rule applications. Total rules 4550 place count 3650 transition count 7150
Iterating global reduction 0 with 1350 rules applied. Total rules applied 5900 place count 3650 transition count 7150
Discarding 200 places :
Symmetric choice reduction at 0 with 200 rule applications. Total rules 6100 place count 3450 transition count 6950
Iterating global reduction 0 with 200 rules applied. Total rules applied 6300 place count 3450 transition count 6950
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6450 place count 3300 transition count 6800
Iterating global reduction 0 with 150 rules applied. Total rules applied 6600 place count 3300 transition count 6800
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6750 place count 3150 transition count 6650
Iterating global reduction 0 with 150 rules applied. Total rules applied 6900 place count 3150 transition count 6650
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7050 place count 3000 transition count 6500
Iterating global reduction 0 with 150 rules applied. Total rules applied 7200 place count 3000 transition count 6500
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7350 place count 2850 transition count 6350
Iterating global reduction 0 with 150 rules applied. Total rules applied 7500 place count 2850 transition count 6350
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7650 place count 2700 transition count 6200
Iterating global reduction 0 with 150 rules applied. Total rules applied 7800 place count 2700 transition count 6200
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 7900 place count 2600 transition count 6100
Iterating global reduction 0 with 100 rules applied. Total rules applied 8000 place count 2600 transition count 6100
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 8100 place count 2500 transition count 6000
Iterating global reduction 0 with 100 rules applied. Total rules applied 8200 place count 2500 transition count 6000
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 8250 place count 2450 transition count 5950
Iterating global reduction 0 with 50 rules applied. Total rules applied 8300 place count 2450 transition count 5950
Applied a total of 8300 rules in 4437 ms. Remains 2450 /6600 variables (removed 4150) and now considering 5950/10100 (removed 4150) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12472543491256554049.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16059808111545292757.kers'
[2026-05-23 18:06:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12472543491256554049.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16059808111545292757.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 5950 rows 2450 cols 11900 entries
Finished phase 1 with 2400 SingleSign rule and 0 generalized
[2026-05-23 18:06:45] [INFO ] Computed 50 invariants in 38 ms
Computed 50 P flows in 39 ms.
Exported basis to /tmp/petrispot-output-16059808111545292757.kers
Total runtime 44 ms.
[2026-05-23 18:06:45] [INFO ] Implicit Places using invariants in 664 ms returned []
[2026-05-23 18:06:45] [INFO ] Invariant cache hit.
[2026-05-23 18:06:49] [INFO ] Implicit Places using invariants and state equation in 3440 ms returned []
Implicit Place search using SMT with State Equation took 4124 ms to find 0 implicit places.
Running 4150 sub problems to find dead transitions.
[2026-05-23 18:06:49] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2400/8400 variables, and 0 constraints, problems are : Problem set: 0 solved, 4150 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2450 constraints, PredecessorRefiner: 4150/4150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4150 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2400/8400 variables, and 0 constraints, problems are : Problem set: 0 solved, 4150 unsolved in 30084 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2450 constraints, PredecessorRefiner: 0/4150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62602ms problems are : Problem set: 0 solved, 4150 unsolved
Search for dead transitions found 0 dead transitions in 62614ms
Starting structural reductions in LTL mode, iteration 1 : 2450/6600 places, 5950/10100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71192 ms. Remains : 2450/6600 places, 5950/10100 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(G(p1)))))'
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-050-LTLFireability-02
Product exploration explored 100000 steps with 1655 reset in 6458 ms.
Product exploration explored 100000 steps with 1661 reset in 6651 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 6 factoid took 79 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 1032 ms. (38 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 942 ms. (42 steps per ms) remains 1/1 properties
[2026-05-23 18:08:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2400/2450 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2450 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5950/8400 variables, 2450/2500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8400 variables, 0/2500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/8400 variables, 0/2500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8400/8400 variables, and 2500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3341 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 2450/2450 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 2450/8400 variables, and 50 constraints, problems are : Problem set: 1 solved, 0 unsolved in 725 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 0/2450 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4102ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 12 ms. Proved property starting from automaton with 4 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 9842 ms.
FORMULA BART-PT-050-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-050-LTLFireability-02 finished in 94395 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 4450 out of 6600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 6600 transition count 10000
Reduce places removed 100 places and 0 transitions.
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 450
Iterating post reduction 1 with 550 rules applied. Total rules applied 650 place count 6500 transition count 9550
Reduce places removed 450 places and 0 transitions.
Iterating post reduction 2 with 450 rules applied. Total rules applied 1100 place count 6050 transition count 9550
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 1100 place count 6050 transition count 9350
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 1500 place count 5850 transition count 9350
Discarding 300 places :
Symmetric choice reduction at 3 with 300 rule applications. Total rules 1800 place count 5550 transition count 9050
Iterating global reduction 3 with 300 rules applied. Total rules applied 2100 place count 5550 transition count 9050
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 3 with 50 rules applied. Total rules applied 2150 place count 5550 transition count 9000
Discarding 150 places :
Symmetric choice reduction at 4 with 150 rule applications. Total rules 2300 place count 5400 transition count 8850
Iterating global reduction 4 with 150 rules applied. Total rules applied 2450 place count 5400 transition count 8850
Discarding 150 places :
Symmetric choice reduction at 4 with 150 rule applications. Total rules 2600 place count 5250 transition count 8700
Iterating global reduction 4 with 150 rules applied. Total rules applied 2750 place count 5250 transition count 8700
Discarding 150 places :
Symmetric choice reduction at 4 with 150 rule applications. Total rules 2900 place count 5100 transition count 8550
Iterating global reduction 4 with 150 rules applied. Total rules applied 3050 place count 5100 transition count 8550
Discarding 100 places :
Symmetric choice reduction at 4 with 100 rule applications. Total rules 3150 place count 5000 transition count 8450
Iterating global reduction 4 with 100 rules applied. Total rules applied 3250 place count 5000 transition count 8450
Discarding 100 places :
Symmetric choice reduction at 4 with 100 rule applications. Total rules 3350 place count 4900 transition count 8350
Iterating global reduction 4 with 100 rules applied. Total rules applied 3450 place count 4900 transition count 8350
Discarding 50 places :
Symmetric choice reduction at 4 with 50 rule applications. Total rules 3500 place count 4850 transition count 8300
Iterating global reduction 4 with 50 rules applied. Total rules applied 3550 place count 4850 transition count 8300
Performed 300 Post agglomeration using F-continuation condition.Transition count delta: 300
Deduced a syphon composed of 300 places in 1 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 4 with 600 rules applied. Total rules applied 4150 place count 4550 transition count 8000
Applied a total of 4150 rules in 1039 ms. Remains 4550 /6600 variables (removed 2050) and now considering 8000/10100 (removed 2100) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9548464032042781027.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9911968054652648499.kers'
[2026-05-23 18:08:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9548464032042781027.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9911968054652648499.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 8000 rows 4550 cols 16000 entries
Finished phase 1 with 4500 SingleSign rule and 0 generalized
[2026-05-23 18:08:16] [INFO ] Computed 50 invariants in 39 ms
Computed 50 P flows in 39 ms.
Exported basis to /tmp/petrispot-output-9911968054652648499.kers
Total runtime 46 ms.
[2026-05-23 18:08:17] [INFO ] Implicit Places using invariants in 991 ms returned []
[2026-05-23 18:08:17] [INFO ] Invariant cache hit.
[2026-05-23 18:08:22] [INFO ] Implicit Places using invariants and state equation in 5578 ms returned []
Implicit Place search using SMT with State Equation took 6576 ms to find 0 implicit places.
[2026-05-23 18:08:24] [INFO ] Redundant transitions in 1452 ms returned []
Running 6200 sub problems to find dead transitions.
[2026-05-23 18:08:24] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4500/12550 variables, and 0 constraints, problems are : Problem set: 0 solved, 6200 unsolved in 30209 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/4550 constraints, PredecessorRefiner: 6200/6200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4500/12550 variables, and 0 constraints, problems are : Problem set: 0 solved, 6200 unsolved in 30196 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/4550 constraints, PredecessorRefiner: 0/6200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 66464ms problems are : Problem set: 0 solved, 6200 unsolved
Search for dead transitions found 0 dead transitions in 66482ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4550/6600 places, 8000/10100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75578 ms. Remains : 4550/6600 places, 8000/10100 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 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-050-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 2133 ms.
Stack based approach found an accepted trace after 13431 steps with 1 reset with depth 13362 and stack size 2900 in 314 ms.
FORMULA BART-PT-050-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-050-LTLFireability-04 finished in 78227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U (G(F(!p2))||p1)))'
Support contains 4900 out of 6600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 6600 transition count 10050
Reduce places removed 50 places and 0 transitions.
Performed 400 Post agglomeration using F-continuation condition.Transition count delta: 400
Iterating post reduction 1 with 450 rules applied. Total rules applied 500 place count 6550 transition count 9650
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 2 with 400 rules applied. Total rules applied 900 place count 6150 transition count 9650
Performed 700 Post agglomeration using F-continuation condition.Transition count delta: 700
Deduced a syphon composed of 700 places in 2 ms
Reduce places removed 700 places and 0 transitions.
Iterating global reduction 3 with 1400 rules applied. Total rules applied 2300 place count 5450 transition count 8950
Applied a total of 2300 rules in 609 ms. Remains 5450 /6600 variables (removed 1150) and now considering 8950/10100 (removed 1150) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18366010280880711788.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8715762662478946437.kers'
[2026-05-23 18:09:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18366010280880711788.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8715762662478946437.kers]
Culled 0 columns in 10 ms.
// Phase 1: matrix 8950 rows 5450 cols 17900 entries
Finished phase 1 with 5400 SingleSign rule and 0 generalized
[2026-05-23 18:09:33] [INFO ] Computed 50 invariants in 77 ms
Computed 50 P flows in 78 ms.
Exported basis to /tmp/petrispot-output-8715762662478946437.kers
Total runtime 87 ms.
[2026-05-23 18:09:35] [INFO ] Implicit Places using invariants in 1998 ms returned []
[2026-05-23 18:09:35] [INFO ] Invariant cache hit.
[2026-05-23 18:09:42] [INFO ] Implicit Places using invariants and state equation in 7008 ms returned []
Implicit Place search using SMT with State Equation took 9010 ms to find 0 implicit places.
[2026-05-23 18:09:44] [INFO ] Redundant transitions in 1574 ms returned []
Running 7150 sub problems to find dead transitions.
[2026-05-23 18:09:44] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/5400 variables, 5400/5400 constraints. Problems are: Problem set: 0 solved, 7150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5400/14400 variables, and 5400 constraints, problems are : Problem set: 0 solved, 7150 unsolved in 30210 ms.
Refiners :[Domain max(s): 5400/5450 constraints, Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/5450 constraints, PredecessorRefiner: 7150/7150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5400 variables, 5400/5400 constraints. Problems are: Problem set: 0 solved, 7150 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5400/14400 variables, and 5400 constraints, problems are : Problem set: 0 solved, 7150 unsolved in 30127 ms.
Refiners :[Domain max(s): 5400/5450 constraints, Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/5450 constraints, PredecessorRefiner: 0/7150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 66794ms problems are : Problem set: 0 solved, 7150 unsolved
Search for dead transitions found 0 dead transitions in 66809ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5450/6600 places, 8950/10100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78039 ms. Remains : 5450/6600 places, 8950/10100 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U (G(F(!p2))||p1)))'
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) p2), (AND p2 (NOT p0)), (AND p2 (NOT p0)), (AND (NOT p1) p2)]
Running random walk in product with property : BART-PT-050-LTLFireability-05
Product exploration explored 100000 steps with 9 reset in 1395 ms.
Product exploration explored 100000 steps with 2 reset in 1626 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 8 factoid took 370 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 4031 ms. (9 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 7811 ms. (5 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 7675 ms. (5 steps per ms) remains 1/1 properties
[2026-05-23 18:18:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4900 variables, 4900/4900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4900 variables, 0/4900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 550/5450 variables, 50/4950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5450 variables, 550/5500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5450/14400 variables, and 5500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5020 ms.
Refiners :[Domain max(s): 5450/5450 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 0/5450 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4900 variables, 4900/4900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4900 variables, 0/4900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 550/5450 variables, 50/4950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5450 variables, 550/5500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5450/14400 variables, and 5500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5007 ms.
Refiners :[Domain max(s): 5450/5450 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 0/5450 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10091ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4900 out of 5450 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5450/5450 places, 8950/8950 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1800 transitions
Redundant transition composition rules discarded 1800 transitions
Iterating global reduction 0 with 1800 rules applied. Total rules applied 1800 place count 5450 transition count 7150
Applied a total of 1800 rules in 149 ms. Remains 5450 /5450 variables (removed 0) and now considering 7150/8950 (removed 1800) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 5450/5450 places, 7150/8950 transitions.
RANDOM walk for 40000 steps (8 resets) in 1545 ms. (25 steps per ms) remains 1/1 properties
BEST_FIRST walk for 3634 steps (0 resets) in 868 ms. (4 steps per ms) remains 0/1 properties
Knowledge based reduction with 8 factoid took 311 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) p2), (AND p2 (NOT p0)), (AND p2 (NOT p0)), (AND (NOT p1) p2)]
Knowledge-based reduction took 473819 ms.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) p2), (AND p2 (NOT p0)), (AND p2 (NOT p0)), (AND (NOT p1) p2)]
Support contains 4900 out of 5450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5450/5450 places, 8950/8950 transitions.
Applied a total of 0 rules in 54 ms. Remains 5450 /5450 variables (removed 0) and now considering 8950/8950 (removed 0) transitions.
[2026-05-23 18:18:48] [INFO ] Invariant cache hit.
[2026-05-23 18:18:50] [INFO ] Implicit Places using invariants in 1816 ms returned []
[2026-05-23 18:18:50] [INFO ] Invariant cache hit.
[2026-05-23 18:18:56] [INFO ] Implicit Places using invariants and state equation in 6498 ms returned []
Implicit Place search using SMT with State Equation took 8338 ms to find 0 implicit places.
[2026-05-23 18:18:57] [INFO ] Redundant transitions in 847 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9248 ms. Remains : 5450/5450 places, 8950/8950 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 9 factoid took 279 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 2328 ms. (17 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6247 ms. (6 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 7021 ms. (5 steps per ms) remains 1/1 properties
[2026-05-23 18:26:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4900 variables, 4900/4900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4900 variables, 0/4900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 550/5450 variables, 50/4950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5450 variables, 550/5500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5450 variables, 0/5500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5036ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4900 out of 5450 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5450/5450 places, 8950/8950 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1800 transitions
Redundant transition composition rules discarded 1800 transitions
Iterating global reduction 0 with 1800 rules applied. Total rules applied 1800 place count 5450 transition count 7150
Applied a total of 1800 rules in 212 ms. Remains 5450 /5450 variables (removed 0) and now considering 7150/8950 (removed 1800) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 212 ms. Remains : 5450/5450 places, 7150/8950 transitions.
RANDOM walk for 40000 steps (8 resets) in 1602 ms. (24 steps per ms) remains 1/1 properties
BEST_FIRST walk for 3585 steps (0 resets) in 1004 ms. (3 steps per ms) remains 0/1 properties
Knowledge based reduction with 9 factoid took 359 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) p2), (AND p2 (NOT p0)), (AND p2 (NOT p0)), (AND (NOT p1) p2)]
Knowledge-based reduction took 429004 ms.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p1) p2), (AND p2 (NOT p0)), (AND p2 (NOT p0)), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) p2), (AND p2 (NOT p0)), (AND p2 (NOT p0)), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 4 reset in 1430 ms.
Product exploration explored 100000 steps with 3 reset in 1295 ms.
Built C files in :
/tmp/ltsmin13050141537936025445
[2026-05-23 18:26:09] [INFO ] Too many transitions (8950) to apply POR reductions. Disabling POR matrices.
[2026-05-23 18:26:10] [INFO ] Built C files in 146ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13050141537936025445
Running compilation step : cd /tmp/ltsmin13050141537936025445;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13050141537936025445;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13050141537936025445;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4900 out of 5450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5450/5450 places, 8950/8950 transitions.
Applied a total of 0 rules in 80 ms. Remains 5450 /5450 variables (removed 0) and now considering 8950/8950 (removed 0) transitions.
[2026-05-23 18:26:13] [INFO ] Invariant cache hit.
[2026-05-23 18:26:15] [INFO ] Implicit Places using invariants in 2008 ms returned []
[2026-05-23 18:26:15] [INFO ] Invariant cache hit.
[2026-05-23 18:26:22] [INFO ] Implicit Places using invariants and state equation in 7250 ms returned []
Implicit Place search using SMT with State Equation took 9264 ms to find 0 implicit places.
[2026-05-23 18:26:23] [INFO ] Redundant transitions in 881 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10234 ms. Remains : 5450/5450 places, 8950/8950 transitions.
Built C files in :
/tmp/ltsmin8421791267425215750
[2026-05-23 18:26:23] [INFO ] Too many transitions (8950) to apply POR reductions. Disabling POR matrices.
[2026-05-23 18:26:23] [INFO ] Built C files in 204ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8421791267425215750
Running compilation step : cd /tmp/ltsmin8421791267425215750;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8421791267425215750;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8421791267425215750;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 18:26:28] [INFO ] Flatten gal took : 451 ms
[2026-05-23 18:26:28] [INFO ] Flatten gal took : 338 ms
[2026-05-23 18:26:28] [INFO ] Time to serialize gal into /tmp/LTL7606627615960476176.gal : 65 ms
[2026-05-23 18:26:28] [INFO ] Time to serialize properties into /tmp/LTL336356238876698801.prop : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7606627615960476176.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9386652527007350309.hoa' '-atoms' '/tmp/LTL336356238876698801.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL336356238876698801.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9386652527007350309.hoa
Detected timeout of ITS tools.
[2026-05-23 18:26:43] [INFO ] Flatten gal took : 177 ms
[2026-05-23 18:26:44] [INFO ] Flatten gal took : 178 ms
[2026-05-23 18:26:44] [INFO ] Time to serialize gal into /tmp/LTL3330032166805237885.gal : 33 ms
[2026-05-23 18:26:44] [INFO ] Time to serialize properties into /tmp/LTL18015356576864371138.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3330032166805237885.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18015356576864371138.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F(G("((((((((((TrainState_46_4_14==1)||(TrainState_6_4_13==1))||((TrainState_3_4_14==1)||(TrainState_9_4_12==1)))||(((TrainState_4...130976
Formula 0 simplified : GF!"((((((((((TrainState_46_4_14==1)||(TrainState_6_4_13==1))||((TrainState_3_4_14==1)||(TrainState_9_4_12==1)))||(((TrainState_40_2...130955
Detected timeout of ITS tools.
[2026-05-23 18:26:59] [INFO ] Flatten gal took : 158 ms
[2026-05-23 18:26:59] [INFO ] Applying decomposition
[2026-05-23 18:26:59] [INFO ] Flatten gal took : 161 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7242318645376099063.txt' '-o' '/tmp/graph7242318645376099063.bin' '-w' '/tmp/graph7242318645376099063.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7242318645376099063.bin' '-l' '-1' '-v' '-w' '/tmp/graph7242318645376099063.weights' '-q' '0' '-e' '0.001'
[2026-05-23 18:27:00] [INFO ] Decomposing Gal with order
[2026-05-23 18:27:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 18:27:02] [INFO ] Removed a total of 1118 redundant transitions.
[2026-05-23 18:27:03] [INFO ] Flatten gal took : 428 ms
[2026-05-23 18:27:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 147 ms.
[2026-05-23 18:27:05] [INFO ] Time to serialize gal into /tmp/LTL8263177096059411083.gal : 63 ms
[2026-05-23 18:27:05] [INFO ] Time to serialize properties into /tmp/LTL10648226754908172859.ltl : 25 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8263177096059411083.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10648226754908172859.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F(G("((((((((((i14.i0.u567.TrainState_46_4_14==1)||(i27.i0.u498.TrainState_6_4_13==1))||((i0.i0.u458.TrainState_3_4_14==1)||(i46.i...188668
Formula 0 simplified : GF!"((((((((((i14.i0.u567.TrainState_46_4_14==1)||(i27.i0.u498.TrainState_6_4_13==1))||((i0.i0.u458.TrainState_3_4_14==1)||(i46.i4.u...188647
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property BART-PT-050-LTLFireability-05 finished in 1067496 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&&G(F(p0)))) U X(p0))))'
Support contains 450 out of 6600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Graph (trivial) has 8900 edges and 6600 vertex of which 2050 / 6600 are part of one of the 50 SCC in 10 ms
Free SCC test removed 2000 places
Ensure Unique test removed 3750 transitions
Reduce isomorphic transitions removed 3750 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2800 transitions
Trivial Post-agglo rules discarded 2800 transitions
Performed 2800 trivial Post agglomeration. Transition count delta: 2800
Iterating post reduction 0 with 2800 rules applied. Total rules applied 2801 place count 4600 transition count 3550
Reduce places removed 2800 places and 0 transitions.
Ensure Unique test removed 400 transitions
Reduce isomorphic transitions removed 400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 1 with 3400 rules applied. Total rules applied 6201 place count 1800 transition count 2950
Reduce places removed 200 places and 0 transitions.
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 600 rules applied. Total rules applied 6801 place count 1600 transition count 2550
Reduce places removed 200 places and 0 transitions.
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 3 with 600 rules applied. Total rules applied 7401 place count 1400 transition count 2150
Reduce places removed 200 places and 0 transitions.
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 4 with 400 rules applied. Total rules applied 7801 place count 1200 transition count 1950
Discarding 250 places :
Symmetric choice reduction at 5 with 250 rule applications. Total rules 8051 place count 950 transition count 1700
Iterating global reduction 5 with 250 rules applied. Total rules applied 8301 place count 950 transition count 1700
Ensure Unique test removed 250 transitions
Reduce isomorphic transitions removed 250 transitions.
Iterating post reduction 5 with 250 rules applied. Total rules applied 8551 place count 950 transition count 1450
Drop transitions (Redundant composition of simpler transitions.) removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 6 with 50 rules applied. Total rules applied 8601 place count 950 transition count 1400
Applied a total of 8601 rules in 287 ms. Remains 950 /6600 variables (removed 5650) and now considering 1400/10100 (removed 8700) transitions.
[2026-05-23 18:27:21] [INFO ] Flow matrix only has 1351 transitions (discarded 49 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5126211601342455950.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7545783343905280815.kers'
[2026-05-23 18:27:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5126211601342455950.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7545783343905280815.kers]
Normalized transition count is 1350 out of 1351 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 1350 rows 950 cols 2700 entries
Finished phase 1 with 900 SingleSign rule and 0 generalized
[2026-05-23 18:27:21] [INFO ] Computed 50 invariants in 8 ms
Computed 50 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-7545783343905280815.kers
Total runtime 17 ms.
[2026-05-23 18:27:21] [INFO ] Implicit Places using invariants in 389 ms returned []
[2026-05-23 18:27:21] [INFO ] Flow matrix only has 1351 transitions (discarded 49 similar events)
[2026-05-23 18:27:21] [INFO ] Invariant cache hit.
[2026-05-23 18:27:22] [INFO ] Implicit Places using invariants and state equation in 726 ms returned []
Implicit Place search using SMT with State Equation took 1116 ms to find 0 implicit places.
[2026-05-23 18:27:22] [INFO ] Redundant transitions in 25 ms returned []
Running 900 sub problems to find dead transitions.
[2026-05-23 18:27:22] [INFO ] Flow matrix only has 1351 transitions (discarded 49 similar events)
[2026-05-23 18:27:22] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 900/2301 variables, and 0 constraints, problems are : Problem set: 0 solved, 900 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/950 constraints, PredecessorRefiner: 900/900 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 900 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 900/2301 variables, and 0 constraints, problems are : Problem set: 0 solved, 900 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/950 constraints, PredecessorRefiner: 0/900 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60239ms problems are : Problem set: 0 solved, 900 unsolved
Search for dead transitions found 0 dead transitions in 60242ms
Starting structural reductions in SI_LTL mode, iteration 1 : 950/6600 places, 1400/10100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61681 ms. Remains : 950/6600 places, 1400/10100 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((G(F(p0))&&p0)) U X(p0))))'
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-050-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-050-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-050-LTLFireability-06 finished in 61934 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 50 out of 6600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3200 transitions
Trivial Post-agglo rules discarded 3200 transitions
Performed 3200 trivial Post agglomeration. Transition count delta: 3200
Iterating post reduction 0 with 3200 rules applied. Total rules applied 3200 place count 6600 transition count 6900
Reduce places removed 3200 places and 0 transitions.
Iterating post reduction 1 with 3200 rules applied. Total rules applied 6400 place count 3400 transition count 6900
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 6400 place count 3400 transition count 6700
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 6800 place count 3200 transition count 6700
Discarding 300 places :
Symmetric choice reduction at 2 with 300 rule applications. Total rules 7100 place count 2900 transition count 6400
Iterating global reduction 2 with 300 rules applied. Total rules applied 7400 place count 2900 transition count 6400
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 2 with 50 rules applied. Total rules applied 7450 place count 2900 transition count 6350
Discarding 200 places :
Symmetric choice reduction at 3 with 200 rule applications. Total rules 7650 place count 2700 transition count 6150
Iterating global reduction 3 with 200 rules applied. Total rules applied 7850 place count 2700 transition count 6150
Discarding 150 places :
Symmetric choice reduction at 3 with 150 rule applications. Total rules 8000 place count 2550 transition count 6000
Iterating global reduction 3 with 150 rules applied. Total rules applied 8150 place count 2550 transition count 6000
Discarding 150 places :
Symmetric choice reduction at 3 with 150 rule applications. Total rules 8300 place count 2400 transition count 5850
Iterating global reduction 3 with 150 rules applied. Total rules applied 8450 place count 2400 transition count 5850
Discarding 100 places :
Symmetric choice reduction at 3 with 100 rule applications. Total rules 8550 place count 2300 transition count 5750
Iterating global reduction 3 with 100 rules applied. Total rules applied 8650 place count 2300 transition count 5750
Discarding 100 places :
Symmetric choice reduction at 3 with 100 rule applications. Total rules 8750 place count 2200 transition count 5650
Iterating global reduction 3 with 100 rules applied. Total rules applied 8850 place count 2200 transition count 5650
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 8900 place count 2150 transition count 5600
Iterating global reduction 3 with 50 rules applied. Total rules applied 8950 place count 2150 transition count 5600
Performed 350 Post agglomeration using F-continuation condition.Transition count delta: 350
Deduced a syphon composed of 350 places in 0 ms
Reduce places removed 350 places and 0 transitions.
Iterating global reduction 3 with 700 rules applied. Total rules applied 9650 place count 1800 transition count 5250
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 3 with 200 rules applied. Total rules applied 9850 place count 1800 transition count 5050
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 4 with 200 rules applied. Total rules applied 10050 place count 1700 transition count 4950
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 4 with 200 rules applied. Total rules applied 10250 place count 1700 transition count 4750
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 5 with 200 rules applied. Total rules applied 10450 place count 1600 transition count 4650
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 5 with 200 rules applied. Total rules applied 10650 place count 1600 transition count 4450
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 6 with 200 rules applied. Total rules applied 10850 place count 1500 transition count 4350
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 6 with 200 rules applied. Total rules applied 11050 place count 1500 transition count 4150
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 7 with 200 rules applied. Total rules applied 11250 place count 1400 transition count 4050
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 7 with 200 rules applied. Total rules applied 11450 place count 1400 transition count 3850
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 8 with 200 rules applied. Total rules applied 11650 place count 1300 transition count 3750
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 8 with 200 rules applied. Total rules applied 11850 place count 1300 transition count 3550
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 9 with 200 rules applied. Total rules applied 12050 place count 1200 transition count 3450
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 9 with 200 rules applied. Total rules applied 12250 place count 1200 transition count 3250
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 10 with 200 rules applied. Total rules applied 12450 place count 1100 transition count 3150
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 10 with 200 rules applied. Total rules applied 12650 place count 1100 transition count 2950
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 11 with 200 rules applied. Total rules applied 12850 place count 1000 transition count 2850
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 11 with 200 rules applied. Total rules applied 13050 place count 1000 transition count 2650
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 12 with 200 rules applied. Total rules applied 13250 place count 900 transition count 2550
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 12 with 200 rules applied. Total rules applied 13450 place count 900 transition count 2350
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 13 with 200 rules applied. Total rules applied 13650 place count 800 transition count 2250
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 13 with 200 rules applied. Total rules applied 13850 place count 800 transition count 2050
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 14 with 200 rules applied. Total rules applied 14050 place count 700 transition count 1950
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 14 with 200 rules applied. Total rules applied 14250 place count 700 transition count 1750
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 15 with 200 rules applied. Total rules applied 14450 place count 600 transition count 1650
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 15 with 200 rules applied. Total rules applied 14650 place count 600 transition count 1450
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 16 with 200 rules applied. Total rules applied 14850 place count 500 transition count 1350
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 16 with 200 rules applied. Total rules applied 15050 place count 500 transition count 1150
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 17 with 200 rules applied. Total rules applied 15250 place count 400 transition count 1050
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 17 with 200 rules applied. Total rules applied 15450 place count 400 transition count 850
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 18 with 200 rules applied. Total rules applied 15650 place count 300 transition count 750
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 18 with 200 rules applied. Total rules applied 15850 place count 300 transition count 550
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 19 with 200 rules applied. Total rules applied 16050 place count 200 transition count 450
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 19 with 250 rules applied. Total rules applied 16300 place count 200 transition count 200
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 20 with 100 rules applied. Total rules applied 16400 place count 150 transition count 150
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 50 Pre rules applied. Total rules applied 16400 place count 150 transition count 100
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 21 with 100 rules applied. Total rules applied 16500 place count 100 transition count 100
Applied a total of 16500 rules in 3779 ms. Remains 100 /6600 variables (removed 6500) and now considering 100/10100 (removed 10000) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8146811355348116132.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16786734066273649656.kers'
[2026-05-23 18:28:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8146811355348116132.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16786734066273649656.kers]
Culling duplicate invariants (modulo rational): removing 50 columns.
Culled 50 columns in 0 ms.
// Phase 1: matrix 100 rows 50 cols 100 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-23 18:28:26] [INFO ] Computed 50 invariants in 0 ms
Computed 50 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16786734066273649656.kers
Total runtime 2 ms.
[2026-05-23 18:28:26] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-23 18:28:26] [INFO ] Invariant cache hit.
[2026-05-23 18:28:26] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2026-05-23 18:28:26] [INFO ] Redundant transitions in 0 ms returned []
Running 50 sub problems to find dead transitions.
[2026-05-23 18:28:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 50/100 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 100/200 variables, 100/150 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 0/200 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 150 constraints, problems are : Problem set: 0 solved, 50 unsolved in 2120 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 50/100 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 100/200 variables, 100/150 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 50/200 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 200 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1996 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4122ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 4122ms
Starting structural reductions in SI_LTL mode, iteration 1 : 100/6600 places, 100/10100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8092 ms. Remains : 100/6600 places, 100/10100 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-050-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 549 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 1 ms.
FORMULA BART-PT-050-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-050-LTLFireability-07 finished in 8753 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U (p0 U p1)))'
Support contains 2 out of 6600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Graph (trivial) has 10093 edges and 6600 vertex of which 6558 / 6600 are part of one of the 50 SCC in 2 ms
Free SCC test removed 6508 places
Ensure Unique test removed 9993 transitions
Reduce isomorphic transitions removed 9993 transitions.
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 44 transition count 32
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 109 place count 16 transition count 27
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 115 place count 14 transition count 23
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 121 place count 12 transition count 19
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 127 place count 10 transition count 15
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 131 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 134 place count 7 transition count 11
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 136 place count 6 transition count 10
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 137 place count 5 transition count 9
Iterating global reduction 8 with 1 rules applied. Total rules applied 138 place count 5 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 139 place count 5 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 141 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 141 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 143 place count 4 transition count 5
Applied a total of 143 rules in 22 ms. Remains 4 /6600 variables (removed 6596) and now considering 5/10100 (removed 10095) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16897643686753228429.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9658413487437633398.kers'
[2026-05-23 18:28:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16897643686753228429.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9658413487437633398.kers]
Normalized transition count is 4 out of 5 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 4 rows 2 cols 4 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-23 18:28:31] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-9658413487437633398.kers
Total runtime 18 ms.
[2026-05-23 18:28:31] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-23 18:28:31] [INFO ] Invariant cache hit.
[2026-05-23 18:28:31] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2026-05-23 18:28:31] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-23 18:28:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 87ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 87ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/6600 places, 5/10100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 241 ms. Remains : 4/6600 places, 5/10100 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U (p0 U p1)))'
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : BART-PT-050-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-050-LTLFireability-08 finished in 434 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&&X(X(G(p0)))) U X(p1))))'
Support contains 2 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 1599 places :
Symmetric choice reduction at 0 with 1599 rule applications. Total rules 1599 place count 5001 transition count 8501
Iterating global reduction 0 with 1599 rules applied. Total rules applied 3198 place count 5001 transition count 8501
Discarding 1349 places :
Symmetric choice reduction at 0 with 1349 rule applications. Total rules 4547 place count 3652 transition count 7152
Iterating global reduction 0 with 1349 rules applied. Total rules applied 5896 place count 3652 transition count 7152
Discarding 200 places :
Symmetric choice reduction at 0 with 200 rule applications. Total rules 6096 place count 3452 transition count 6952
Iterating global reduction 0 with 200 rules applied. Total rules applied 6296 place count 3452 transition count 6952
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6446 place count 3302 transition count 6802
Iterating global reduction 0 with 150 rules applied. Total rules applied 6596 place count 3302 transition count 6802
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 6745 place count 3153 transition count 6653
Iterating global reduction 0 with 149 rules applied. Total rules applied 6894 place count 3153 transition count 6653
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7043 place count 3004 transition count 6504
Iterating global reduction 0 with 149 rules applied. Total rules applied 7192 place count 3004 transition count 6504
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7341 place count 2855 transition count 6355
Iterating global reduction 0 with 149 rules applied. Total rules applied 7490 place count 2855 transition count 6355
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7639 place count 2706 transition count 6206
Iterating global reduction 0 with 149 rules applied. Total rules applied 7788 place count 2706 transition count 6206
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 7887 place count 2607 transition count 6107
Iterating global reduction 0 with 99 rules applied. Total rules applied 7986 place count 2607 transition count 6107
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 8085 place count 2508 transition count 6008
Iterating global reduction 0 with 99 rules applied. Total rules applied 8184 place count 2508 transition count 6008
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 8233 place count 2459 transition count 5959
Iterating global reduction 0 with 49 rules applied. Total rules applied 8282 place count 2459 transition count 5959
Applied a total of 8282 rules in 5049 ms. Remains 2459 /6600 variables (removed 4141) and now considering 5959/10100 (removed 4141) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14604052521196227182.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12011693730607435512.kers'
[2026-05-23 18:28:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14604052521196227182.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12011693730607435512.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 5959 rows 2459 cols 11918 entries
Finished phase 1 with 2409 SingleSign rule and 0 generalized
[2026-05-23 18:28:36] [INFO ] Computed 50 invariants in 26 ms
Computed 50 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-12011693730607435512.kers
Total runtime 32 ms.
[2026-05-23 18:28:37] [INFO ] Implicit Places using invariants in 516 ms returned []
[2026-05-23 18:28:37] [INFO ] Invariant cache hit.
[2026-05-23 18:28:40] [INFO ] Implicit Places using invariants and state equation in 3043 ms returned []
Implicit Place search using SMT with State Equation took 3562 ms to find 0 implicit places.
Running 4159 sub problems to find dead transitions.
[2026-05-23 18:28:40] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2409/8418 variables, and 0 constraints, problems are : Problem set: 0 solved, 4159 unsolved in 30118 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2459 constraints, PredecessorRefiner: 4159/4159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4159 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2409/8418 variables, and 0 constraints, problems are : Problem set: 0 solved, 4159 unsolved in 30117 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2459 constraints, PredecessorRefiner: 0/4159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62729ms problems are : Problem set: 0 solved, 4159 unsolved
Search for dead transitions found 0 dead transitions in 62739ms
Starting structural reductions in LTL mode, iteration 1 : 2459/6600 places, 5959/10100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71371 ms. Remains : 2459/6600 places, 5959/10100 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&&X(X(G(p0)))) U X(p1))))'
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : BART-PT-050-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2645 steps with 881 reset in 341 ms.
FORMULA BART-PT-050-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-050-LTLFireability-09 finished in 71998 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)||((p1 U (p2||G(p1))) U ((X((p3&&X(p3)))&&(p1 U (p2||G(p1))))||G((p1 U (p2||G(p1))))))))))'
Support contains 3 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 1599 places :
Symmetric choice reduction at 0 with 1599 rule applications. Total rules 1599 place count 5001 transition count 8501
Iterating global reduction 0 with 1599 rules applied. Total rules applied 3198 place count 5001 transition count 8501
Discarding 1349 places :
Symmetric choice reduction at 0 with 1349 rule applications. Total rules 4547 place count 3652 transition count 7152
Iterating global reduction 0 with 1349 rules applied. Total rules applied 5896 place count 3652 transition count 7152
Discarding 200 places :
Symmetric choice reduction at 0 with 200 rule applications. Total rules 6096 place count 3452 transition count 6952
Iterating global reduction 0 with 200 rules applied. Total rules applied 6296 place count 3452 transition count 6952
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6446 place count 3302 transition count 6802
Iterating global reduction 0 with 150 rules applied. Total rules applied 6596 place count 3302 transition count 6802
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6746 place count 3152 transition count 6652
Iterating global reduction 0 with 150 rules applied. Total rules applied 6896 place count 3152 transition count 6652
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7046 place count 3002 transition count 6502
Iterating global reduction 0 with 150 rules applied. Total rules applied 7196 place count 3002 transition count 6502
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7346 place count 2852 transition count 6352
Iterating global reduction 0 with 150 rules applied. Total rules applied 7496 place count 2852 transition count 6352
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7646 place count 2702 transition count 6202
Iterating global reduction 0 with 150 rules applied. Total rules applied 7796 place count 2702 transition count 6202
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 7896 place count 2602 transition count 6102
Iterating global reduction 0 with 100 rules applied. Total rules applied 7996 place count 2602 transition count 6102
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 8096 place count 2502 transition count 6002
Iterating global reduction 0 with 100 rules applied. Total rules applied 8196 place count 2502 transition count 6002
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 8246 place count 2452 transition count 5952
Iterating global reduction 0 with 50 rules applied. Total rules applied 8296 place count 2452 transition count 5952
Applied a total of 8296 rules in 4964 ms. Remains 2452 /6600 variables (removed 4148) and now considering 5952/10100 (removed 4148) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13022241674000214774.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7396208703733376300.kers'
[2026-05-23 18:29:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13022241674000214774.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7396208703733376300.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 5952 rows 2452 cols 11904 entries
Finished phase 1 with 2402 SingleSign rule and 0 generalized
[2026-05-23 18:29:48] [INFO ] Computed 50 invariants in 28 ms
Computed 50 P flows in 29 ms.
Exported basis to /tmp/petrispot-output-7396208703733376300.kers
Total runtime 35 ms.
[2026-05-23 18:29:49] [INFO ] Implicit Places using invariants in 521 ms returned []
[2026-05-23 18:29:49] [INFO ] Invariant cache hit.
[2026-05-23 18:29:52] [INFO ] Implicit Places using invariants and state equation in 3036 ms returned []
Implicit Place search using SMT with State Equation took 3562 ms to find 0 implicit places.
Running 4152 sub problems to find dead transitions.
[2026-05-23 18:29:52] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2402/8404 variables, and 0 constraints, problems are : Problem set: 0 solved, 4152 unsolved in 30119 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2452 constraints, PredecessorRefiner: 4152/4152 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4152 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2402/8404 variables, and 0 constraints, problems are : Problem set: 0 solved, 4152 unsolved in 30118 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2452 constraints, PredecessorRefiner: 0/4152 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62334ms problems are : Problem set: 0 solved, 4152 unsolved
Search for dead transitions found 0 dead transitions in 62344ms
Starting structural reductions in LTL mode, iteration 1 : 2452/6600 places, 5952/10100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70886 ms. Remains : 2452/6600 places, 5952/10100 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)||((p1 U (p2||G(p1))) U ((X((p3&&X(p3)))&&(p1 U (p2||G(p1))))||G((p1 U (p2||G(p1))))))))))'
Stuttering acceptance computed with spot in 461 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p0) p3), true, (AND p0 (NOT p3)), (AND p0 (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p3) (NOT p2) (NOT p1))]
Running random walk in product with property : BART-PT-050-LTLFireability-10
Product exploration explored 100000 steps with 25060 reset in 8733 ms.
Product exploration explored 100000 steps with 24944 reset in 8224 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 10 factoid took 406 ms. Reduced automaton from 10 states, 25 edges and 4 AP (stutter sensitive) to 10 states, 25 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 21 to 19
RANDOM walk for 40000 steps (8 resets) in 879 ms. (45 steps per ms) remains 6/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 378 ms. (105 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
[2026-05-23 18:31:22] [INFO ] Invariant cache hit.
Problem apf3 is UNSAT
Problem apf12 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 146/149 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 359/508 variables, 149/152 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 0/152 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/508 variables, 0/152 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 508/8404 variables, and 152 constraints, problems are : Problem set: 2 solved, 4 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 3/50 constraints, State Equation: 149/2452 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 146/149 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 359/508 variables, 149/152 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 4/156 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 0/156 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/508 variables, 0/156 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 508/8404 variables, and 156 constraints, problems are : Problem set: 2 solved, 4 unsolved in 741 ms.
Refiners :[Positive P Invariants (semi-flows): 3/50 constraints, State Equation: 149/2452 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1156ms problems are : Problem set: 2 solved, 4 unsolved
Finished Parikh walk after 124 steps, including 2 resets, run visited all 4 properties in 5 ms. (steps per millisecond=24 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 14 ms.
Found 2 invariant AP formulas.
Knowledge based reduction with 12 factoid took 795 ms. Reduced automaton from 10 states, 25 edges and 4 AP (stutter sensitive) to 10 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 418 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND p0 p1 (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND p0 p1 (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)) (AND p0 (NOT p3) p1 (NOT p2))), (OR (AND (NOT p1) (NOT p2) (NOT p0) p3) (AND p1 (NOT p2) p0 p3)), true, (AND p0 (NOT p3)), (AND p0 (NOT p3) (NOT p2)), (AND (NOT p2) p0), (AND p0 (NOT p3) (NOT p2))]
Knowledge-based reduction took 12990 ms.
Stuttering acceptance computed with spot in 419 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND p0 p1 (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND p0 p1 (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)) (AND p0 (NOT p3) p1 (NOT p2))), (OR (AND (NOT p1) (NOT p2) (NOT p0) p3) (AND p1 (NOT p2) p0 p3)), true, (AND p0 (NOT p3)), (AND p0 (NOT p3) (NOT p2)), (AND (NOT p2) p0), (AND p0 (NOT p3) (NOT p2))]
Support contains 3 out of 2452 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2452/2452 places, 5952/5952 transitions.
Applied a total of 0 rules in 224 ms. Remains 2452 /2452 variables (removed 0) and now considering 5952/5952 (removed 0) transitions.
[2026-05-23 18:31:25] [INFO ] Invariant cache hit.
[2026-05-23 18:31:26] [INFO ] Implicit Places using invariants in 613 ms returned []
[2026-05-23 18:31:26] [INFO ] Invariant cache hit.
[2026-05-23 18:31:29] [INFO ] Implicit Places using invariants and state equation in 2695 ms returned []
Implicit Place search using SMT with State Equation took 3310 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3534 ms. Remains : 2452/2452 places, 5952/5952 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 10 factoid took 290 ms. Reduced automaton from 10 states, 22 edges and 4 AP (stutter sensitive) to 10 states, 22 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 19 to 17
RANDOM walk for 40000 steps (8 resets) in 842 ms. (47 steps per ms) remains 4/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
[2026-05-23 18:31:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 146/149 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 359/508 variables, 149/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/508 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 508/8404 variables, and 152 constraints, problems are : Problem set: 0 solved, 4 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 3/50 constraints, State Equation: 149/2452 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 146/149 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 359/508 variables, 149/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 4/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/508 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 508/8404 variables, and 156 constraints, problems are : Problem set: 0 solved, 4 unsolved in 859 ms.
Refiners :[Positive P Invariants (semi-flows): 3/50 constraints, State Equation: 149/2452 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1261ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 2963 steps, including 24 resets, run visited all 4 properties in 28 ms. (steps per millisecond=105 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 33 ms.
Knowledge based reduction with 10 factoid took 623 ms. Reduced automaton from 10 states, 22 edges and 4 AP (stutter sensitive) to 10 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 422 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND p0 p1 (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND p0 p1 (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)) (AND p0 (NOT p3) p1 (NOT p2))), (OR (AND (NOT p1) (NOT p2) (NOT p0) p3) (AND p1 (NOT p2) p0 p3)), true, (AND p0 (NOT p3)), (AND p0 (NOT p3) (NOT p2)), (AND (NOT p2) p0), (AND p0 (NOT p3) (NOT p2))]
Knowledge-based reduction took 11924 ms.
Stuttering acceptance computed with spot in 433 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND p0 p1 (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND p0 p1 (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)) (AND p0 (NOT p3) p1 (NOT p2))), (OR (AND (NOT p1) (NOT p2) (NOT p0) p3) (AND p1 (NOT p2) p0 p3)), true, (AND p0 (NOT p3)), (AND p0 (NOT p3) (NOT p2)), (AND (NOT p2) p0), (AND p0 (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 464 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND p0 p1 (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND p0 p1 (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)) (AND p0 (NOT p3) p1 (NOT p2))), (OR (AND (NOT p1) (NOT p2) (NOT p0) p3) (AND p1 (NOT p2) p0 p3)), true, (AND p0 (NOT p3)), (AND p0 (NOT p3) (NOT p2)), (AND (NOT p2) p0), (AND p0 (NOT p3) (NOT p2))]
Product exploration explored 100000 steps with 24970 reset in 8495 ms.
Product exploration explored 100000 steps with 25038 reset in 8559 ms.
Spot run failed in 95 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin13335905447706577536
[2026-05-23 18:31:59] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13335905447706577536
Running compilation step : cd /tmp/ltsmin13335905447706577536;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13335905447706577536;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13335905447706577536;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 2452 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2452/2452 places, 5952/5952 transitions.
Applied a total of 0 rules in 222 ms. Remains 2452 /2452 variables (removed 0) and now considering 5952/5952 (removed 0) transitions.
[2026-05-23 18:32:02] [INFO ] Invariant cache hit.
[2026-05-23 18:32:03] [INFO ] Implicit Places using invariants in 530 ms returned []
[2026-05-23 18:32:03] [INFO ] Invariant cache hit.
[2026-05-23 18:32:05] [INFO ] Implicit Places using invariants and state equation in 2776 ms returned []
Implicit Place search using SMT with State Equation took 3308 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3530 ms. Remains : 2452/2452 places, 5952/5952 transitions.
Built C files in :
/tmp/ltsmin8086468102228708514
[2026-05-23 18:32:05] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8086468102228708514
Running compilation step : cd /tmp/ltsmin8086468102228708514;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8086468102228708514;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8086468102228708514;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 18:32:09] [INFO ] Flatten gal took : 81 ms
[2026-05-23 18:32:09] [INFO ] Flatten gal took : 79 ms
[2026-05-23 18:32:09] [INFO ] Time to serialize gal into /tmp/LTL1435354038027555126.gal : 19 ms
[2026-05-23 18:32:09] [INFO ] Time to serialize properties into /tmp/LTL11702971297742593581.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1435354038027555126.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11855568489239995775.hoa' '-atoms' '/tmp/LTL11702971297742593581.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11702971297742593581.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11855568489239995775.hoa
Detected timeout of ITS tools.
[2026-05-23 18:32:24] [INFO ] Flatten gal took : 70 ms
[2026-05-23 18:32:24] [INFO ] Flatten gal took : 77 ms
[2026-05-23 18:32:24] [INFO ] Time to serialize gal into /tmp/LTL15374081772546095870.gal : 19 ms
[2026-05-23 18:32:24] [INFO ] Time to serialize properties into /tmp/LTL16864678516774928454.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15374081772546095870.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16864678516774928454.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G((X("(TrainState_49_3_17==0)"))||((("(TrainState_36_1_25!=1)")U(("((TrainState_49_3_17!=1)&&(TrainState_36_1_25!=1))")||(G("(Tra...494
Formula 0 simplified : XF(X!"(TrainState_49_3_17==0)" & ((!"(TrainState_36_1_25!=1)" M !"((TrainState_49_3_17!=1)&&(TrainState_36_1_25!=1))") R (F(!"((Trai...382
Detected timeout of ITS tools.
[2026-05-23 18:32:39] [INFO ] Flatten gal took : 67 ms
[2026-05-23 18:32:39] [INFO ] Applying decomposition
[2026-05-23 18:32:39] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10410456553755960046.txt' '-o' '/tmp/graph10410456553755960046.bin' '-w' '/tmp/graph10410456553755960046.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10410456553755960046.bin' '-l' '-1' '-v' '-w' '/tmp/graph10410456553755960046.weights' '-q' '0' '-e' '0.001'
[2026-05-23 18:32:40] [INFO ] Decomposing Gal with order
[2026-05-23 18:32:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 18:32:40] [INFO ] Removed a total of 1901 redundant transitions.
[2026-05-23 18:32:40] [INFO ] Flatten gal took : 244 ms
[2026-05-23 18:32:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 1079 labels/synchronizations in 53 ms.
[2026-05-23 18:32:40] [INFO ] Time to serialize gal into /tmp/LTL11357770976971745215.gal : 32 ms
[2026-05-23 18:32:40] [INFO ] Time to serialize properties into /tmp/LTL13036378138660369446.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11357770976971745215.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13036378138660369446.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G((X("(i45.u272.TrainState_49_3_17==0)"))||((("(i19.u309.TrainState_36_1_25!=1)")U(("((i45.u272.TrainState_49_3_17!=1)&&(i19.u309...629
Formula 0 simplified : XF(X!"(i45.u272.TrainState_49_3_17==0)" & ((!"(i19.u309.TrainState_36_1_25!=1)" M !"((i45.u272.TrainState_49_3_17!=1)&&(i19.u309.Tra...490
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
173 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.25089,46080,1,0,3086,1313,3459,2122,647,2562,12086
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-050-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BART-PT-050-LTLFireability-10 finished in 179319 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((F(p0) U X((p1||F(G(!p2)))))))'
Support contains 3 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 1598 places :
Symmetric choice reduction at 0 with 1598 rule applications. Total rules 1598 place count 5002 transition count 8502
Iterating global reduction 0 with 1598 rules applied. Total rules applied 3196 place count 5002 transition count 8502
Discarding 1348 places :
Symmetric choice reduction at 0 with 1348 rule applications. Total rules 4544 place count 3654 transition count 7154
Iterating global reduction 0 with 1348 rules applied. Total rules applied 5892 place count 3654 transition count 7154
Discarding 198 places :
Symmetric choice reduction at 0 with 198 rule applications. Total rules 6090 place count 3456 transition count 6956
Iterating global reduction 0 with 198 rules applied. Total rules applied 6288 place count 3456 transition count 6956
Discarding 148 places :
Symmetric choice reduction at 0 with 148 rule applications. Total rules 6436 place count 3308 transition count 6808
Iterating global reduction 0 with 148 rules applied. Total rules applied 6584 place count 3308 transition count 6808
Discarding 148 places :
Symmetric choice reduction at 0 with 148 rule applications. Total rules 6732 place count 3160 transition count 6660
Iterating global reduction 0 with 148 rules applied. Total rules applied 6880 place count 3160 transition count 6660
Discarding 148 places :
Symmetric choice reduction at 0 with 148 rule applications. Total rules 7028 place count 3012 transition count 6512
Iterating global reduction 0 with 148 rules applied. Total rules applied 7176 place count 3012 transition count 6512
Discarding 148 places :
Symmetric choice reduction at 0 with 148 rule applications. Total rules 7324 place count 2864 transition count 6364
Iterating global reduction 0 with 148 rules applied. Total rules applied 7472 place count 2864 transition count 6364
Discarding 148 places :
Symmetric choice reduction at 0 with 148 rule applications. Total rules 7620 place count 2716 transition count 6216
Iterating global reduction 0 with 148 rules applied. Total rules applied 7768 place count 2716 transition count 6216
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 7867 place count 2617 transition count 6117
Iterating global reduction 0 with 99 rules applied. Total rules applied 7966 place count 2617 transition count 6117
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 8065 place count 2518 transition count 6018
Iterating global reduction 0 with 99 rules applied. Total rules applied 8164 place count 2518 transition count 6018
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 8214 place count 2468 transition count 5968
Iterating global reduction 0 with 50 rules applied. Total rules applied 8264 place count 2468 transition count 5968
Applied a total of 8264 rules in 5173 ms. Remains 2468 /6600 variables (removed 4132) and now considering 5968/10100 (removed 4132) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15446737337298188282.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3452281029263410696.kers'
[2026-05-23 18:32:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15446737337298188282.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3452281029263410696.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 5968 rows 2468 cols 11936 entries
Finished phase 1 with 2418 SingleSign rule and 0 generalized
[2026-05-23 18:32:48] [INFO ] Computed 50 invariants in 23 ms
Computed 50 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-3452281029263410696.kers
Total runtime 32 ms.
[2026-05-23 18:32:49] [INFO ] Implicit Places using invariants in 609 ms returned []
[2026-05-23 18:32:49] [INFO ] Invariant cache hit.
[2026-05-23 18:32:52] [INFO ] Implicit Places using invariants and state equation in 3086 ms returned []
Implicit Place search using SMT with State Equation took 3700 ms to find 0 implicit places.
Running 4168 sub problems to find dead transitions.
[2026-05-23 18:32:52] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2418/8436 variables, and 0 constraints, problems are : Problem set: 0 solved, 4168 unsolved in 30118 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2468 constraints, PredecessorRefiner: 4168/4168 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4168 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2418/8436 variables, and 0 constraints, problems are : Problem set: 0 solved, 4168 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2468 constraints, PredecessorRefiner: 0/4168 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62594ms problems are : Problem set: 0 solved, 4168 unsolved
Search for dead transitions found 0 dead transitions in 62604ms
Starting structural reductions in LTL mode, iteration 1 : 2468/6600 places, 5968/10100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71496 ms. Remains : 2468/6600 places, 5968/10100 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U X((F(G(!p1))||p2)))))'
Stuttering acceptance computed with spot in 243 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1)]
Running random walk in product with property : BART-PT-050-LTLFireability-12
Product exploration explored 100000 steps with 28 reset in 1295 ms.
Product exploration explored 100000 steps with 24 reset in 1010 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 5 factoid took 125 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 8 to 6
RANDOM walk for 11100 steps (1 resets) in 173 ms. (63 steps per ms) remains 0/6 properties
Knowledge based reduction with 5 factoid took 213 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) (NOT p0) p1), (AND p1 (NOT p0))]
[2026-05-23 18:34:02] [INFO ] Invariant cache hit.
[2026-05-23 18:34:06] [INFO ] [Real]Absence check using 50 positive place invariants in 6 ms returned unsat
Proved EG (AND p1 (NOT p2)) asserting that LTL formula F !(AND p1 (NOT p2)) is false.
Negative knowledge disproves property using: (F (NOT (AND p1 (NOT p2))))
Knowledge-based reduction took 9183 ms.
FORMULA BART-PT-050-LTLFireability-12 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property BART-PT-050-LTLFireability-12 finished in 83291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 1600 places :
Symmetric choice reduction at 0 with 1600 rule applications. Total rules 1600 place count 5000 transition count 8500
Iterating global reduction 0 with 1600 rules applied. Total rules applied 3200 place count 5000 transition count 8500
Discarding 1349 places :
Symmetric choice reduction at 0 with 1349 rule applications. Total rules 4549 place count 3651 transition count 7151
Iterating global reduction 0 with 1349 rules applied. Total rules applied 5898 place count 3651 transition count 7151
Discarding 200 places :
Symmetric choice reduction at 0 with 200 rule applications. Total rules 6098 place count 3451 transition count 6951
Iterating global reduction 0 with 200 rules applied. Total rules applied 6298 place count 3451 transition count 6951
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6448 place count 3301 transition count 6801
Iterating global reduction 0 with 150 rules applied. Total rules applied 6598 place count 3301 transition count 6801
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6748 place count 3151 transition count 6651
Iterating global reduction 0 with 150 rules applied. Total rules applied 6898 place count 3151 transition count 6651
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7048 place count 3001 transition count 6501
Iterating global reduction 0 with 150 rules applied. Total rules applied 7198 place count 3001 transition count 6501
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7348 place count 2851 transition count 6351
Iterating global reduction 0 with 150 rules applied. Total rules applied 7498 place count 2851 transition count 6351
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7648 place count 2701 transition count 6201
Iterating global reduction 0 with 150 rules applied. Total rules applied 7798 place count 2701 transition count 6201
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 7898 place count 2601 transition count 6101
Iterating global reduction 0 with 100 rules applied. Total rules applied 7998 place count 2601 transition count 6101
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 8097 place count 2502 transition count 6002
Iterating global reduction 0 with 99 rules applied. Total rules applied 8196 place count 2502 transition count 6002
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 8246 place count 2452 transition count 5952
Iterating global reduction 0 with 50 rules applied. Total rules applied 8296 place count 2452 transition count 5952
Applied a total of 8296 rules in 4844 ms. Remains 2452 /6600 variables (removed 4148) and now considering 5952/10100 (removed 4148) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16695521856894545871.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7142238786439019653.kers'
[2026-05-23 18:34:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16695521856894545871.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7142238786439019653.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 5952 rows 2452 cols 11904 entries
Finished phase 1 with 2402 SingleSign rule and 0 generalized
[2026-05-23 18:34:11] [INFO ] Computed 50 invariants in 23 ms
Computed 50 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-7142238786439019653.kers
Total runtime 29 ms.
[2026-05-23 18:34:11] [INFO ] Implicit Places using invariants in 645 ms returned []
[2026-05-23 18:34:11] [INFO ] Invariant cache hit.
[2026-05-23 18:34:15] [INFO ] Implicit Places using invariants and state equation in 3038 ms returned []
Implicit Place search using SMT with State Equation took 3690 ms to find 0 implicit places.
Running 4152 sub problems to find dead transitions.
[2026-05-23 18:34:15] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2402/8404 variables, and 0 constraints, problems are : Problem set: 0 solved, 4152 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2452 constraints, PredecessorRefiner: 4152/4152 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4152 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2402/8404 variables, and 0 constraints, problems are : Problem set: 0 solved, 4152 unsolved in 30121 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2452 constraints, PredecessorRefiner: 0/4152 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62842ms problems are : Problem set: 0 solved, 4152 unsolved
Search for dead transitions found 0 dead transitions in 62849ms
Starting structural reductions in LTL mode, iteration 1 : 2452/6600 places, 5952/10100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71396 ms. Remains : 2452/6600 places, 5952/10100 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-050-LTLFireability-13
Entered a terminal (fully accepting) state of product in 74623 steps with 0 reset in 762 ms.
FORMULA BART-PT-050-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-050-LTLFireability-13 finished in 72337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(((X((X(p0)&&p1)) U p2)||p1) U p3)))'
Support contains 4 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 1598 places :
Symmetric choice reduction at 0 with 1598 rule applications. Total rules 1598 place count 5002 transition count 8502
Iterating global reduction 0 with 1598 rules applied. Total rules applied 3196 place count 5002 transition count 8502
Discarding 1348 places :
Symmetric choice reduction at 0 with 1348 rule applications. Total rules 4544 place count 3654 transition count 7154
Iterating global reduction 0 with 1348 rules applied. Total rules applied 5892 place count 3654 transition count 7154
Discarding 200 places :
Symmetric choice reduction at 0 with 200 rule applications. Total rules 6092 place count 3454 transition count 6954
Iterating global reduction 0 with 200 rules applied. Total rules applied 6292 place count 3454 transition count 6954
Discarding 148 places :
Symmetric choice reduction at 0 with 148 rule applications. Total rules 6440 place count 3306 transition count 6806
Iterating global reduction 0 with 148 rules applied. Total rules applied 6588 place count 3306 transition count 6806
Discarding 148 places :
Symmetric choice reduction at 0 with 148 rule applications. Total rules 6736 place count 3158 transition count 6658
Iterating global reduction 0 with 148 rules applied. Total rules applied 6884 place count 3158 transition count 6658
Discarding 148 places :
Symmetric choice reduction at 0 with 148 rule applications. Total rules 7032 place count 3010 transition count 6510
Iterating global reduction 0 with 148 rules applied. Total rules applied 7180 place count 3010 transition count 6510
Discarding 148 places :
Symmetric choice reduction at 0 with 148 rule applications. Total rules 7328 place count 2862 transition count 6362
Iterating global reduction 0 with 148 rules applied. Total rules applied 7476 place count 2862 transition count 6362
Discarding 148 places :
Symmetric choice reduction at 0 with 148 rule applications. Total rules 7624 place count 2714 transition count 6214
Iterating global reduction 0 with 148 rules applied. Total rules applied 7772 place count 2714 transition count 6214
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 7872 place count 2614 transition count 6114
Iterating global reduction 0 with 100 rules applied. Total rules applied 7972 place count 2614 transition count 6114
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 8070 place count 2516 transition count 6016
Iterating global reduction 0 with 98 rules applied. Total rules applied 8168 place count 2516 transition count 6016
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 8218 place count 2466 transition count 5966
Iterating global reduction 0 with 50 rules applied. Total rules applied 8268 place count 2466 transition count 5966
Applied a total of 8268 rules in 5208 ms. Remains 2466 /6600 variables (removed 4134) and now considering 5966/10100 (removed 4134) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15033793577223742066.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-739366951691388540.kers'
[2026-05-23 18:35:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15033793577223742066.kers, --Pflows, --basisKERS=/tmp/petrispot-output-739366951691388540.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 5966 rows 2466 cols 11932 entries
Finished phase 1 with 2416 SingleSign rule and 0 generalized
[2026-05-23 18:35:24] [INFO ] Computed 50 invariants in 40 ms
Computed 50 P flows in 41 ms.
Exported basis to /tmp/petrispot-output-739366951691388540.kers
Total runtime 53 ms.
[2026-05-23 18:35:24] [INFO ] Implicit Places using invariants in 684 ms returned []
[2026-05-23 18:35:24] [INFO ] Invariant cache hit.
[2026-05-23 18:35:28] [INFO ] Implicit Places using invariants and state equation in 3671 ms returned []
Implicit Place search using SMT with State Equation took 4376 ms to find 0 implicit places.
Running 4166 sub problems to find dead transitions.
[2026-05-23 18:35:28] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2416/8432 variables, and 0 constraints, problems are : Problem set: 0 solved, 4166 unsolved in 30127 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2466 constraints, PredecessorRefiner: 4166/4166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4166 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2416/8432 variables, and 0 constraints, problems are : Problem set: 0 solved, 4166 unsolved in 30080 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2466 constraints, PredecessorRefiner: 0/4166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62374ms problems are : Problem set: 0 solved, 4166 unsolved
Search for dead transitions found 0 dead transitions in 62381ms
Starting structural reductions in LTL mode, iteration 1 : 2466/6600 places, 5966/10100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71969 ms. Remains : 2466/6600 places, 5966/10100 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(((X((X(p0)&&p1)) U p2)||p1) U p3)))'
Stuttering acceptance computed with spot in 342 ms :[true, p0, p3, p3, (AND p0 p3 p1 p2), (AND p0 p3 p1 p2), (AND p0 p1 p2), (AND p0 p3)]
Running random walk in product with property : BART-PT-050-LTLFireability-14
Product exploration explored 100000 steps with 33333 reset in 8145 ms.
Product exploration explored 100000 steps with 33333 reset in 7483 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 15 factoid took 14 ms. Proved property starting from automaton with 8 states, 19 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 7072 ms.
FORMULA BART-PT-050-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-050-LTLFireability-14 finished in 95065 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(F(p0)))'
Support contains 1 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 1600 places :
Symmetric choice reduction at 0 with 1600 rule applications. Total rules 1600 place count 5000 transition count 8500
Iterating global reduction 0 with 1600 rules applied. Total rules applied 3200 place count 5000 transition count 8500
Discarding 1350 places :
Symmetric choice reduction at 0 with 1350 rule applications. Total rules 4550 place count 3650 transition count 7150
Iterating global reduction 0 with 1350 rules applied. Total rules applied 5900 place count 3650 transition count 7150
Discarding 200 places :
Symmetric choice reduction at 0 with 200 rule applications. Total rules 6100 place count 3450 transition count 6950
Iterating global reduction 0 with 200 rules applied. Total rules applied 6300 place count 3450 transition count 6950
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6450 place count 3300 transition count 6800
Iterating global reduction 0 with 150 rules applied. Total rules applied 6600 place count 3300 transition count 6800
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6750 place count 3150 transition count 6650
Iterating global reduction 0 with 150 rules applied. Total rules applied 6900 place count 3150 transition count 6650
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7050 place count 3000 transition count 6500
Iterating global reduction 0 with 150 rules applied. Total rules applied 7200 place count 3000 transition count 6500
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7350 place count 2850 transition count 6350
Iterating global reduction 0 with 150 rules applied. Total rules applied 7500 place count 2850 transition count 6350
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7650 place count 2700 transition count 6200
Iterating global reduction 0 with 150 rules applied. Total rules applied 7800 place count 2700 transition count 6200
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 7900 place count 2600 transition count 6100
Iterating global reduction 0 with 100 rules applied. Total rules applied 8000 place count 2600 transition count 6100
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 8100 place count 2500 transition count 6000
Iterating global reduction 0 with 100 rules applied. Total rules applied 8200 place count 2500 transition count 6000
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 8250 place count 2450 transition count 5950
Iterating global reduction 0 with 50 rules applied. Total rules applied 8300 place count 2450 transition count 5950
Applied a total of 8300 rules in 4803 ms. Remains 2450 /6600 variables (removed 4150) and now considering 5950/10100 (removed 4150) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7767242433775117952.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17814367618064130120.kers'
[2026-05-23 18:36:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7767242433775117952.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17814367618064130120.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 5950 rows 2450 cols 11900 entries
Finished phase 1 with 2400 SingleSign rule and 0 generalized
[2026-05-23 18:36:58] [INFO ] Computed 50 invariants in 25 ms
Computed 50 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-17814367618064130120.kers
Total runtime 36 ms.
[2026-05-23 18:36:59] [INFO ] Implicit Places using invariants in 794 ms returned []
[2026-05-23 18:36:59] [INFO ] Invariant cache hit.
[2026-05-23 18:37:02] [INFO ] Implicit Places using invariants and state equation in 3342 ms returned []
Implicit Place search using SMT with State Equation took 4172 ms to find 0 implicit places.
Running 4150 sub problems to find dead transitions.
[2026-05-23 18:37:02] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2400/8400 variables, and 0 constraints, problems are : Problem set: 0 solved, 4150 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2450 constraints, PredecessorRefiner: 4150/4150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2400/8400 variables, and 0 constraints, problems are : Problem set: 0 solved, 4150 unsolved in 30093 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2450 constraints, PredecessorRefiner: 0/4150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62514ms problems are : Problem set: 0 solved, 4150 unsolved
Search for dead transitions found 0 dead transitions in 62522ms
Starting structural reductions in LTL mode, iteration 1 : 2450/6600 places, 5950/10100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71502 ms. Remains : 2450/6600 places, 5950/10100 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-050-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 6232 ms.
Product exploration explored 100000 steps with 50000 reset in 6089 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 19 ms. Proved property starting from automaton with 2 states, 2 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 3376 ms.
FORMULA BART-PT-050-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-050-LTLFireability-15 finished in 87371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U (G(F(!p2))||p1)))'
Spot run failed in 90 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-23 18:38:21] [INFO ] Flatten gal took : 150 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1855425747334432892
[2026-05-23 18:38:21] [INFO ] Too many transitions (10100) to apply POR reductions. Disabling POR matrices.
[2026-05-23 18:38:21] [INFO ] Built C files in 141ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1855425747334432892
Running compilation step : cd /tmp/ltsmin1855425747334432892;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-23 18:38:21] [INFO ] Applying decomposition
[2026-05-23 18:38:21] [INFO ] Flatten gal took : 157 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3043139758906087162.txt' '-o' '/tmp/graph3043139758906087162.bin' '-w' '/tmp/graph3043139758906087162.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3043139758906087162.bin' '-l' '-1' '-v' '-w' '/tmp/graph3043139758906087162.weights' '-q' '0' '-e' '0.001'
[2026-05-23 18:38:22] [INFO ] Decomposing Gal with order
[2026-05-23 18:38:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 18:38:26] [INFO ] Removed a total of 1021 redundant transitions.
[2026-05-23 18:38:26] [INFO ] Flatten gal took : 357 ms
[2026-05-23 18:38:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2026-05-23 18:38:30] [INFO ] Time to serialize gal into /tmp/LTLFireability5966269377392407775.gal : 62 ms
[2026-05-23 18:38:30] [INFO ] Time to serialize properties into /tmp/LTLFireability2011316189831633979.ltl : 18 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5966269377392407775.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2011316189831633979.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F(G("((((((((((i19.i2.u870.TrainState_46_4_14==1)||(i26.i0.u819.TrainState_6_4_13==1))||((i38.i3.u861.TrainState_3_4_14==1)||(i23....190860
Formula 0 simplified : GF!"((((((((((i19.i2.u870.TrainState_46_4_14==1)||(i26.i0.u819.TrainState_6_4_13==1))||((i38.i3.u861.TrainState_3_4_14==1)||(i23.i2....190839
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
4736 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,48.8962,725644,1,0,1.20175e+06,14753,58654,3.29768e+06,3038,40420,1345707
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-050-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2360746 ms.

BK_STOP 1779561564913

--------------------
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="BART-PT-050"
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 BART-PT-050, 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 r018-smll-177946788100276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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