Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r013-tall-174853743000039.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
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 r013-tall-174853743000039
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 417K May 29 14:32 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 1748540236245

Invoking MCC driver with
BK_TOOL=gold2024
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 202405141337
[2025-05-29 17:37:17] [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]
[2025-05-29 17:37:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:37:17] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2025-05-29 17:37:17] [INFO ] Transformed 1242 places.
[2025-05-29 17:37:17] [INFO ] Transformed 1621 transitions.
[2025-05-29 17:37:17] [INFO ] Found NUPN structural information;
[2025-05-29 17:37:17] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 254 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 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
[2025-05-29 17:37:18] [INFO ] Computed 121 invariants in 99 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 (46 resets) in 53 ms. (185 steps per ms)
FORMULA ASLink-PT-02b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-14 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-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-06 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-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (32 resets) in 62 ms. (634 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-05-29 17:37:18] [INFO ] Invariant cache hit.
[2025-05-29 17:37:18] [INFO ] [Real]Absence check using 27 positive place invariants in 34 ms returned sat
[2025-05-29 17:37:18] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 37 ms returned sat
[2025-05-29 17:37:19] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2025-05-29 17:37:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:19] [INFO ] [Nat]Absence check using 27 positive place invariants in 28 ms returned sat
[2025-05-29 17:37:19] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 30 ms returned sat
[2025-05-29 17:37:20] [INFO ] [Nat]Absence check using state equation in 930 ms returned sat
[2025-05-29 17:37:21] [INFO ] Deduced a trap composed of 20 places in 612 ms of which 62 ms to minimize.
[2025-05-29 17:37:21] [INFO ] Deduced a trap composed of 113 places in 605 ms of which 8 ms to minimize.
[2025-05-29 17:37:22] [INFO ] Deduced a trap composed of 346 places in 493 ms of which 7 ms to minimize.
[2025-05-29 17:37:22] [INFO ] Deduced a trap composed of 70 places in 254 ms of which 4 ms to minimize.
[2025-05-29 17:37:23] [INFO ] Deduced a trap composed of 89 places in 248 ms of which 4 ms to minimize.
[2025-05-29 17:37:23] [INFO ] Deduced a trap composed of 70 places in 404 ms of which 7 ms to minimize.
[2025-05-29 17:37:23] [INFO ] Deduced a trap composed of 74 places in 248 ms of which 5 ms to minimize.
[2025-05-29 17:37:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3331 ms
[2025-05-29 17:37:24] [INFO ] Computed and/alt/rep : 1337/2984/1337 causal constraints (skipped 283 transitions) in 100 ms.
[2025-05-29 17:37:24] [INFO ] Added : 10 causal constraints over 2 iterations in 493 ms. Result :unknown
[2025-05-29 17:37:24] [INFO ] [Real]Absence check using 27 positive place invariants in 23 ms returned sat
[2025-05-29 17:37:24] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 31 ms returned sat
[2025-05-29 17:37:25] [INFO ] [Real]Absence check using state equation in 559 ms returned sat
[2025-05-29 17:37:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:25] [INFO ] [Nat]Absence check using 27 positive place invariants in 25 ms returned sat
[2025-05-29 17:37:25] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 45 ms returned sat
[2025-05-29 17:37:26] [INFO ] [Nat]Absence check using state equation in 746 ms returned sat
[2025-05-29 17:37:26] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 4 ms to minimize.
[2025-05-29 17:37:26] [INFO ] Deduced a trap composed of 93 places in 206 ms of which 3 ms to minimize.
[2025-05-29 17:37:27] [INFO ] Deduced a trap composed of 68 places in 167 ms of which 4 ms to minimize.
[2025-05-29 17:37:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 792 ms
[2025-05-29 17:37:27] [INFO ] Computed and/alt/rep : 1337/2984/1337 causal constraints (skipped 283 transitions) in 99 ms.
[2025-05-29 17:37:30] [INFO ] Added : 170 causal constraints over 34 iterations in 3217 ms. Result :unknown
[2025-05-29 17:37:30] [INFO ] [Real]Absence check using 27 positive place invariants in 22 ms returned sat
[2025-05-29 17:37:30] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 32 ms returned sat
[2025-05-29 17:37:31] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2025-05-29 17:37:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:31] [INFO ] [Nat]Absence check using 27 positive place invariants in 24 ms returned sat
[2025-05-29 17:37:31] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 30 ms returned sat
[2025-05-29 17:37:32] [INFO ] [Nat]Absence check using state equation in 1262 ms returned sat
[2025-05-29 17:37:32] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 4 ms to minimize.
[2025-05-29 17:37:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2025-05-29 17:37:33] [INFO ] Computed and/alt/rep : 1337/2984/1337 causal constraints (skipped 283 transitions) in 93 ms.
[2025-05-29 17:37:36] [INFO ] Added : 160 causal constraints over 32 iterations in 3207 ms. Result :unknown
[2025-05-29 17:37:36] [INFO ] [Real]Absence check using 27 positive place invariants in 22 ms returned sat
[2025-05-29 17:37:36] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 40 ms returned sat
[2025-05-29 17:37:37] [INFO ] [Real]Absence check using state equation in 724 ms returned sat
[2025-05-29 17:37:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:37] [INFO ] [Nat]Absence check using 27 positive place invariants in 25 ms returned sat
[2025-05-29 17:37:37] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 41 ms returned sat
[2025-05-29 17:37:38] [INFO ] [Nat]Absence check using state equation in 742 ms returned sat
[2025-05-29 17:37:38] [INFO ] Deduced a trap composed of 21 places in 449 ms of which 7 ms to minimize.
[2025-05-29 17:37:39] [INFO ] Deduced a trap composed of 27 places in 475 ms of which 8 ms to minimize.
[2025-05-29 17:37:39] [INFO ] Deduced a trap composed of 121 places in 351 ms of which 6 ms to minimize.
[2025-05-29 17:37:40] [INFO ] Deduced a trap composed of 42 places in 259 ms of which 4 ms to minimize.
[2025-05-29 17:37:40] [INFO ] Deduced a trap composed of 67 places in 238 ms of which 4 ms to minimize.
[2025-05-29 17:37:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2108 ms
[2025-05-29 17:37:40] [INFO ] Computed and/alt/rep : 1337/2984/1337 causal constraints (skipped 283 transitions) in 92 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 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.
Iterating post reduction 2 with 4 rules applied. Total rules applied 578 place count 958 transition count 1327
Performed 282 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 282 Pre rules applied. Total rules applied 578 place count 958 transition count 1045
Deduced a syphon composed of 282 places in 2 ms
Ensure Unique test removed 22 places
Reduce places removed 304 places and 0 transitions.
Iterating global reduction 3 with 586 rules applied. Total rules applied 1164 place count 654 transition count 1045
Discarding 4 places :
Implicit places reduction removed 4 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 3 with 20 rules applied. Total rules applied 1184 place count 650 transition count 1029
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 17 rules applied. Total rules applied 1201 place count 634 transition count 1028
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1202 place count 633 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 1202 place count 633 transition count 1020
Deduced a syphon composed of 8 places in 4 ms
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1226 place count 617 transition count 1020
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 1226 place count 617 transition count 1012
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1242 place count 609 transition count 1012
Discarding 38 places :
Symmetric choice reduction at 6 with 38 rule applications. Total rules 1280 place count 571 transition count 974
Iterating global reduction 6 with 38 rules applied. Total rules applied 1318 place count 571 transition count 974
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1319 place count 571 transition count 973
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 14 Pre rules applied. Total rules applied 1319 place count 571 transition count 959
Deduced a syphon composed of 14 places in 4 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 1348 place count 556 transition count 959
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1348 place count 556 transition count 958
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 1351 place count 554 transition count 958
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1354 place count 551 transition count 937
Iterating global reduction 7 with 3 rules applied. Total rules applied 1357 place count 551 transition count 937
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 1357 place count 551 transition count 935
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 1361 place count 549 transition count 935
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1362 place count 548 transition count 927
Iterating global reduction 7 with 1 rules applied. Total rules applied 1363 place count 548 transition count 927
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1364 place count 547 transition count 919
Iterating global reduction 7 with 1 rules applied. Total rules applied 1365 place count 547 transition count 919
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1366 place count 546 transition count 911
Iterating global reduction 7 with 1 rules applied. Total rules applied 1367 place count 546 transition count 911
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1368 place count 545 transition count 903
Iterating global reduction 7 with 1 rules applied. Total rules applied 1369 place count 545 transition count 903
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1370 place count 544 transition count 895
Iterating global reduction 7 with 1 rules applied. Total rules applied 1371 place count 544 transition count 895
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1372 place count 543 transition count 887
Iterating global reduction 7 with 1 rules applied. Total rules applied 1373 place count 543 transition count 887
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1374 place count 542 transition count 879
Iterating global reduction 7 with 1 rules applied. Total rules applied 1375 place count 542 transition count 879
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1376 place count 541 transition count 871
Iterating global reduction 7 with 1 rules applied. Total rules applied 1377 place count 541 transition count 871
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1378 place count 540 transition count 863
Iterating global reduction 7 with 1 rules applied. Total rules applied 1379 place count 540 transition count 863
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1380 place count 539 transition count 855
Iterating global reduction 7 with 1 rules applied. Total rules applied 1381 place count 539 transition count 855
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1382 place count 538 transition count 847
Iterating global reduction 7 with 1 rules applied. Total rules applied 1383 place count 538 transition count 847
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1384 place count 537 transition count 839
Iterating global reduction 7 with 1 rules applied. Total rules applied 1385 place count 537 transition count 839
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1386 place count 536 transition count 831
Iterating global reduction 7 with 1 rules applied. Total rules applied 1387 place count 536 transition count 831
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1388 place count 535 transition count 823
Iterating global reduction 7 with 1 rules applied. Total rules applied 1389 place count 535 transition count 823
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1390 place count 534 transition count 815
Iterating global reduction 7 with 1 rules applied. Total rules applied 1391 place count 534 transition count 815
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1392 place count 533 transition count 807
Iterating global reduction 7 with 1 rules applied. Total rules applied 1393 place count 533 transition count 807
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 7 with 130 rules applied. Total rules applied 1523 place count 468 transition count 742
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1524 place count 467 transition count 741
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 1526 place count 466 transition count 741
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1527 place count 465 transition count 740
Iterating global reduction 7 with 1 rules applied. Total rules applied 1528 place count 465 transition count 740
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 465 transition count 738
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1531 place count 464 transition count 738
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1533 place count 463 transition count 747
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 1536 place count 463 transition count 744
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1539 place count 460 transition count 744
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1540 place count 460 transition count 743
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1541 place count 459 transition count 743
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1542 place count 458 transition count 742
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 454 transition count 740
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1550 place count 452 transition count 740
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 452 transition count 734
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 13 with 12 rules applied. Total rules applied 1562 place count 446 transition count 734
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 13 with 3 rules applied. Total rules applied 1565 place count 443 transition count 734
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 1565 place count 443 transition count 733
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1567 place count 442 transition count 733
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 1575 place count 438 transition count 729
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1577 place count 436 transition count 727
Iterating global reduction 14 with 2 rules applied. Total rules applied 1579 place count 436 transition count 727
Free-agglomeration rule applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1581 place count 436 transition count 725
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1583 place count 434 transition count 725
Applied a total of 1583 rules in 756 ms. Remains 434 /1242 variables (removed 808) and now considering 725/1621 (removed 896) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 767 ms. Remains : 434/1242 places, 725/1621 transitions.
// Phase 1: matrix 725 rows 434 cols
[2025-05-29 17:37:44] [INFO ] Computed 77 invariants in 21 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (16342 resets) in 1540 ms. (648 steps per ms)
FORMULA ASLink-PT-02b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000003 steps (16609 resets) in 2351 ms. (1275 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-29 17:37:48] [INFO ] Invariant cache hit.
[2025-05-29 17:37:48] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-05-29 17:37:48] [INFO ] [Real]Absence check using 19 positive and 58 generalized place invariants in 11 ms returned sat
[2025-05-29 17:37:49] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2025-05-29 17:37:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:49] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-05-29 17:37:49] [INFO ] [Nat]Absence check using 19 positive and 58 generalized place invariants in 12 ms returned sat
[2025-05-29 17:37:49] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2025-05-29 17:37:49] [INFO ] Computed and/alt/rep : 277/1074/277 causal constraints (skipped 431 transitions) in 40 ms.
[2025-05-29 17:37:51] [INFO ] Added : 194 causal constraints over 39 iterations in 1762 ms. Result :sat
Minimization took 588 ms.
[2025-05-29 17:37:51] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2025-05-29 17:37:51] [INFO ] [Real]Absence check using 19 positive and 58 generalized place invariants in 16 ms returned sat
[2025-05-29 17:37:52] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2025-05-29 17:37:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:52] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2025-05-29 17:37:52] [INFO ] [Nat]Absence check using 19 positive and 58 generalized place invariants in 14 ms returned sat
[2025-05-29 17:37:52] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2025-05-29 17:37:52] [INFO ] Computed and/alt/rep : 277/1074/277 causal constraints (skipped 431 transitions) in 40 ms.
[2025-05-29 17:37:53] [INFO ] Added : 153 causal constraints over 31 iterations in 1321 ms. Result :sat
Minimization took 601 ms.
[2025-05-29 17:37:54] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2025-05-29 17:37:54] [INFO ] [Real]Absence check using 19 positive and 58 generalized place invariants in 15 ms returned sat
[2025-05-29 17:37:54] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2025-05-29 17:37:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:54] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2025-05-29 17:37:54] [INFO ] [Nat]Absence check using 19 positive and 58 generalized place invariants in 12 ms returned sat
[2025-05-29 17:37:54] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2025-05-29 17:37:55] [INFO ] Computed and/alt/rep : 277/1074/277 causal constraints (skipped 431 transitions) in 41 ms.
[2025-05-29 17:37:55] [INFO ] Added : 63 causal constraints over 13 iterations in 658 ms. Result :sat
Minimization took 546 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 725/725 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 434 transition count 724
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 433 transition count 724
Applied a total of 2 rules in 17 ms. Remains 433 /434 variables (removed 1) and now considering 724/725 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 433/434 places, 724/725 transitions.
// Phase 1: matrix 724 rows 433 cols
[2025-05-29 17:37:56] [INFO ] Computed 77 invariants in 23 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (16079 resets) in 1456 ms. (686 steps per ms)
BEST_FIRST walk for 3000002 steps (16678 resets) in 2280 ms. (1315 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-29 17:38:00] [INFO ] Invariant cache hit.
[2025-05-29 17:38:00] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2025-05-29 17:38:00] [INFO ] [Real]Absence check using 19 positive and 58 generalized place invariants in 11 ms returned sat
[2025-05-29 17:38:00] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2025-05-29 17:38:00] [INFO ] Computed and/alt/rep : 276/1073/276 causal constraints (skipped 431 transitions) in 37 ms.
[2025-05-29 17:38:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:01] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2025-05-29 17:38:01] [INFO ] [Nat]Absence check using 19 positive and 58 generalized place invariants in 12 ms returned sat
[2025-05-29 17:38:01] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2025-05-29 17:38:01] [INFO ] Computed and/alt/rep : 276/1073/276 causal constraints (skipped 431 transitions) in 39 ms.
[2025-05-29 17:38:03] [INFO ] Added : 192 causal constraints over 39 iterations in 1857 ms. Result :sat
Minimization took 389 ms.
[2025-05-29 17:38:03] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2025-05-29 17:38:03] [INFO ] [Real]Absence check using 19 positive and 58 generalized place invariants in 11 ms returned sat
[2025-05-29 17:38:03] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2025-05-29 17:38:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:03] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2025-05-29 17:38:03] [INFO ] [Nat]Absence check using 19 positive and 58 generalized place invariants in 11 ms returned sat
[2025-05-29 17:38:04] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2025-05-29 17:38:04] [INFO ] Computed and/alt/rep : 276/1073/276 causal constraints (skipped 431 transitions) in 40 ms.
[2025-05-29 17:38:06] [INFO ] Added : 194 causal constraints over 39 iterations in 2151 ms. Result :sat
Minimization took 395 ms.
[2025-05-29 17:38:06] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2025-05-29 17:38:06] [INFO ] [Real]Absence check using 19 positive and 58 generalized place invariants in 12 ms returned sat
[2025-05-29 17:38:07] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2025-05-29 17:38:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:07] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2025-05-29 17:38:07] [INFO ] [Nat]Absence check using 19 positive and 58 generalized place invariants in 12 ms returned sat
[2025-05-29 17:38:07] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2025-05-29 17:38:07] [INFO ] Computed and/alt/rep : 276/1073/276 causal constraints (skipped 431 transitions) in 44 ms.
[2025-05-29 17:38:08] [INFO ] Added : 117 causal constraints over 24 iterations in 1141 ms. Result :sat
Minimization took 443 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 724/724 transitions.
Applied a total of 0 rules in 21 ms. Remains 433 /433 variables (removed 0) and now considering 724/724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 433/433 places, 724/724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 724/724 transitions.
Applied a total of 0 rules in 12 ms. Remains 433 /433 variables (removed 0) and now considering 724/724 (removed 0) transitions.
[2025-05-29 17:38:10] [INFO ] Invariant cache hit.
[2025-05-29 17:38:11] [INFO ] Implicit Places using invariants in 298 ms returned [1, 18, 19, 31, 48, 66, 137, 141, 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]
[2025-05-29 17:38:11] [INFO ] Actually due to overlaps returned [298, 280, 48, 172, 304, 31, 155, 152, 278, 322, 153, 279, 300, 323, 1, 18, 263, 264, 66, 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 301 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 398/433 places, 724/724 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 396 transition count 661
Reduce places removed 63 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 66 rules applied. Total rules applied 131 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 132 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 132 place count 332 transition count 643
Deduced a syphon composed of 15 places in 0 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 163 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 175 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 183 place count 304 transition count 635
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 198 place count 289 transition count 620
Iterating global reduction 5 with 15 rules applied. Total rules applied 213 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 216 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 216 place count 289 transition count 616
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 218 place count 288 transition count 616
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 221 place count 285 transition count 610
Iterating global reduction 6 with 3 rules applied. Total rules applied 224 place count 285 transition count 610
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 225 place count 284 transition count 609
Iterating global reduction 6 with 1 rules applied. Total rules applied 226 place count 284 transition count 609
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 227 place count 283 transition count 607
Iterating global reduction 6 with 1 rules applied. Total rules applied 228 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 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 270 place count 262 transition count 586
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 272 place count 260 transition count 584
Iterating global reduction 6 with 2 rules applied. Total rules applied 274 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 276 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 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 280 place count 258 transition count 583
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 284 place count 258 transition count 579
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 289 place count 253 transition count 579
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 295 place count 253 transition count 579
Applied a total of 295 rules in 109 ms. Remains 253 /398 variables (removed 145) and now considering 579/724 (removed 145) transitions.
// Phase 1: matrix 579 rows 253 cols
[2025-05-29 17:38:11] [INFO ] Computed 34 invariants in 13 ms
[2025-05-29 17:38:11] [INFO ] Implicit Places using invariants in 177 ms returned [72, 91, 97, 100, 102, 103, 108, 109, 161, 178, 184, 187, 189]
[2025-05-29 17:38:11] [INFO ] Actually due to overlaps returned [108, 109, 91, 97, 102, 178, 184, 189, 72, 103, 161]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 187 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 242/433 places, 579/724 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 234 transition count 571
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 234 transition count 571
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 232 transition count 569
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 232 transition count 569
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 228 transition count 565
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 228 transition count 559
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 222 transition count 559
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 222 transition count 557
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 220 transition count 557
Applied a total of 44 rules in 55 ms. Remains 220 /242 variables (removed 22) and now considering 557/579 (removed 22) transitions.
// Phase 1: matrix 557 rows 220 cols
[2025-05-29 17:38:11] [INFO ] Computed 23 invariants in 7 ms
[2025-05-29 17:38:11] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-05-29 17:38:11] [INFO ] Invariant cache hit.
[2025-05-29 17:38:11] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 220/433 places, 557/724 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1158 ms. Remains : 220/433 places, 557/724 transitions.
[2025-05-29 17:38:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (25356 resets) in 1381 ms. (723 steps per ms)
BEST_FIRST walk for 3000001 steps (28931 resets) in 2087 ms. (1436 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-29 17:38:15] [INFO ] Invariant cache hit.
[2025-05-29 17:38:15] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-29 17:38:15] [INFO ] [Real]Absence check using 7 positive and 16 generalized place invariants in 4 ms returned sat
[2025-05-29 17:38:15] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2025-05-29 17:38:15] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-29 17:38:15] [INFO ] [Nat]Absence check using 7 positive and 16 generalized place invariants in 10 ms returned sat
[2025-05-29 17:38:15] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2025-05-29 17:38:15] [INFO ] Computed and/alt/rep : 99/569/99 causal constraints (skipped 441 transitions) in 31 ms.
[2025-05-29 17:38:15] [INFO ] Added : 12 causal constraints over 3 iterations in 154 ms. Result :sat
Minimization took 213 ms.
[2025-05-29 17:38:16] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-29 17:38:16] [INFO ] [Real]Absence check using 7 positive and 16 generalized place invariants in 3 ms returned sat
[2025-05-29 17:38:16] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2025-05-29 17:38:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-29 17:38:16] [INFO ] [Nat]Absence check using 7 positive and 16 generalized place invariants in 4 ms returned sat
[2025-05-29 17:38:16] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2025-05-29 17:38:16] [INFO ] Computed and/alt/rep : 99/569/99 causal constraints (skipped 441 transitions) in 27 ms.
[2025-05-29 17:38:16] [INFO ] Added : 14 causal constraints over 3 iterations in 147 ms. Result :sat
Minimization took 217 ms.
[2025-05-29 17:38:16] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2025-05-29 17:38:16] [INFO ] [Real]Absence check using 7 positive and 16 generalized place invariants in 4 ms returned sat
[2025-05-29 17:38:17] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2025-05-29 17:38:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-29 17:38:17] [INFO ] [Nat]Absence check using 7 positive and 16 generalized place invariants in 4 ms returned sat
[2025-05-29 17:38:17] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2025-05-29 17:38:17] [INFO ] Computed and/alt/rep : 99/569/99 causal constraints (skipped 441 transitions) in 30 ms.
[2025-05-29 17:38:17] [INFO ] Added : 43 causal constraints over 9 iterations in 306 ms. Result :sat
Minimization took 220 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 557/557 transitions.
Applied a total of 0 rules in 9 ms. Remains 220 /220 variables (removed 0) and now considering 557/557 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 220/220 places, 557/557 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 557/557 transitions.
Applied a total of 0 rules in 9 ms. Remains 220 /220 variables (removed 0) and now considering 557/557 (removed 0) transitions.
[2025-05-29 17:38:17] [INFO ] Invariant cache hit.
[2025-05-29 17:38:18] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-05-29 17:38:18] [INFO ] Invariant cache hit.
[2025-05-29 17:38:18] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2025-05-29 17:38:18] [INFO ] Redundant transitions in 25 ms returned []
Running 540 sub problems to find dead transitions.
[2025-05-29 17:38:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (OVERLAPS) 1/220 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 540 unsolved
[2025-05-29 17:38:27] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2025-05-29 17:38:29] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 4 ms to minimize.
[2025-05-29 17:38:29] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 1 ms to minimize.
[2025-05-29 17:38:30] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 7 (OVERLAPS) 557/777 variables, 220/247 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/777 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 9 (OVERLAPS) 0/777 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 540 unsolved
No progress, stopping.
After SMT solving in domain Real declared 777/777 variables, and 247 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (OVERLAPS) 1/220 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 540 unsolved
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 TDEAD10 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 TDEAD18 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 TDEAD26 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 TDEAD34 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 TDEAD42 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 TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 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 TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
At refinement iteration 7 (OVERLAPS) 557/777 variables, 220/247 constraints. Problems are: Problem set: 211 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 777/777 variables, and 576 constraints, problems are : Problem set: 211 solved, 329 unsolved in 30094 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 329/540 constraints, Known Traps: 4/4 constraints]
After SMT, in 60444ms problems are : Problem set: 211 solved, 329 unsolved
Search for dead transitions found 211 dead transitions in 60460ms
Found 211 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 211 transitions
Dead transitions reduction (with SMT) removed 211 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 220/220 places, 346/557 transitions.
Applied a total of 0 rules in 5 ms. Remains 220 /220 variables (removed 0) and now considering 346/346 (removed 0) transitions.
[2025-05-29 17:39:18] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61019 ms. Remains : 220/220 places, 346/557 transitions.
// Phase 1: matrix 346 rows 220 cols
[2025-05-29 17:39:18] [INFO ] Computed 23 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (25321 resets) in 1168 ms. (855 steps per ms)
BEST_FIRST walk for 3000000 steps (28973 resets) in 1761 ms. (1702 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-29 17:39:21] [INFO ] Invariant cache hit.
[2025-05-29 17:39:21] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-29 17:39:21] [INFO ] [Real]Absence check using 7 positive and 16 generalized place invariants in 4 ms returned sat
[2025-05-29 17:39:22] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2025-05-29 17:39:22] [INFO ] Computed and/alt/rep : 211/843/211 causal constraints (skipped 118 transitions) in 19 ms.
[2025-05-29 17:39:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-29 17:39:22] [INFO ] [Nat]Absence check using 7 positive and 16 generalized place invariants in 4 ms returned sat
[2025-05-29 17:39:22] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2025-05-29 17:39:22] [INFO ] Computed and/alt/rep : 211/843/211 causal constraints (skipped 118 transitions) in 18 ms.
[2025-05-29 17:39:22] [INFO ] Added : 72 causal constraints over 15 iterations in 360 ms. Result :sat
Minimization took 293 ms.
[2025-05-29 17:39:23] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-29 17:39:23] [INFO ] [Real]Absence check using 7 positive and 16 generalized place invariants in 4 ms returned sat
[2025-05-29 17:39:23] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2025-05-29 17:39:23] [INFO ] Computed and/alt/rep : 211/843/211 causal constraints (skipped 118 transitions) in 17 ms.
[2025-05-29 17:39:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-29 17:39:23] [INFO ] [Nat]Absence check using 7 positive and 16 generalized place invariants in 4 ms returned sat
[2025-05-29 17:39:23] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2025-05-29 17:39:23] [INFO ] Computed and/alt/rep : 211/843/211 causal constraints (skipped 118 transitions) in 20 ms.
[2025-05-29 17:39:23] [INFO ] Added : 57 causal constraints over 12 iterations in 282 ms. Result :sat
Minimization took 252 ms.
[2025-05-29 17:39:23] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-29 17:39:23] [INFO ] [Real]Absence check using 7 positive and 16 generalized place invariants in 3 ms returned sat
[2025-05-29 17:39:24] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2025-05-29 17:39:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-29 17:39:24] [INFO ] [Nat]Absence check using 7 positive and 16 generalized place invariants in 4 ms returned sat
[2025-05-29 17:39:24] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2025-05-29 17:39:24] [INFO ] Computed and/alt/rep : 211/843/211 causal constraints (skipped 118 transitions) in 21 ms.
[2025-05-29 17:39:24] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2025-05-29 17:39:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2025-05-29 17:39:24] [INFO ] Added : 105 causal constraints over 22 iterations in 730 ms. Result :sat
Minimization took 278 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 346/346 transitions.
Applied a total of 0 rules in 9 ms. Remains 220 /220 variables (removed 0) and now considering 346/346 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 220/220 places, 346/346 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 346/346 transitions.
Applied a total of 0 rules in 9 ms. Remains 220 /220 variables (removed 0) and now considering 346/346 (removed 0) transitions.
[2025-05-29 17:39:25] [INFO ] Invariant cache hit.
[2025-05-29 17:39:25] [INFO ] Implicit Places using invariants in 140 ms returned []
[2025-05-29 17:39:25] [INFO ] Invariant cache hit.
[2025-05-29 17:39:25] [INFO ] Implicit Places using invariants and state equation in 456 ms returned [2, 57, 59, 61, 63, 65, 67, 69, 95, 97, 99, 101, 103, 105, 107, 128, 130, 132, 134]
Discarding 19 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 600 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 201/220 places, 345/346 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 195 transition count 297
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 195 transition count 297
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 195 transition count 297
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 189 transition count 297
Applied a total of 24 rules in 11 ms. Remains 189 /201 variables (removed 12) and now considering 297/345 (removed 48) transitions.
// Phase 1: matrix 297 rows 189 cols
[2025-05-29 17:39:25] [INFO ] Computed 19 invariants in 2 ms
[2025-05-29 17:39:26] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-05-29 17:39:26] [INFO ] Invariant cache hit.
[2025-05-29 17:39:26] [INFO ] Implicit Places using invariants and state equation in 203 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 307 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 188/220 places, 297/346 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 188 transition count 297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 187 transition count 297
Applied a total of 2 rules in 8 ms. Remains 187 /188 variables (removed 1) and now considering 297/297 (removed 0) transitions.
// Phase 1: matrix 297 rows 187 cols
[2025-05-29 17:39:26] [INFO ] Computed 18 invariants in 2 ms
[2025-05-29 17:39:26] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-05-29 17:39:26] [INFO ] Invariant cache hit.
[2025-05-29 17:39:26] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 187/220 places, 297/346 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1271 ms. Remains : 187/220 places, 297/346 transitions.
[2025-05-29 17:39:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (25286 resets) in 1216 ms. (821 steps per ms)
BEST_FIRST walk for 3000001 steps (29069 resets) in 1817 ms. (1650 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-29 17:39:29] [INFO ] Invariant cache hit.
[2025-05-29 17:39:29] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-05-29 17:39:29] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2025-05-29 17:39:29] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2025-05-29 17:39:29] [INFO ] Computed and/alt/rep : 159/630/159 causal constraints (skipped 121 transitions) in 17 ms.
[2025-05-29 17:39:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-05-29 17:39:29] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 5 ms returned sat
[2025-05-29 17:39:29] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2025-05-29 17:39:30] [INFO ] Computed and/alt/rep : 159/630/159 causal constraints (skipped 121 transitions) in 16 ms.
[2025-05-29 17:39:30] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 3 ms to minimize.
[2025-05-29 17:39:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2025-05-29 17:39:30] [INFO ] Added : 103 causal constraints over 28 iterations in 680 ms. Result :sat
Minimization took 510 ms.
[2025-05-29 17:39:31] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 17:39:31] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2025-05-29 17:39:31] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2025-05-29 17:39:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-05-29 17:39:31] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2025-05-29 17:39:31] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2025-05-29 17:39:31] [INFO ] Computed and/alt/rep : 159/630/159 causal constraints (skipped 121 transitions) in 16 ms.
[2025-05-29 17:39:31] [INFO ] Added : 107 causal constraints over 22 iterations in 494 ms. Result :sat
Minimization took 163 ms.
[2025-05-29 17:39:32] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-29 17:39:32] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 3 ms returned sat
[2025-05-29 17:39:32] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2025-05-29 17:39:32] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2025-05-29 17:39:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 17:39:32] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 6 ms returned sat
[2025-05-29 17:39:32] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2025-05-29 17:39:32] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2025-05-29 17:39:32] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2025-05-29 17:39:32] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2025-05-29 17:39:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 192 ms
[2025-05-29 17:39:32] [INFO ] Computed and/alt/rep : 159/630/159 causal constraints (skipped 121 transitions) in 16 ms.
[2025-05-29 17:39:33] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2025-05-29 17:39:33] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2025-05-29 17:39:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
[2025-05-29 17:39:33] [INFO ] Added : 122 causal constraints over 29 iterations in 816 ms. Result :sat
Minimization took 188 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 297/297 transitions.
Applied a total of 0 rules in 4 ms. Remains 187 /187 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 187/187 places, 297/297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 297/297 transitions.
Applied a total of 0 rules in 3 ms. Remains 187 /187 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2025-05-29 17:39:37] [INFO ] Invariant cache hit.
[2025-05-29 17:39:37] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-05-29 17:39:37] [INFO ] Invariant cache hit.
[2025-05-29 17:39:37] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2025-05-29 17:39:37] [INFO ] Redundant transitions in 24 ms returned []
Running 280 sub problems to find dead transitions.
[2025-05-29 17:39:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 1/187 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2025-05-29 17:39:41] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
[2025-05-29 17:39:41] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 2/20 constraints. Problems are: Problem set: 7 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/20 constraints. Problems are: Problem set: 7 solved, 273 unsolved
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 TDEAD240 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
At refinement iteration 6 (OVERLAPS) 297/484 variables, 187/207 constraints. Problems are: Problem set: 29 solved, 251 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 0/207 constraints. Problems are: Problem set: 29 solved, 251 unsolved
At refinement iteration 8 (OVERLAPS) 0/484 variables, 0/207 constraints. Problems are: Problem set: 29 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 484/484 variables, and 207 constraints, problems are : Problem set: 29 solved, 251 unsolved in 9558 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 29 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 29 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 10/15 constraints. Problems are: Problem set: 29 solved, 251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/15 constraints. Problems are: Problem set: 29 solved, 251 unsolved
At refinement iteration 3 (OVERLAPS) 1/187 variables, 3/18 constraints. Problems are: Problem set: 29 solved, 251 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 2/20 constraints. Problems are: Problem set: 29 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/20 constraints. Problems are: Problem set: 29 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 297/484 variables, 187/207 constraints. Problems are: Problem set: 29 solved, 251 unsolved
Problem TDEAD82 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 251/458 constraints. Problems are: Problem set: 30 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 0/458 constraints. Problems are: Problem set: 30 solved, 250 unsolved
At refinement iteration 9 (OVERLAPS) 0/484 variables, 0/458 constraints. Problems are: Problem set: 30 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 484/484 variables, and 458 constraints, problems are : Problem set: 30 solved, 250 unsolved in 20732 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 251/280 constraints, Known Traps: 2/2 constraints]
After SMT, in 30402ms problems are : Problem set: 30 solved, 250 unsolved
Search for dead transitions found 30 dead transitions in 30406ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 187/187 places, 267/297 transitions.
Ensure Unique test removed 1 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 9 rules applied. Total rules applied 9 place count 186 transition count 259
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 178 transition count 259
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 176 transition count 257
Applied a total of 21 rules in 16 ms. Remains 176 /187 variables (removed 11) and now considering 257/267 (removed 10) transitions.
// Phase 1: matrix 257 rows 176 cols
[2025-05-29 17:40:08] [INFO ] Computed 21 invariants in 2 ms
[2025-05-29 17:40:08] [INFO ] Implicit Places using invariants in 97 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 175/187 places, 257/297 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 175 transition count 250
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 168 transition count 250
Applied a total of 14 rules in 5 ms. Remains 168 /175 variables (removed 7) and now considering 250/257 (removed 7) transitions.
// Phase 1: matrix 250 rows 168 cols
[2025-05-29 17:40:08] [INFO ] Computed 20 invariants in 2 ms
[2025-05-29 17:40:08] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-05-29 17:40:08] [INFO ] Invariant cache hit.
[2025-05-29 17:40:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-29 17:40:08] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 168/187 places, 250/297 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 31160 ms. Remains : 168/187 places, 250/297 transitions.
[2025-05-29 17:40:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (32868 resets) in 1195 ms. (836 steps per ms)
BEST_FIRST walk for 3000003 steps (31481 resets) in 1605 ms. (1867 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-29 17:40:11] [INFO ] Invariant cache hit.
[2025-05-29 17:40:11] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-05-29 17:40:11] [INFO ] [Real]Absence check using 11 positive and 9 generalized place invariants in 1 ms returned sat
[2025-05-29 17:40:11] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2025-05-29 17:40:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-29 17:40:11] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-05-29 17:40:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-05-29 17:40:11] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-29 17:40:11] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2025-05-29 17:40:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-05-29 17:40:11] [INFO ] Computed and/alt/rep : 137/514/137 causal constraints (skipped 96 transitions) in 15 ms.
[2025-05-29 17:40:11] [INFO ] Added : 32 causal constraints over 7 iterations in 122 ms. Result :sat
Minimization took 94 ms.
[2025-05-29 17:40:11] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-05-29 17:40:11] [INFO ] [Real]Absence check using 11 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-29 17:40:11] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2025-05-29 17:40:11] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-05-29 17:40:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-05-29 17:40:11] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-29 17:40:11] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2025-05-29 17:40:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-05-29 17:40:11] [INFO ] Computed and/alt/rep : 137/514/137 causal constraints (skipped 96 transitions) in 14 ms.
[2025-05-29 17:40:12] [INFO ] Added : 31 causal constraints over 7 iterations in 117 ms. Result :sat
Minimization took 81 ms.
[2025-05-29 17:40:12] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-05-29 17:40:12] [INFO ] [Real]Absence check using 11 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-29 17:40:12] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2025-05-29 17:40:12] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-05-29 17:40:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-05-29 17:40:12] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 1 ms returned sat
[2025-05-29 17:40:12] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2025-05-29 17:40:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-05-29 17:40:12] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2025-05-29 17:40:12] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2025-05-29 17:40:12] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2025-05-29 17:40:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 230 ms
[2025-05-29 17:40:12] [INFO ] Computed and/alt/rep : 137/514/137 causal constraints (skipped 96 transitions) in 13 ms.
[2025-05-29 17:40:12] [INFO ] Added : 78 causal constraints over 16 iterations in 291 ms. Result :sat
Minimization took 105 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 250/250 transitions.
Applied a total of 0 rules in 15 ms. Remains 168 /168 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 168/168 places, 250/250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 250/250 transitions.
Applied a total of 0 rules in 3 ms. Remains 168 /168 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2025-05-29 17:40:13] [INFO ] Invariant cache hit.
[2025-05-29 17:40:13] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-05-29 17:40:13] [INFO ] Invariant cache hit.
[2025-05-29 17:40:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-29 17:40:13] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2025-05-29 17:40:13] [INFO ] Redundant transitions in 1 ms returned []
Running 233 sub problems to find dead transitions.
[2025-05-29 17:40:13] [INFO ] Invariant cache hit.
[2025-05-29 17:40:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2025-05-29 17:40:14] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2025-05-29 17:40:14] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD232 is UNSAT
[2025-05-29 17:40:15] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
[2025-05-29 17:40:15] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
[2025-05-29 17:40:15] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD249 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 5/23 constraints. Problems are: Problem set: 16 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/23 constraints. Problems are: Problem set: 16 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 1/168 variables, 2/25 constraints. Problems are: Problem set: 16 solved, 217 unsolved
[2025-05-29 17:40:16] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2025-05-29 17:40:17] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 2/27 constraints. Problems are: Problem set: 16 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/27 constraints. Problems are: Problem set: 16 solved, 217 unsolved
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
At refinement iteration 7 (OVERLAPS) 250/418 variables, 168/195 constraints. Problems are: Problem set: 43 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 1/196 constraints. Problems are: Problem set: 43 solved, 190 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 0/196 constraints. Problems are: Problem set: 43 solved, 190 unsolved
At refinement iteration 10 (OVERLAPS) 0/418 variables, 0/196 constraints. Problems are: Problem set: 43 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 196 constraints, problems are : Problem set: 43 solved, 190 unsolved in 8717 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 168/168 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 43 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 9/9 constraints. Problems are: Problem set: 43 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 9/18 constraints. Problems are: Problem set: 43 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 5/23 constraints. Problems are: Problem set: 43 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/23 constraints. Problems are: Problem set: 43 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 1/168 variables, 2/25 constraints. Problems are: Problem set: 43 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 2/27 constraints. Problems are: Problem set: 43 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/27 constraints. Problems are: Problem set: 43 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 250/418 variables, 168/195 constraints. Problems are: Problem set: 43 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 1/196 constraints. Problems are: Problem set: 43 solved, 190 unsolved
Problem TDEAD53 is UNSAT
Problem TDEAD59 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 190/386 constraints. Problems are: Problem set: 45 solved, 188 unsolved
[2025-05-29 17:40:25] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 1/387 constraints. Problems are: Problem set: 46 solved, 187 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 0/387 constraints. Problems are: Problem set: 46 solved, 187 unsolved
At refinement iteration 12 (OVERLAPS) 0/418 variables, 0/387 constraints. Problems are: Problem set: 46 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 387 constraints, problems are : Problem set: 46 solved, 187 unsolved in 12349 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 168/168 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 190/233 constraints, Known Traps: 8/8 constraints]
After SMT, in 21151ms problems are : Problem set: 46 solved, 187 unsolved
Search for dead transitions found 46 dead transitions in 21153ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 168/168 places, 204/250 transitions.
Ensure Unique test removed 9 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 157 transition count 191
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 37 place count 144 transition count 191
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 37 place count 144 transition count 190
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 39 place count 143 transition count 190
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 143 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 142 transition count 189
Applied a total of 41 rules in 17 ms. Remains 142 /168 variables (removed 26) and now considering 189/204 (removed 15) transitions.
// Phase 1: matrix 189 rows 142 cols
[2025-05-29 17:40:34] [INFO ] Computed 20 invariants in 1 ms
[2025-05-29 17:40:34] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-05-29 17:40:34] [INFO ] Invariant cache hit.
[2025-05-29 17:40:34] [INFO ] Implicit Places using invariants and state equation in 189 ms returned [11, 12, 72]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 319 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 139/168 places, 189/250 transitions.
Applied a total of 0 rules in 3 ms. Remains 139 /139 variables (removed 0) and now considering 189/189 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 21786 ms. Remains : 139/168 places, 189/250 transitions.
// Phase 1: matrix 189 rows 139 cols
[2025-05-29 17:40:34] [INFO ] Computed 18 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (33259 resets) in 1120 ms. (892 steps per ms)
BEST_FIRST walk for 3000001 steps (31535 resets) in 1561 ms. (1920 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-29 17:40:37] [INFO ] Invariant cache hit.
[2025-05-29 17:40:37] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-29 17:40:37] [INFO ] [Real]Absence check using 6 positive and 12 generalized place invariants in 6 ms returned sat
[2025-05-29 17:40:37] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2025-05-29 17:40:37] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2025-05-29 17:40:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-29 17:40:37] [INFO ] [Nat]Absence check using 6 positive and 12 generalized place invariants in 2 ms returned sat
[2025-05-29 17:40:37] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2025-05-29 17:40:37] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2025-05-29 17:40:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2025-05-29 17:40:37] [INFO ] Computed and/alt/rep : 92/310/92 causal constraints (skipped 80 transitions) in 8 ms.
[2025-05-29 17:40:38] [INFO ] Added : 27 causal constraints over 6 iterations in 73 ms. Result :sat
Minimization took 61 ms.
[2025-05-29 17:40:38] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-29 17:40:38] [INFO ] [Real]Absence check using 6 positive and 12 generalized place invariants in 2 ms returned sat
[2025-05-29 17:40:38] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2025-05-29 17:40:38] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2025-05-29 17:40:38] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-29 17:40:38] [INFO ] [Nat]Absence check using 6 positive and 12 generalized place invariants in 2 ms returned sat
[2025-05-29 17:40:38] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2025-05-29 17:40:38] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2025-05-29 17:40:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2025-05-29 17:40:38] [INFO ] Computed and/alt/rep : 92/310/92 causal constraints (skipped 80 transitions) in 8 ms.
[2025-05-29 17:40:38] [INFO ] Added : 52 causal constraints over 11 iterations in 136 ms. Result :sat
Minimization took 78 ms.
[2025-05-29 17:40:38] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-05-29 17:40:38] [INFO ] [Real]Absence check using 6 positive and 12 generalized place invariants in 3 ms returned sat
[2025-05-29 17:40:38] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2025-05-29 17:40:38] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2025-05-29 17:40:38] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-29 17:40:38] [INFO ] [Nat]Absence check using 6 positive and 12 generalized place invariants in 3 ms returned sat
[2025-05-29 17:40:38] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2025-05-29 17:40:38] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2025-05-29 17:40:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2025-05-29 17:40:38] [INFO ] Computed and/alt/rep : 92/310/92 causal constraints (skipped 80 transitions) in 8 ms.
[2025-05-29 17:40:38] [INFO ] Added : 27 causal constraints over 6 iterations in 84 ms. Result :sat
Minimization took 156 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 189/189 transitions.
Applied a total of 0 rules in 4 ms. Remains 139 /139 variables (removed 0) and now considering 189/189 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 139/139 places, 189/189 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 189/189 transitions.
Applied a total of 0 rules in 9 ms. Remains 139 /139 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2025-05-29 17:40:39] [INFO ] Invariant cache hit.
[2025-05-29 17:40:39] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-05-29 17:40:39] [INFO ] Invariant cache hit.
[2025-05-29 17:40:39] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2025-05-29 17:40:39] [INFO ] Redundant transitions in 7 ms returned []
Running 172 sub problems to find dead transitions.
[2025-05-29 17:40:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (OVERLAPS) 1/139 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2025-05-29 17:40:41] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
At refinement iteration 7 (OVERLAPS) 189/328 variables, 139/158 constraints. Problems are: Problem set: 7 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 0/158 constraints. Problems are: Problem set: 7 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/328 variables, 0/158 constraints. Problems are: Problem set: 7 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 158 constraints, problems are : Problem set: 7 solved, 165 unsolved in 5190 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 7 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 3/3 constraints. Problems are: Problem set: 7 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 9/12 constraints. Problems are: Problem set: 7 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/12 constraints. Problems are: Problem set: 7 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 1/139 variables, 3/15 constraints. Problems are: Problem set: 7 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 3/18 constraints. Problems are: Problem set: 7 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 1/19 constraints. Problems are: Problem set: 7 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/19 constraints. Problems are: Problem set: 7 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 189/328 variables, 139/158 constraints. Problems are: Problem set: 7 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 165/323 constraints. Problems are: Problem set: 7 solved, 165 unsolved
[2025-05-29 17:40:46] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2025-05-29 17:40:47] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2025-05-29 17:40:47] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2025-05-29 17:40:47] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 4/327 constraints. Problems are: Problem set: 7 solved, 165 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 0/327 constraints. Problems are: Problem set: 7 solved, 165 unsolved
At refinement iteration 11 (OVERLAPS) 0/328 variables, 0/327 constraints. Problems are: Problem set: 7 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 327 constraints, problems are : Problem set: 7 solved, 165 unsolved in 9446 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 165/172 constraints, Known Traps: 5/5 constraints]
After SMT, in 14703ms problems are : Problem set: 7 solved, 165 unsolved
Search for dead transitions found 7 dead transitions in 14705ms
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 : 139/139 places, 182/189 transitions.
Ensure Unique test removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 136 transition count 176
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 130 transition count 176
Applied a total of 15 rules in 11 ms. Remains 130 /139 variables (removed 9) and now considering 176/182 (removed 6) transitions.
// Phase 1: matrix 176 rows 130 cols
[2025-05-29 17:40:54] [INFO ] Computed 20 invariants in 2 ms
[2025-05-29 17:40:54] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-05-29 17:40:54] [INFO ] Invariant cache hit.
[2025-05-29 17:40:54] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 130/139 places, 176/189 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 15322 ms. Remains : 130/139 places, 176/189 transitions.
[2025-05-29 17:40:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (33123 resets) in 1144 ms. (873 steps per ms)
BEST_FIRST walk for 3000003 steps (31641 resets) in 1628 ms. (1841 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-29 17:40:57] [INFO ] Invariant cache hit.
[2025-05-29 17:40:57] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-05-29 17:40:57] [INFO ] [Real]Absence check using 9 positive and 11 generalized place invariants in 3 ms returned sat
[2025-05-29 17:40:57] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2025-05-29 17:40:57] [INFO ] Computed and/alt/rep : 79/250/79 causal constraints (skipped 80 transitions) in 11 ms.
[2025-05-29 17:40:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:57] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-05-29 17:40:57] [INFO ] [Nat]Absence check using 9 positive and 11 generalized place invariants in 3 ms returned sat
[2025-05-29 17:40:57] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2025-05-29 17:40:57] [INFO ] Computed and/alt/rep : 79/250/79 causal constraints (skipped 80 transitions) in 10 ms.
[2025-05-29 17:40:57] [INFO ] Added : 19 causal constraints over 5 iterations in 71 ms. Result :sat
Minimization took 83 ms.
[2025-05-29 17:40:57] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-05-29 17:40:57] [INFO ] [Real]Absence check using 9 positive and 11 generalized place invariants in 2 ms returned sat
[2025-05-29 17:40:57] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2025-05-29 17:40:57] [INFO ] Computed and/alt/rep : 79/250/79 causal constraints (skipped 80 transitions) in 9 ms.
[2025-05-29 17:40:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:57] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-05-29 17:40:57] [INFO ] [Nat]Absence check using 9 positive and 11 generalized place invariants in 2 ms returned sat
[2025-05-29 17:40:57] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2025-05-29 17:40:57] [INFO ] Computed and/alt/rep : 79/250/79 causal constraints (skipped 80 transitions) in 8 ms.
[2025-05-29 17:40:57] [INFO ] Added : 20 causal constraints over 5 iterations in 63 ms. Result :sat
Minimization took 79 ms.
[2025-05-29 17:40:58] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-05-29 17:40:58] [INFO ] [Real]Absence check using 9 positive and 11 generalized place invariants in 2 ms returned sat
[2025-05-29 17:40:58] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2025-05-29 17:40:58] [INFO ] Computed and/alt/rep : 79/250/79 causal constraints (skipped 80 transitions) in 9 ms.
[2025-05-29 17:40:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-05-29 17:40:58] [INFO ] [Nat]Absence check using 9 positive and 11 generalized place invariants in 2 ms returned sat
[2025-05-29 17:40:58] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2025-05-29 17:40:58] [INFO ] Computed and/alt/rep : 79/250/79 causal constraints (skipped 80 transitions) in 8 ms.
[2025-05-29 17:40:58] [INFO ] Added : 37 causal constraints over 8 iterations in 102 ms. Result :sat
Minimization took 81 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
FORMULA ASLink-PT-02b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-02b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 130 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p413) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 175/175 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 0 with 2 rules applied. Total rules applied 2 place count 130 transition count 173
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 128 transition count 173
Applied a total of 4 rules in 4 ms. Remains 128 /130 variables (removed 2) and now considering 173/175 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 128/130 places, 173/175 transitions.
// Phase 1: matrix 173 rows 128 cols
[2025-05-29 17:40:58] [INFO ] Computed 20 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (33400 resets) in 1154 ms. (865 steps per ms)
BEST_FIRST walk for 1000001 steps (10553 resets) in 532 ms. (1876 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-29 17:41:00] [INFO ] Invariant cache hit.
[2025-05-29 17:41:00] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-05-29 17:41:00] [INFO ] [Real]Absence check using 9 positive and 11 generalized place invariants in 2 ms returned sat
[2025-05-29 17:41:00] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2025-05-29 17:41:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2025-05-29 17:41:00] [INFO ] [Nat]Absence check using 9 positive and 11 generalized place invariants in 3 ms returned sat
[2025-05-29 17:41:00] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2025-05-29 17:41:00] [INFO ] Computed and/alt/rep : 76/247/76 causal constraints (skipped 80 transitions) in 10 ms.
[2025-05-29 17:41:00] [INFO ] Added : 34 causal constraints over 7 iterations in 97 ms. Result :sat
Minimization took 63 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 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 173/173 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 128/128 places, 173/173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 173/173 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2025-05-29 17:41:00] [INFO ] Invariant cache hit.
[2025-05-29 17:41:00] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-05-29 17:41:00] [INFO ] Invariant cache hit.
[2025-05-29 17:41:00] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2025-05-29 17:41:00] [INFO ] Redundant transitions in 2 ms returned []
Running 156 sub problems to find dead transitions.
[2025-05-29 17:41:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2025-05-29 17:41:02] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2025-05-29 17:41:02] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2025-05-29 17:41:02] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 173/301 variables, 128/151 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (OVERLAPS) 0/301 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 151 constraints, problems are : Problem set: 0 solved, 156 unsolved in 4238 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 173/301 variables, 128/151 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 156/307 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (OVERLAPS) 0/301 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 307 constraints, problems are : Problem set: 0 solved, 156 unsolved in 6279 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 3/3 constraints]
After SMT, in 10574ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 10577ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10790 ms. Remains : 128/128 places, 173/173 transitions.
RANDOM walk for 40000 steps (1344 resets) in 1013 ms. (39 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (401 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (402 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
[2025-05-29 17:41:12] [INFO ] Flatten gal took : 118 ms
[2025-05-29 17:41:12] [INFO ] Flatten gal took : 56 ms
Finished probabilistic random walk after 21850 steps, run visited all 2 properties in 284 ms. (steps per millisecond=76 )
Probabilistic random walk after 21850 steps, saw 15496 distinct states, run finished after 287 ms. (steps per millisecond=76 ) properties seen :2
[2025-05-29 17:41:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16591180109954983993.gal : 8 ms
[2025-05-29 17:41:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12654316561747222063.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16591180109954983993.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12654316561747222063.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
FORMULA ASLink-PT-02b-UpperBounds-10 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 234632 ms.

BK_STOP 1748540472255

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="gold2024"
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-5832"
echo " Executing tool gold2024"
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 r013-tall-174853743000039"
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 ;