Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r015-oct2-177944372400039.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-5973
Executing tool gold2025
Input is ASLink-PT-02b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r015-oct2-177944372400039
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 8.1K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 5 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 417K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779685502784

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-25 05:05:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 05:05:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 05:05:04] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2026-05-25 05:05:04] [INFO ] Transformed 1242 places.
[2026-05-25 05:05:04] [INFO ] Transformed 1621 transitions.
[2026-05-25 05:05:04] [INFO ] Found NUPN structural information;
[2026-05-25 05:05:05] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 323 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1621 rows 1242 cols
[2026-05-25 05:05:05] [INFO ] Computed 121 invariants in 108 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (34 resets) in 77 ms. (128 steps per ms)
FORMULA ASLink-PT-02b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50002 steps (40 resets) in 75 ms. (657 steps per ms)
FORMULA ASLink-PT-02b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-05-25 05:05:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:05] [INFO ] [Real]Absence check using 27 positive place invariants in 27 ms returned sat
[2026-05-25 05:05:06] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 79 ms returned sat
[2026-05-25 05:05:06] [INFO ] [Real]Absence check using state equation in 887 ms returned sat
[2026-05-25 05:05:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:07] [INFO ] [Nat]Absence check using 27 positive place invariants in 58 ms returned sat
[2026-05-25 05:05:07] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 104 ms returned sat
[2026-05-25 05:05:08] [INFO ] [Nat]Absence check using state equation in 1185 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:09] [INFO ] Deduced a trap composed of 70 places in 473 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:10] [INFO ] Deduced a trap composed of 71 places in 522 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:10] [INFO ] Deduced a trap composed of 72 places in 496 ms of which 60 ms to minimize.
[2026-05-25 05:05:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1860 ms
[2026-05-25 05:05:11] [INFO ] Computed and/alt/rep : 1337/2984/1337 causal constraints (skipped 283 transitions) in 198 ms.
[2026-05-25 05:05:12] [INFO ] Added : 35 causal constraints over 7 iterations in 1236 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:12] [INFO ] [Real]Absence check using 27 positive place invariants in 23 ms returned sat
[2026-05-25 05:05:12] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 71 ms returned sat
[2026-05-25 05:05:13] [INFO ] [Real]Absence check using state equation in 1265 ms returned sat
[2026-05-25 05:05:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:14] [INFO ] [Nat]Absence check using 27 positive place invariants in 24 ms returned sat
[2026-05-25 05:05:14] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 108 ms returned sat
[2026-05-25 05:05:14] [INFO ] [Nat]Absence check using state equation in 712 ms returned sat
[2026-05-25 05:05:15] [INFO ] Computed and/alt/rep : 1337/2984/1337 causal constraints (skipped 283 transitions) in 105 ms.
[2026-05-25 05:05:18] [INFO ] Added : 115 causal constraints over 23 iterations in 3857 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:19] [INFO ] [Real]Absence check using 27 positive place invariants in 25 ms returned sat
[2026-05-25 05:05:19] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 209 ms returned sat
[2026-05-25 05:05:20] [INFO ] [Real]Absence check using state equation in 877 ms returned sat
[2026-05-25 05:05:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:20] [INFO ] [Nat]Absence check using 27 positive place invariants in 120 ms returned sat
[2026-05-25 05:05:21] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 379 ms returned sat
[2026-05-25 05:05:22] [INFO ] [Nat]Absence check using state equation in 1034 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:22] [INFO ] Deduced a trap composed of 50 places in 178 ms of which 21 ms to minimize.
[2026-05-25 05:05:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 314 ms
[2026-05-25 05:05:22] [INFO ] Computed and/alt/rep : 1337/2984/1337 causal constraints (skipped 283 transitions) in 162 ms.
[2026-05-25 05:05:25] [INFO ] Added : 105 causal constraints over 21 iterations in 2720 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:25] [INFO ] [Real]Absence check using 27 positive place invariants in 20 ms returned sat
[2026-05-25 05:05:25] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 57 ms returned sat
[2026-05-25 05:05:26] [INFO ] [Real]Absence check using state equation in 1048 ms returned sat
[2026-05-25 05:05:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:27] [INFO ] [Nat]Absence check using 27 positive place invariants in 25 ms returned sat
[2026-05-25 05:05:27] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 62 ms returned sat
[2026-05-25 05:05:28] [INFO ] [Nat]Absence check using state equation in 1029 ms returned sat
[2026-05-25 05:05:28] [INFO ] Computed and/alt/rep : 1337/2984/1337 causal constraints (skipped 283 transitions) in 126 ms.
Maximisation of solution failed !
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA ASLink-PT-02b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1242 transition count 1341
Reduce places removed 280 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 294 rules applied. Total rules applied 574 place count 962 transition count 1327
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 579 place count 958 transition count 1326
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 580 place count 957 transition count 1326
Performed 282 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 282 Pre rules applied. Total rules applied 580 place count 957 transition count 1044
Deduced a syphon composed of 282 places in 3 ms
Ensure Unique test removed 23 places
Reduce places removed 305 places and 0 transitions.
Iterating global reduction 4 with 587 rules applied. Total rules applied 1167 place count 652 transition count 1044
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 4 with 18 rules applied. Total rules applied 1185 place count 650 transition count 1028
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 1201 place count 634 transition count 1028
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 1201 place count 634 transition count 1020
Deduced a syphon composed of 8 places in 4 ms
Ensure Unique test removed 7 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 23 rules applied. Total rules applied 1224 place count 619 transition count 1020
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 7 Pre rules applied. Total rules applied 1224 place count 619 transition count 1013
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 1238 place count 612 transition count 1013
Discarding 38 places :
Symmetric choice reduction at 6 with 38 rule applications. Total rules 1276 place count 574 transition count 975
Iterating global reduction 6 with 38 rules applied. Total rules applied 1314 place count 574 transition count 975
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1315 place count 574 transition count 974
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 14 Pre rules applied. Total rules applied 1315 place count 574 transition count 960
Deduced a syphon composed of 14 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 29 rules applied. Total rules applied 1344 place count 559 transition count 960
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1344 place count 559 transition count 959
Deduced a syphon composed of 1 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 1347 place count 557 transition count 959
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1350 place count 554 transition count 938
Iterating global reduction 7 with 3 rules applied. Total rules applied 1353 place count 554 transition count 938
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 1353 place count 554 transition count 936
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1357 place count 552 transition count 936
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1358 place count 551 transition count 928
Iterating global reduction 7 with 1 rules applied. Total rules applied 1359 place count 551 transition count 928
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1360 place count 550 transition count 920
Iterating global reduction 7 with 1 rules applied. Total rules applied 1361 place count 550 transition count 920
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1362 place count 549 transition count 912
Iterating global reduction 7 with 1 rules applied. Total rules applied 1363 place count 549 transition count 912
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1364 place count 548 transition count 904
Iterating global reduction 7 with 1 rules applied. Total rules applied 1365 place count 548 transition count 904
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1366 place count 547 transition count 896
Iterating global reduction 7 with 1 rules applied. Total rules applied 1367 place count 547 transition count 896
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1368 place count 546 transition count 888
Iterating global reduction 7 with 1 rules applied. Total rules applied 1369 place count 546 transition count 888
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1370 place count 545 transition count 880
Iterating global reduction 7 with 1 rules applied. Total rules applied 1371 place count 545 transition count 880
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1372 place count 544 transition count 872
Iterating global reduction 7 with 1 rules applied. Total rules applied 1373 place count 544 transition count 872
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1374 place count 543 transition count 864
Iterating global reduction 7 with 1 rules applied. Total rules applied 1375 place count 543 transition count 864
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1376 place count 542 transition count 856
Iterating global reduction 7 with 1 rules applied. Total rules applied 1377 place count 542 transition count 856
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1378 place count 541 transition count 848
Iterating global reduction 7 with 1 rules applied. Total rules applied 1379 place count 541 transition count 848
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1380 place count 540 transition count 840
Iterating global reduction 7 with 1 rules applied. Total rules applied 1381 place count 540 transition count 840
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1382 place count 539 transition count 832
Iterating global reduction 7 with 1 rules applied. Total rules applied 1383 place count 539 transition count 832
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1384 place count 538 transition count 824
Iterating global reduction 7 with 1 rules applied. Total rules applied 1385 place count 538 transition count 824
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1386 place count 537 transition count 816
Iterating global reduction 7 with 1 rules applied. Total rules applied 1387 place count 537 transition count 816
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1388 place count 536 transition count 808
Iterating global reduction 7 with 1 rules applied. Total rules applied 1389 place count 536 transition count 808
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 7 with 134 rules applied. Total rules applied 1523 place count 469 transition count 741
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1524 place count 468 transition count 740
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 1526 place count 467 transition count 740
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1527 place count 466 transition count 739
Iterating global reduction 7 with 1 rules applied. Total rules applied 1528 place count 466 transition count 739
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 7 with 2 rules applied. Total rules applied 1530 place count 466 transition count 737
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1531 place count 465 transition count 737
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 1533 place count 464 transition count 746
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 1536 place count 464 transition count 743
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1539 place count 461 transition count 743
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1540 place count 461 transition count 742
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1541 place count 460 transition count 742
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1542 place count 459 transition count 741
Reduce places removed 4 places and 0 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 11 with 6 rules applied. Total rules applied 1548 place count 455 transition count 739
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1550 place count 453 transition count 739
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 6 Pre rules applied. Total rules applied 1550 place count 453 transition count 733
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 13 with 13 rules applied. Total rules applied 1563 place count 446 transition count 733
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 13 with 3 rules applied. Total rules applied 1566 place count 443 transition count 733
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 1566 place count 443 transition count 732
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1568 place count 442 transition count 732
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 14 with 10 rules applied. Total rules applied 1578 place count 437 transition count 727
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1580 place count 435 transition count 725
Iterating global reduction 14 with 2 rules applied. Total rules applied 1582 place count 435 transition count 725
Free-agglomeration rule applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1584 place count 435 transition count 723
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1586 place count 433 transition count 723
Applied a total of 1586 rules in 709 ms. Remains 433 /1242 variables (removed 809) and now considering 723/1621 (removed 898) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 719 ms. Remains : 433/1242 places, 723/1621 transitions.
// Phase 1: matrix 723 rows 433 cols
[2026-05-25 05:05:35] [INFO ] Computed 78 invariants in 34 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (15979 resets) in 1939 ms. (515 steps per ms)
FORMULA ASLink-PT-02b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000002 steps (11173 resets) in 2024 ms. (987 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-25 05:05:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:39] [INFO ] [Real]Absence check using 19 positive place invariants in 21 ms returned sat
[2026-05-25 05:05:39] [INFO ] [Real]Absence check using 19 positive and 59 generalized place invariants in 21 ms returned sat
[2026-05-25 05:05:39] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:39] [INFO ] Deduced a trap composed of 73 places in 265 ms of which 43 ms to minimize.
[2026-05-25 05:05:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:40] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2026-05-25 05:05:40] [INFO ] [Nat]Absence check using 19 positive and 59 generalized place invariants in 16 ms returned sat
[2026-05-25 05:05:40] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2026-05-25 05:05:40] [INFO ] Computed and/alt/rep : 275/1073/275 causal constraints (skipped 431 transitions) in 62 ms.
[2026-05-25 05:05:42] [INFO ] Added : 138 causal constraints over 28 iterations in 1931 ms. Result :sat
Minimization took 452 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:42] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2026-05-25 05:05:42] [INFO ] [Real]Absence check using 19 positive and 59 generalized place invariants in 20 ms returned sat
[2026-05-25 05:05:43] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2026-05-25 05:05:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:43] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2026-05-25 05:05:43] [INFO ] [Nat]Absence check using 19 positive and 59 generalized place invariants in 19 ms returned sat
[2026-05-25 05:05:43] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2026-05-25 05:05:43] [INFO ] Computed and/alt/rep : 275/1073/275 causal constraints (skipped 431 transitions) in 46 ms.
[2026-05-25 05:05:45] [INFO ] Added : 117 causal constraints over 24 iterations in 2268 ms. Result :sat
Minimization took 491 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 723/723 transitions.
Applied a total of 0 rules in 18 ms. Remains 433 /433 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 433/433 places, 723/723 transitions.
[2026-05-25 05:05:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (16298 resets) in 1888 ms. (529 steps per ms)
BEST_FIRST walk for 2000002 steps (11092 resets) in 1940 ms. (1030 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-25 05:05:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:50] [INFO ] [Real]Absence check using 19 positive place invariants in 22 ms returned sat
[2026-05-25 05:05:50] [INFO ] [Real]Absence check using 19 positive and 59 generalized place invariants in 27 ms returned sat
[2026-05-25 05:05:51] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:51] [INFO ] Deduced a trap composed of 73 places in 278 ms of which 43 ms to minimize.
[2026-05-25 05:05:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:51] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2026-05-25 05:05:51] [INFO ] [Nat]Absence check using 19 positive and 59 generalized place invariants in 14 ms returned sat
[2026-05-25 05:05:51] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2026-05-25 05:05:52] [INFO ] Computed and/alt/rep : 275/1073/275 causal constraints (skipped 431 transitions) in 74 ms.
[2026-05-25 05:05:53] [INFO ] Added : 138 causal constraints over 28 iterations in 1855 ms. Result :sat
Minimization took 440 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:54] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2026-05-25 05:05:54] [INFO ] [Real]Absence check using 19 positive and 59 generalized place invariants in 19 ms returned sat
[2026-05-25 05:05:54] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2026-05-25 05:05:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:54] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2026-05-25 05:05:54] [INFO ] [Nat]Absence check using 19 positive and 59 generalized place invariants in 29 ms returned sat
[2026-05-25 05:05:55] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2026-05-25 05:05:55] [INFO ] Computed and/alt/rep : 275/1073/275 causal constraints (skipped 431 transitions) in 60 ms.
[2026-05-25 05:05:57] [INFO ] Added : 117 causal constraints over 24 iterations in 2370 ms. Result :sat
Minimization took 416 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 723/723 transitions.
Applied a total of 0 rules in 14 ms. Remains 433 /433 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 433/433 places, 723/723 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 723/723 transitions.
Applied a total of 0 rules in 11 ms. Remains 433 /433 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2026-05-25 05:05:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:05:59] [INFO ] Implicit Places using invariants in 739 ms returned [1, 18, 19, 32, 49, 67, 102, 139, 143, 152, 153, 155, 172, 190, 259, 263, 264, 267, 278, 279, 280, 298, 300, 304, 322, 323, 324, 325, 337, 343, 349, 355, 361, 367, 373, 379, 385, 391, 397]
[2026-05-25 05:05:59] [INFO ] Actually due to overlaps returned [298, 280, 49, 172, 304, 32, 155, 152, 278, 322, 153, 279, 300, 323, 1, 18, 263, 264, 67, 190, 324, 367, 385, 397, 19, 267, 325, 337, 343, 349, 355, 361, 373, 379, 391]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 762 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 398/433 places, 723/723 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 395 transition count 661
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 333 transition count 658
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 131 place count 332 transition count 658
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 131 place count 332 transition count 643
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 31 rules applied. Total rules applied 162 place count 316 transition count 643
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 174 place count 312 transition count 635
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 182 place count 304 transition count 635
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 197 place count 289 transition count 620
Iterating global reduction 5 with 15 rules applied. Total rules applied 212 place count 289 transition count 620
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 215 place count 289 transition count 617
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 215 place count 289 transition count 616
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 217 place count 288 transition count 616
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 220 place count 285 transition count 610
Iterating global reduction 6 with 3 rules applied. Total rules applied 223 place count 285 transition count 610
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 224 place count 284 transition count 609
Iterating global reduction 6 with 1 rules applied. Total rules applied 225 place count 284 transition count 609
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 226 place count 283 transition count 607
Iterating global reduction 6 with 1 rules applied. Total rules applied 227 place count 283 transition count 607
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 269 place count 262 transition count 586
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 271 place count 260 transition count 584
Iterating global reduction 6 with 2 rules applied. Total rules applied 273 place count 260 transition count 584
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 275 place count 260 transition count 582
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 279 place count 258 transition count 583
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 284 place count 258 transition count 578
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 290 place count 252 transition count 578
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 296 place count 252 transition count 578
Applied a total of 296 rules in 105 ms. Remains 252 /398 variables (removed 146) and now considering 578/723 (removed 145) transitions.
// Phase 1: matrix 578 rows 252 cols
[2026-05-25 05:05:59] [INFO ] Computed 34 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:05:59] [INFO ] Implicit Places using invariants in 256 ms returned [73, 92, 98, 101, 103, 104, 107, 108, 160, 177, 183, 186, 188]
[2026-05-25 05:05:59] [INFO ] Actually due to overlaps returned [107, 108, 92, 98, 103, 177, 183, 188, 73, 104, 160]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 259 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 241/433 places, 578/723 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 233 transition count 570
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 233 transition count 570
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 231 transition count 568
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 231 transition count 568
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 28 place count 227 transition count 564
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 227 transition count 558
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 221 transition count 558
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 221 transition count 556
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 219 transition count 556
Applied a total of 44 rules in 97 ms. Remains 219 /241 variables (removed 22) and now considering 556/578 (removed 22) transitions.
// Phase 1: matrix 556 rows 219 cols
[2026-05-25 05:05:59] [INFO ] Computed 23 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:06:00] [INFO ] Implicit Places using invariants in 440 ms returned []
[2026-05-25 05:06:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:06:00] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 1050 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 219/433 places, 556/723 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2292 ms. Remains : 219/433 places, 556/723 transitions.
[2026-05-25 05:06:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (25324 resets) in 1558 ms. (641 steps per ms)
BEST_FIRST walk for 2000002 steps (19240 resets) in 1504 ms. (1328 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-25 05:06:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:06:03] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-25 05:06:03] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 4 ms returned sat
[2026-05-25 05:06:04] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2026-05-25 05:06:04] [INFO ] Computed and/alt/rep : 98/568/98 causal constraints (skipped 441 transitions) in 32 ms.
[2026-05-25 05:06:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:06:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 52 ms returned sat
[2026-05-25 05:06:04] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 79 ms returned sat
[2026-05-25 05:06:04] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2026-05-25 05:06:04] [INFO ] Computed and/alt/rep : 98/568/98 causal constraints (skipped 441 transitions) in 31 ms.
[2026-05-25 05:06:04] [INFO ] Added : 14 causal constraints over 3 iterations in 186 ms. Result :sat
Minimization took 249 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:06:05] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-25 05:06:05] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 7 ms returned sat
[2026-05-25 05:06:05] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2026-05-25 05:06:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:06:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-25 05:06:05] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 6 ms returned sat
[2026-05-25 05:06:05] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2026-05-25 05:06:05] [INFO ] Computed and/alt/rep : 98/568/98 causal constraints (skipped 441 transitions) in 55 ms.
[2026-05-25 05:06:06] [INFO ] Added : 11 causal constraints over 3 iterations in 270 ms. Result :sat
Minimization took 209 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 556/556 transitions.
Applied a total of 0 rules in 8 ms. Remains 219 /219 variables (removed 0) and now considering 556/556 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 219/219 places, 556/556 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 556/556 transitions.
Applied a total of 0 rules in 7 ms. Remains 219 /219 variables (removed 0) and now considering 556/556 (removed 0) transitions.
[2026-05-25 05:06:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:06:06] [INFO ] Implicit Places using invariants in 239 ms returned []
[2026-05-25 05:06:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:06:07] [INFO ] Implicit Places using invariants and state equation in 805 ms returned []
Implicit Place search using SMT with State Equation took 1048 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 05:06:07] [INFO ] Redundant transitions in 45 ms returned []
Running 539 sub problems to find dead transitions.
[2026-05-25 05:06:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 3 (OVERLAPS) 1/219 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 539 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:06:25] [INFO ] Deduced a trap composed of 13 places in 378 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:06:28] [INFO ] Deduced a trap composed of 54 places in 296 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:06:28] [INFO ] Deduced a trap composed of 61 places in 297 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:06:30] [INFO ] Deduced a trap composed of 73 places in 225 ms of which 40 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 539 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 219/775 variables, and 27 constraints, problems are : Problem set: 0 solved, 539 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/219 constraints, PredecessorRefiner: 539/539 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 539 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 3 (OVERLAPS) 1/219 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 539 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
At refinement iteration 7 (OVERLAPS) 556/775 variables, 219/246 constraints. Problems are: Problem set: 146 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 775/775 variables, and 639 constraints, problems are : Problem set: 146 solved, 393 unsolved in 30224 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 393/539 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60536ms problems are : Problem set: 146 solved, 393 unsolved
Search for dead transitions found 146 dead transitions in 60550ms
Found 146 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 146 transitions
Dead transitions reduction (with SMT) removed 146 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 219/219 places, 410/556 transitions.
Applied a total of 0 rules in 7 ms. Remains 219 /219 variables (removed 0) and now considering 410/410 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 05:07:08] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61704 ms. Remains : 219/219 places, 410/556 transitions.
// Phase 1: matrix 410 rows 219 cols
[2026-05-25 05:07:08] [INFO ] Computed 23 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (25463 resets) in 1239 ms. (806 steps per ms)
BEST_FIRST walk for 2000001 steps (19304 resets) in 1445 ms. (1383 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-25 05:07:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:07:10] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-25 05:07:11] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 5 ms returned sat
[2026-05-25 05:07:11] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2026-05-25 05:07:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:07:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-25 05:07:11] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 4 ms returned sat
[2026-05-25 05:07:11] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2026-05-25 05:07:11] [INFO ] Computed and/alt/rep : 244/1082/244 causal constraints (skipped 149 transitions) in 27 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:12] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 4 ms to minimize.
[2026-05-25 05:07:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2026-05-25 05:07:12] [INFO ] Added : 90 causal constraints over 18 iterations in 919 ms. Result :sat
Minimization took 237 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:07:12] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2026-05-25 05:07:12] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 24 ms returned sat
[2026-05-25 05:07:12] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2026-05-25 05:07:12] [INFO ] Computed and/alt/rep : 244/1082/244 causal constraints (skipped 149 transitions) in 36 ms.
[2026-05-25 05:07:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:07:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2026-05-25 05:07:13] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 8 ms returned sat
[2026-05-25 05:07:13] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2026-05-25 05:07:13] [INFO ] Computed and/alt/rep : 244/1082/244 causal constraints (skipped 149 transitions) in 49 ms.
[2026-05-25 05:07:14] [INFO ] Added : 138 causal constraints over 29 iterations in 1311 ms. Result :sat
Minimization took 334 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 410/410 transitions.
Applied a total of 0 rules in 6 ms. Remains 219 /219 variables (removed 0) and now considering 410/410 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 219/219 places, 410/410 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 410/410 transitions.
Applied a total of 0 rules in 5 ms. Remains 219 /219 variables (removed 0) and now considering 410/410 (removed 0) transitions.
[2026-05-25 05:07:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:07:15] [INFO ] Implicit Places using invariants in 254 ms returned []
[2026-05-25 05:07:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:07:15] [INFO ] Implicit Places using invariants and state equation in 632 ms returned [58, 94, 96, 98, 100, 102, 104, 106]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 887 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 211/219 places, 410/410 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 205 transition count 362
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 205 transition count 362
Applied a total of 12 rules in 8 ms. Remains 205 /211 variables (removed 6) and now considering 362/410 (removed 48) transitions.
// Phase 1: matrix 362 rows 205 cols
[2026-05-25 05:07:15] [INFO ] Computed 21 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:07:16] [INFO ] Implicit Places using invariants in 318 ms returned []
[2026-05-25 05:07:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:07:16] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 205/219 places, 362/410 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1725 ms. Remains : 205/219 places, 362/410 transitions.
[2026-05-25 05:07:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (25276 resets) in 1427 ms. (700 steps per ms)
BEST_FIRST walk for 2000002 steps (19221 resets) in 1270 ms. (1573 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-25 05:07:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:07:19] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-25 05:07:19] [INFO ] [Real]Absence check using 8 positive and 13 generalized place invariants in 4 ms returned sat
[2026-05-25 05:07:19] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2026-05-25 05:07:19] [INFO ] Computed and/alt/rep : 203/873/203 causal constraints (skipped 142 transitions) in 31 ms.
[2026-05-25 05:07:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:07:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-25 05:07:20] [INFO ] [Nat]Absence check using 8 positive and 13 generalized place invariants in 4 ms returned sat
[2026-05-25 05:07:20] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2026-05-25 05:07:20] [INFO ] Computed and/alt/rep : 203/873/203 causal constraints (skipped 142 transitions) in 35 ms.
[2026-05-25 05:07:20] [INFO ] Added : 87 causal constraints over 19 iterations in 585 ms. Result :sat
Minimization took 231 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:07:21] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-25 05:07:21] [INFO ] [Real]Absence check using 8 positive and 13 generalized place invariants in 6 ms returned sat
[2026-05-25 05:07:21] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2026-05-25 05:07:21] [INFO ] Computed and/alt/rep : 203/873/203 causal constraints (skipped 142 transitions) in 37 ms.
[2026-05-25 05:07:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:07:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-25 05:07:21] [INFO ] [Nat]Absence check using 8 positive and 13 generalized place invariants in 17 ms returned sat
[2026-05-25 05:07:21] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2026-05-25 05:07:21] [INFO ] Computed and/alt/rep : 203/873/203 causal constraints (skipped 142 transitions) in 25 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:22] [INFO ] Deduced a trap composed of 28 places in 386 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:22] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 16 ms to minimize.
[2026-05-25 05:07:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 667 ms
[2026-05-25 05:07:23] [INFO ] Added : 100 causal constraints over 23 iterations in 1513 ms. Result :sat
Minimization took 293 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 362/362 transitions.
Applied a total of 0 rules in 6 ms. Remains 205 /205 variables (removed 0) and now considering 362/362 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 205/205 places, 362/362 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 362/362 transitions.
Applied a total of 0 rules in 4 ms. Remains 205 /205 variables (removed 0) and now considering 362/362 (removed 0) transitions.
[2026-05-25 05:07:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:07:23] [INFO ] Implicit Places using invariants in 185 ms returned []
[2026-05-25 05:07:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:07:26] [INFO ] Implicit Places using invariants and state equation in 2692 ms returned []
Implicit Place search using SMT with State Equation took 2881 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 05:07:26] [INFO ] Redundant transitions in 7 ms returned []
Running 345 sub problems to find dead transitions.
[2026-05-25 05:07:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 345 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:28] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 10 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:29] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 12 ms to minimize.
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:29] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 32 ms to minimize.
Problem TDEAD110 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:29] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 12 ms to minimize.
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:30] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 11 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:30] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 12 ms to minimize.
Problem TDEAD132 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:30] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 14 ms to minimize.
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:30] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 11 ms to minimize.
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:30] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 11 ms to minimize.
Problem TDEAD148 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:30] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 20 ms to minimize.
Problem TDEAD192 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:31] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 9 ms to minimize.
Problem TDEAD195 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:31] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 18 ms to minimize.
Problem TDEAD203 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:31] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 6 ms to minimize.
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:32] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:32] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 5 ms to minimize.
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 15/33 constraints. Problems are: Problem set: 56 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 56 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 1/205 variables, 3/36 constraints. Problems are: Problem set: 56 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:38] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:39] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 9 ms to minimize.
Problem TDEAD162 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 2/38 constraints. Problems are: Problem set: 63 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/38 constraints. Problems are: Problem set: 63 solved, 282 unsolved
Problem TDEAD62 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 7 (OVERLAPS) 362/567 variables, 205/243 constraints. Problems are: Problem set: 103 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:47] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 11 ms to minimize.
Problem TDEAD61 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:47] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:47] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 9 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD71 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:48] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 27 ms to minimize.
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 4/247 constraints. Problems are: Problem set: 112 solved, 233 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:52] [INFO ] Deduced a trap composed of 19 places in 976 ms of which 10 ms to minimize.
Problem TDEAD69 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 1/248 constraints. Problems are: Problem set: 113 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 567/567 variables, and 248 constraints, problems are : Problem set: 113 solved, 232 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 113 solved, 232 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 5/5 constraints. Problems are: Problem set: 113 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 13/18 constraints. Problems are: Problem set: 113 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/38 constraints. Problems are: Problem set: 113 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/38 constraints. Problems are: Problem set: 113 solved, 232 unsolved
At refinement iteration 4 (OVERLAPS) 1/205 variables, 3/41 constraints. Problems are: Problem set: 113 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 2/43 constraints. Problems are: Problem set: 113 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/43 constraints. Problems are: Problem set: 113 solved, 232 unsolved
Problem TDEAD106 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD354 is UNSAT
At refinement iteration 7 (OVERLAPS) 362/567 variables, 205/248 constraints. Problems are: Problem set: 129 solved, 216 unsolved
Problem TDEAD86 is UNSAT
Problem TDEAD160 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 216/464 constraints. Problems are: Problem set: 131 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:08:14] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:08:15] [INFO ] Deduced a trap composed of 34 places in 213 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:08:15] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 19 ms to minimize.
Problem TDEAD193 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:08:15] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 10 ms to minimize.
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 4/468 constraints. Problems are: Problem set: 135 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/567 variables, and 468 constraints, problems are : Problem set: 135 solved, 210 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 216/345 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60150ms problems are : Problem set: 135 solved, 210 unsolved
Search for dead transitions found 135 dead transitions in 60157ms
Found 135 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 135 transitions
Dead transitions reduction (with SMT) removed 135 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 205/205 places, 227/362 transitions.
Ensure Unique test removed 18 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 183 transition count 201
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 74 place count 157 transition count 201
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 74 place count 157 transition count 197
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 82 place count 153 transition count 197
Applied a total of 82 rules in 19 ms. Remains 153 /205 variables (removed 52) and now considering 197/227 (removed 30) transitions.
// Phase 1: matrix 197 rows 153 cols
[2026-05-25 05:08:26] [INFO ] Computed 22 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:08:26] [INFO ] Implicit Places using invariants in 225 ms returned [7, 64]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 229 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 151/205 places, 197/362 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 151 transition count 190
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 144 transition count 190
Applied a total of 14 rules in 5 ms. Remains 144 /151 variables (removed 7) and now considering 190/197 (removed 7) transitions.
// Phase 1: matrix 190 rows 144 cols
[2026-05-25 05:08:26] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:08:27] [INFO ] Implicit Places using invariants in 142 ms returned []
[2026-05-25 05:08:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:08:27] [INFO ] Implicit Places using invariants and state equation in 196 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 352 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 143/205 places, 190/362 transitions.
Applied a total of 0 rules in 3 ms. Remains 143 /143 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 63670 ms. Remains : 143/205 places, 190/362 transitions.
// Phase 1: matrix 190 rows 143 cols
[2026-05-25 05:08:27] [INFO ] Computed 19 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (32965 resets) in 1261 ms. (792 steps per ms)
BEST_FIRST walk for 2000002 steps (21086 resets) in 1199 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-25 05:08:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:08:29] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-25 05:08:29] [INFO ] [Real]Absence check using 8 positive and 11 generalized place invariants in 5 ms returned sat
[2026-05-25 05:08:29] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2026-05-25 05:08:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:08:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-25 05:08:30] [INFO ] [Nat]Absence check using 8 positive and 11 generalized place invariants in 7 ms returned sat
[2026-05-25 05:08:30] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2026-05-25 05:08:30] [INFO ] Computed and/alt/rep : 93/305/93 causal constraints (skipped 80 transitions) in 19 ms.
[2026-05-25 05:08:30] [INFO ] Added : 20 causal constraints over 5 iterations in 140 ms. Result :sat
Minimization took 97 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:08:30] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-25 05:08:30] [INFO ] [Real]Absence check using 8 positive and 11 generalized place invariants in 5 ms returned sat
[2026-05-25 05:08:30] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:08:30] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 9 ms to minimize.
[2026-05-25 05:08:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:08:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-25 05:08:30] [INFO ] [Nat]Absence check using 8 positive and 11 generalized place invariants in 6 ms returned sat
[2026-05-25 05:08:30] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:08:30] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 6 ms to minimize.
[2026-05-25 05:08:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2026-05-25 05:08:31] [INFO ] Computed and/alt/rep : 93/305/93 causal constraints (skipped 80 transitions) in 28 ms.
[2026-05-25 05:08:31] [INFO ] Added : 35 causal constraints over 7 iterations in 243 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0] Max Struct:[1, 1]
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 190/190 transitions.
Applied a total of 0 rules in 5 ms. Remains 143 /143 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 143/143 places, 190/190 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 190/190 transitions.
Applied a total of 0 rules in 5 ms. Remains 143 /143 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2026-05-25 05:08:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:08:31] [INFO ] Implicit Places using invariants in 153 ms returned []
[2026-05-25 05:08:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:08:31] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 05:08:31] [INFO ] Redundant transitions in 4 ms returned []
Running 173 sub problems to find dead transitions.
[2026-05-25 05:08:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (OVERLAPS) 1/143 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:08:35] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:08:36] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:08:36] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 22 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:08:37] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
At refinement iteration 8 (OVERLAPS) 190/333 variables, 143/166 constraints. Problems are: Problem set: 7 solved, 166 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:08:40] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 1/167 constraints. Problems are: Problem set: 7 solved, 166 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 0/167 constraints. Problems are: Problem set: 7 solved, 166 unsolved
At refinement iteration 11 (OVERLAPS) 0/333 variables, 0/167 constraints. Problems are: Problem set: 7 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 167 constraints, problems are : Problem set: 7 solved, 166 unsolved in 18828 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 166 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 5/5 constraints. Problems are: Problem set: 7 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 8/13 constraints. Problems are: Problem set: 7 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/14 constraints. Problems are: Problem set: 7 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/14 constraints. Problems are: Problem set: 7 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 1/143 variables, 3/17 constraints. Problems are: Problem set: 7 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 3/20 constraints. Problems are: Problem set: 7 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 4/24 constraints. Problems are: Problem set: 7 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/24 constraints. Problems are: Problem set: 7 solved, 166 unsolved
At refinement iteration 8 (OVERLAPS) 190/333 variables, 143/167 constraints. Problems are: Problem set: 7 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 166/333 constraints. Problems are: Problem set: 7 solved, 166 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:08:58] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 1/334 constraints. Problems are: Problem set: 7 solved, 166 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/333 variables, 0/334 constraints. Problems are: Problem set: 7 solved, 166 unsolved
At refinement iteration 12 (OVERLAPS) 0/333 variables, 0/334 constraints. Problems are: Problem set: 7 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 333/333 variables, and 334 constraints, problems are : Problem set: 7 solved, 166 unsolved in 23858 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 166/173 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42736ms problems are : Problem set: 7 solved, 166 unsolved
Search for dead transitions found 7 dead transitions in 42737ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 143/143 places, 183/190 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 137 transition count 175
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 22 place count 129 transition count 175
Applied a total of 22 rules in 12 ms. Remains 129 /143 variables (removed 14) and now considering 175/183 (removed 8) transitions.
// Phase 1: matrix 175 rows 129 cols
[2026-05-25 05:09:14] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:09:14] [INFO ] Implicit Places using invariants in 176 ms returned []
[2026-05-25 05:09:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:09:14] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 129/143 places, 175/190 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 43483 ms. Remains : 129/143 places, 175/190 transitions.
[2026-05-25 05:09:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0] Max Struct:[1, 1]
FORMULA ASLink-PT-02b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (32948 resets) in 1144 ms. (873 steps per ms)
BEST_FIRST walk for 1000001 steps (10612 resets) in 548 ms. (1821 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-25 05:09:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:09:16] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 05:09:16] [INFO ] [Real]Absence check using 9 positive and 11 generalized place invariants in 4 ms returned sat
[2026-05-25 05:09:16] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2026-05-25 05:09:16] [INFO ] Computed and/alt/rep : 78/249/78 causal constraints (skipped 80 transitions) in 9 ms.
[2026-05-25 05:09:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:09:16] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2026-05-25 05:09:16] [INFO ] [Nat]Absence check using 9 positive and 11 generalized place invariants in 3 ms returned sat
[2026-05-25 05:09:16] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2026-05-25 05:09:16] [INFO ] Computed and/alt/rep : 78/249/78 causal constraints (skipped 80 transitions) in 12 ms.
[2026-05-25 05:09:16] [INFO ] Added : 28 causal constraints over 7 iterations in 118 ms. Result :sat
Minimization took 85 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 129 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p64) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 174/174 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 0 with 1 rules applied. Total rules applied 1 place count 129 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 128 transition count 173
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 128 transition count 172
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 127 transition count 172
Applied a total of 4 rules in 13 ms. Remains 127 /129 variables (removed 2) and now considering 172/174 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 127/129 places, 172/174 transitions.
// Phase 1: matrix 172 rows 127 cols
[2026-05-25 05:09:17] [INFO ] Computed 20 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (33106 resets) in 1185 ms. (843 steps per ms)
BEST_FIRST walk for 1000001 steps (10701 resets) in 529 ms. (1886 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-25 05:09:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:09:18] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-25 05:09:18] [INFO ] [Real]Absence check using 10 positive and 10 generalized place invariants in 3 ms returned sat
[2026-05-25 05:09:18] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2026-05-25 05:09:19] [INFO ] Computed and/alt/rep : 75/245/75 causal constraints (skipped 80 transitions) in 11 ms.
[2026-05-25 05:09:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:09:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-25 05:09:19] [INFO ] [Nat]Absence check using 10 positive and 10 generalized place invariants in 6 ms returned sat
[2026-05-25 05:09:19] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2026-05-25 05:09:19] [INFO ] Computed and/alt/rep : 75/245/75 causal constraints (skipped 80 transitions) in 11 ms.
[2026-05-25 05:09:19] [INFO ] Added : 27 causal constraints over 6 iterations in 185 ms. Result :sat
Minimization took 115 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 172/172 transitions.
Applied a total of 0 rules in 4 ms. Remains 127 /127 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 127/127 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 172/172 transitions.
Applied a total of 0 rules in 3 ms. Remains 127 /127 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2026-05-25 05:09:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:09:19] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-25 05:09:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:09:19] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 05:09:19] [INFO ] Redundant transitions in 0 ms returned []
Running 155 sub problems to find dead transitions.
[2026-05-25 05:09:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 2/127 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:09:22] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:09:23] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:09:23] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 172/299 variables, 127/150 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (OVERLAPS) 0/299 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 150 constraints, problems are : Problem set: 0 solved, 155 unsolved in 9930 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 2/127 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 172/299 variables, 127/150 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 155/305 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (OVERLAPS) 0/299 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 299/299 variables, and 305 constraints, problems are : Problem set: 0 solved, 155 unsolved in 14399 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24379ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 24379ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24746 ms. Remains : 127/127 places, 172/172 transitions.
[2026-05-25 05:09:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA ASLink-PT-02b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (32960 resets) in 1160 ms. (861 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-05-25 05:09:45] [INFO ] Flatten gal took : 59 ms
[2026-05-25 05:09:45] [INFO ] Flatten gal took : 18 ms
[2026-05-25 05:09:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16705329469928283116.gal : 10 ms
[2026-05-25 05:09:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5823696391274077930.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16705329469928283116.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5823696391274077930.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 281206 ms.

BK_STOP 1779685785910

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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="ASLink-PT-02b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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 gold2025"
echo " Input is ASLink-PT-02b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r015-oct2-177944372400039"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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