Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r004-smll-171620117700029.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is ASLink-PT-02a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620117700029
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 11 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 18:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 279K May 18 16:42 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

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

=== Now, execution of the tool begins

BK_START 1716220516406

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-20 15:55:18] [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]
[2024-05-20 15:55:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 15:55:19] [INFO ] Load time of PNML (sax parser for PT used): 308 ms
[2024-05-20 15:55:19] [INFO ] Transformed 626 places.
[2024-05-20 15:55:19] [INFO ] Transformed 1008 transitions.
[2024-05-20 15:55:19] [INFO ] Found NUPN structural information;
[2024-05-20 15:55:19] [INFO ] Parsed PT model containing 626 places and 1008 transitions and 3820 arcs in 571 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 27 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
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 998 rows 626 cols
[2024-05-20 15:55:19] [INFO ] Computed 118 invariants in 106 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 (118 resets) in 119 ms. (83 steps per ms)
FORMULA ASLink-PT-02a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (160 resets) in 165 ms. (301 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-05-20 15:55:20] [INFO ] Invariant cache hit.
[2024-05-20 15:55:20] [INFO ] [Real]Absence check using 28 positive place invariants in 27 ms returned sat
[2024-05-20 15:55:20] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 41 ms returned sat
[2024-05-20 15:55:21] [INFO ] [Real]Absence check using state equation in 761 ms returned sat
[2024-05-20 15:55:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 15:55:21] [INFO ] [Nat]Absence check using 28 positive place invariants in 29 ms returned sat
[2024-05-20 15:55:22] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 43 ms returned sat
[2024-05-20 15:55:22] [INFO ] [Nat]Absence check using state equation in 551 ms returned sat
[2024-05-20 15:55:22] [INFO ] Computed and/alt/rep : 362/1378/362 causal constraints (skipped 635 transitions) in 130 ms.
[2024-05-20 15:55:26] [INFO ] Added : 160 causal constraints over 32 iterations in 4015 ms. Result :sat
Minimization took 44 ms.
[2024-05-20 15:55:26] [INFO ] [Real]Absence check using 28 positive place invariants in 32 ms returned sat
[2024-05-20 15:55:27] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 46 ms returned sat
[2024-05-20 15:55:27] [INFO ] [Real]Absence check using state equation in 741 ms returned sat
[2024-05-20 15:55:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 15:55:28] [INFO ] [Nat]Absence check using 28 positive place invariants in 33 ms returned sat
[2024-05-20 15:55:28] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 57 ms returned sat
[2024-05-20 15:55:28] [INFO ] [Nat]Absence check using state equation in 721 ms returned sat
[2024-05-20 15:55:29] [INFO ] Computed and/alt/rep : 362/1378/362 causal constraints (skipped 635 transitions) in 177 ms.
[2024-05-20 15:55:32] [INFO ] Added : 170 causal constraints over 34 iterations in 3823 ms. Result :unknown
[2024-05-20 15:55:33] [INFO ] [Real]Absence check using 28 positive place invariants in 33 ms returned sat
[2024-05-20 15:55:33] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 81 ms returned sat
[2024-05-20 15:55:34] [INFO ] [Real]Absence check using state equation in 846 ms returned sat
[2024-05-20 15:55:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 15:55:34] [INFO ] [Nat]Absence check using 28 positive place invariants in 36 ms returned sat
[2024-05-20 15:55:34] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 60 ms returned sat
[2024-05-20 15:55:35] [INFO ] [Nat]Absence check using state equation in 801 ms returned sat
[2024-05-20 15:55:35] [INFO ] Computed and/alt/rep : 362/1378/362 causal constraints (skipped 635 transitions) in 143 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-20 15:55:39] [INFO ] [Real]Absence check using 28 positive place invariants in 31 ms returned sat
[2024-05-20 15:55:39] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 58 ms returned sat
[2024-05-20 15:55:40] [INFO ] [Real]Absence check using state equation in 671 ms returned sat
[2024-05-20 15:55:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 15:55:40] [INFO ] [Nat]Absence check using 28 positive place invariants in 29 ms returned sat
[2024-05-20 15:55:40] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 48 ms returned sat
[2024-05-20 15:55:41] [INFO ] [Nat]Absence check using state equation in 562 ms returned sat
[2024-05-20 15:55:41] [INFO ] Computed and/alt/rep : 362/1378/362 causal constraints (skipped 635 transitions) in 124 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:[1, 1, 0, 1] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 998/998 transitions.
Ensure Unique test removed 8 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 614 transition count 948
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 112 place count 564 transition count 948
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 112 place count 564 transition count 899
Deduced a syphon composed of 49 places in 3 ms
Ensure Unique test removed 19 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 117 rules applied. Total rules applied 229 place count 496 transition count 899
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 2 with 1 rules applied. Total rules applied 230 place count 496 transition count 898
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 231 place count 495 transition count 898
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 236 place count 490 transition count 875
Ensure Unique test removed 1 places
Iterating global reduction 4 with 6 rules applied. Total rules applied 242 place count 489 transition count 875
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 5 rules applied. Total rules applied 247 place count 488 transition count 871
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 250 place count 486 transition count 870
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 251 place count 485 transition count 870
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 252 place count 484 transition count 862
Iterating global reduction 7 with 1 rules applied. Total rules applied 253 place count 484 transition count 862
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 254 place count 483 transition count 854
Iterating global reduction 7 with 1 rules applied. Total rules applied 255 place count 483 transition count 854
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 256 place count 482 transition count 846
Iterating global reduction 7 with 1 rules applied. Total rules applied 257 place count 482 transition count 846
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 258 place count 481 transition count 838
Iterating global reduction 7 with 1 rules applied. Total rules applied 259 place count 481 transition count 838
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 260 place count 480 transition count 830
Iterating global reduction 7 with 1 rules applied. Total rules applied 261 place count 480 transition count 830
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 262 place count 479 transition count 822
Iterating global reduction 7 with 1 rules applied. Total rules applied 263 place count 479 transition count 822
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 264 place count 478 transition count 814
Iterating global reduction 7 with 1 rules applied. Total rules applied 265 place count 478 transition count 814
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 266 place count 477 transition count 806
Iterating global reduction 7 with 1 rules applied. Total rules applied 267 place count 477 transition count 806
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 268 place count 476 transition count 798
Iterating global reduction 7 with 1 rules applied. Total rules applied 269 place count 476 transition count 798
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 270 place count 475 transition count 790
Iterating global reduction 7 with 1 rules applied. Total rules applied 271 place count 475 transition count 790
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 272 place count 474 transition count 782
Iterating global reduction 7 with 1 rules applied. Total rules applied 273 place count 474 transition count 782
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 274 place count 473 transition count 774
Iterating global reduction 7 with 1 rules applied. Total rules applied 275 place count 473 transition count 774
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 276 place count 472 transition count 766
Iterating global reduction 7 with 1 rules applied. Total rules applied 277 place count 472 transition count 766
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 278 place count 471 transition count 758
Iterating global reduction 7 with 1 rules applied. Total rules applied 279 place count 471 transition count 758
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 280 place count 470 transition count 750
Iterating global reduction 7 with 1 rules applied. Total rules applied 281 place count 470 transition count 750
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 282 place count 469 transition count 742
Iterating global reduction 7 with 1 rules applied. Total rules applied 283 place count 469 transition count 742
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 311 place count 455 transition count 728
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 312 place count 455 transition count 727
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 313 place count 454 transition count 727
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 316 place count 454 transition count 727
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 317 place count 453 transition count 726
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 320 place count 450 transition count 726
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 5 Pre rules applied. Total rules applied 320 place count 450 transition count 721
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 330 place count 445 transition count 721
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 9 with 2 rules applied. Total rules applied 332 place count 443 transition count 721
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 10 with 4 rules applied. Total rules applied 336 place count 441 transition count 719
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 338 place count 439 transition count 717
Iterating global reduction 10 with 2 rules applied. Total rules applied 340 place count 439 transition count 717
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 342 place count 439 transition count 715
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 344 place count 437 transition count 715
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 346 place count 437 transition count 715
Applied a total of 346 rules in 969 ms. Remains 437 /626 variables (removed 189) and now considering 715/998 (removed 283) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 986 ms. Remains : 437/626 places, 715/998 transitions.
// Phase 1: matrix 715 rows 437 cols
[2024-05-20 15:55:47] [INFO ] Computed 80 invariants in 22 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 0, 1] Max Struct:[1, 1, 1, 1]
FORMULA ASLink-PT-02a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (16423 resets) in 2395 ms. (417 steps per ms)
BEST_FIRST walk for 1000001 steps (5599 resets) in 1251 ms. (798 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-20 15:55:51] [INFO ] Invariant cache hit.
[2024-05-20 15:55:51] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-20 15:55:51] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 23 ms returned sat
[2024-05-20 15:55:51] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2024-05-20 15:55:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 15:55:51] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-20 15:55:51] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 27 ms returned sat
[2024-05-20 15:55:52] [INFO ] [Nat]Absence check using state equation in 559 ms returned sat
[2024-05-20 15:55:52] [INFO ] Computed and/alt/rep : 271/1066/271 causal constraints (skipped 427 transitions) in 84 ms.
[2024-05-20 15:55:55] [INFO ] Added : 207 causal constraints over 42 iterations in 3255 ms. Result :sat
Minimization took 666 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 437 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p103) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 714/714 transitions.
Graph (complete) has 1850 edges and 437 vertex of which 436 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output 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 2 place count 436 transition count 713
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 434 transition count 713
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 434 transition count 710
Deduced a syphon composed of 3 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 11 place count 430 transition count 710
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 429 transition count 710
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 429 transition count 709
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 428 transition count 709
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 427 transition count 708
Applied a total of 16 rules in 102 ms. Remains 427 /437 variables (removed 10) and now considering 708/714 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 427/437 places, 708/714 transitions.
// Phase 1: matrix 708 rows 427 cols
[2024-05-20 15:55:56] [INFO ] Computed 76 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (16161 resets) in 2005 ms. (498 steps per ms)
BEST_FIRST walk for 1000000 steps (5641 resets) in 899 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-20 15:55:59] [INFO ] Invariant cache hit.
[2024-05-20 15:55:59] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-20 15:55:59] [INFO ] [Real]Absence check using 19 positive and 57 generalized place invariants in 21 ms returned sat
[2024-05-20 15:55:59] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2024-05-20 15:55:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 15:55:59] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2024-05-20 15:56:00] [INFO ] [Nat]Absence check using 19 positive and 57 generalized place invariants in 26 ms returned sat
[2024-05-20 15:56:00] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2024-05-20 15:56:00] [INFO ] Computed and/alt/rep : 264/1056/264 causal constraints (skipped 427 transitions) in 65 ms.
[2024-05-20 15:56:02] [INFO ] Added : 177 causal constraints over 36 iterations in 2350 ms. Result :sat
Minimization took 977 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 427 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 708/708 transitions.
Applied a total of 0 rules in 30 ms. Remains 427 /427 variables (removed 0) and now considering 708/708 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 427/427 places, 708/708 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 708/708 transitions.
Applied a total of 0 rules in 28 ms. Remains 427 /427 variables (removed 0) and now considering 708/708 (removed 0) transitions.
[2024-05-20 15:56:04] [INFO ] Invariant cache hit.
[2024-05-20 15:56:05] [INFO ] Implicit Places using invariants in 810 ms returned [0, 18, 19, 30, 48, 66, 134, 138, 147, 148, 149, 167, 185, 254, 258, 259, 262, 273, 274, 275, 293, 295, 298, 316, 317, 318, 319, 331, 337, 343, 349, 355, 361, 367, 373, 379, 385, 391]
[2024-05-20 15:56:05] [INFO ] Actually due to overlaps returned [293, 275, 30, 48, 149, 167, 298, 148, 274, 317, 147, 273, 295, 316, 0, 258, 259, 18, 19, 66, 185, 319, 361, 379, 391, 262, 318, 331, 337, 343, 349, 355, 367, 373, 385]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 819 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 392/427 places, 708/708 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 390 transition count 647
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 124 place count 329 transition count 647
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 124 place count 329 transition count 632
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 155 place count 313 transition count 632
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 2 with 12 rules applied. Total rules applied 167 place count 309 transition count 624
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 175 place count 301 transition count 624
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 190 place count 286 transition count 609
Iterating global reduction 4 with 15 rules applied. Total rules applied 205 place count 286 transition count 609
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 208 place count 286 transition count 606
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 208 place count 286 transition count 605
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 210 place count 285 transition count 605
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 213 place count 282 transition count 602
Iterating global reduction 5 with 3 rules applied. Total rules applied 216 place count 282 transition count 602
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 217 place count 281 transition count 601
Iterating global reduction 5 with 1 rules applied. Total rules applied 218 place count 281 transition count 601
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 219 place count 280 transition count 600
Iterating global reduction 5 with 1 rules applied. Total rules applied 220 place count 280 transition count 600
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 270 place count 255 transition count 575
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 272 place count 255 transition count 573
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 274 place count 253 transition count 571
Iterating global reduction 6 with 2 rules applied. Total rules applied 276 place count 253 transition count 571
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 278 place count 253 transition count 569
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 282 place count 253 transition count 565
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 287 place count 248 transition count 565
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 294 place count 248 transition count 565
Applied a total of 294 rules in 162 ms. Remains 248 /392 variables (removed 144) and now considering 565/708 (removed 143) transitions.
// Phase 1: matrix 565 rows 248 cols
[2024-05-20 15:56:05] [INFO ] Computed 33 invariants in 8 ms
[2024-05-20 15:56:05] [INFO ] Implicit Places using invariants in 406 ms returned [72, 89, 95, 98, 100, 101, 104, 105, 157, 174, 180, 183, 185]
[2024-05-20 15:56:05] [INFO ] Actually due to overlaps returned [104, 105, 89, 95, 100, 101, 174, 180, 185, 72, 157]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 409 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 237/427 places, 565/708 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 229 transition count 557
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 229 transition count 557
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 227 transition count 555
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 227 transition count 555
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 0 with 8 rules applied. Total rules applied 28 place count 223 transition count 551
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 223 transition count 545
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 217 transition count 545
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 217 transition count 543
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 215 transition count 543
Applied a total of 44 rules in 69 ms. Remains 215 /237 variables (removed 22) and now considering 543/565 (removed 22) transitions.
// Phase 1: matrix 543 rows 215 cols
[2024-05-20 15:56:05] [INFO ] Computed 22 invariants in 5 ms
[2024-05-20 15:56:06] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-20 15:56:06] [INFO ] Invariant cache hit.
[2024-05-20 15:56:06] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 1066 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 215/427 places, 543/708 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2563 ms. Remains : 215/427 places, 543/708 transitions.
[2024-05-20 15:56:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (24050 resets) in 1778 ms. (562 steps per ms)
BEST_FIRST walk for 1000001 steps (10014 resets) in 792 ms. (1261 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-20 15:56:09] [INFO ] Invariant cache hit.
[2024-05-20 15:56:09] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-05-20 15:56:09] [INFO ] [Real]Absence check using 9 positive and 13 generalized place invariants in 10 ms returned sat
[2024-05-20 15:56:09] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2024-05-20 15:56:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 15:56:09] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-05-20 15:56:09] [INFO ] [Nat]Absence check using 9 positive and 13 generalized place invariants in 9 ms returned sat
[2024-05-20 15:56:10] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2024-05-20 15:56:10] [INFO ] Computed and/alt/rep : 90/514/90 causal constraints (skipped 439 transitions) in 69 ms.
[2024-05-20 15:56:10] [INFO ] Added : 41 causal constraints over 9 iterations in 701 ms. Result :sat
Minimization took 535 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 215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 543/543 transitions.
Applied a total of 0 rules in 15 ms. Remains 215 /215 variables (removed 0) and now considering 543/543 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 215/215 places, 543/543 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 543/543 transitions.
Applied a total of 0 rules in 15 ms. Remains 215 /215 variables (removed 0) and now considering 543/543 (removed 0) transitions.
[2024-05-20 15:56:11] [INFO ] Invariant cache hit.
[2024-05-20 15:56:11] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-05-20 15:56:11] [INFO ] Invariant cache hit.
[2024-05-20 15:56:12] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 999 ms to find 0 implicit places.
[2024-05-20 15:56:12] [INFO ] Redundant transitions in 57 ms returned []
Running 529 sub problems to find dead transitions.
[2024-05-20 15:56:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 3 (OVERLAPS) 2/215 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 529 unsolved
[2024-05-20 15:56:30] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 18 ms to minimize.
[2024-05-20 15:56:32] [INFO ] Deduced a trap composed of 81 places in 198 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 7 (OVERLAPS) 543/758 variables, 215/239 constraints. Problems are: Problem set: 0 solved, 529 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 758/758 variables, and 239 constraints, problems are : Problem set: 0 solved, 529 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 529/529 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 529 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 3 (OVERLAPS) 2/215 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 529 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem 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 TDEAD27 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 TDEAD35 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 TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 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 TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem 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 TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
At refinement iteration 7 (OVERLAPS) 543/758 variables, 215/239 constraints. Problems are: Problem set: 209 solved, 320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 758/758 variables, and 559 constraints, problems are : Problem set: 209 solved, 320 unsolved in 30110 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 320/529 constraints, Known Traps: 2/2 constraints]
After SMT, in 60884ms problems are : Problem set: 209 solved, 320 unsolved
Search for dead transitions found 209 dead transitions in 60928ms
Found 209 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 209 transitions
Dead transitions reduction (with SMT) removed 209 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 215/215 places, 334/543 transitions.
Applied a total of 0 rules in 6 ms. Remains 215 /215 variables (removed 0) and now considering 334/334 (removed 0) transitions.
[2024-05-20 15:57:13] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62062 ms. Remains : 215/215 places, 334/543 transitions.
// Phase 1: matrix 334 rows 215 cols
[2024-05-20 15:57:13] [INFO ] Computed 22 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (23924 resets) in 1724 ms. (579 steps per ms)
BEST_FIRST walk for 1000001 steps (9986 resets) in 716 ms. (1394 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-20 15:57:16] [INFO ] Invariant cache hit.
[2024-05-20 15:57:16] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-05-20 15:57:16] [INFO ] [Real]Absence check using 7 positive and 15 generalized place invariants in 9 ms returned sat
[2024-05-20 15:57:16] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2024-05-20 15:57:16] [INFO ] Computed and/alt/rep : 141/615/141 causal constraints (skipped 179 transitions) in 31 ms.
[2024-05-20 15:57:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 15:57:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-05-20 15:57:16] [INFO ] [Nat]Absence check using 7 positive and 15 generalized place invariants in 11 ms returned sat
[2024-05-20 15:57:16] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2024-05-20 15:57:16] [INFO ] Computed and/alt/rep : 141/615/141 causal constraints (skipped 179 transitions) in 42 ms.
[2024-05-20 15:57:17] [INFO ] Added : 57 causal constraints over 12 iterations in 582 ms. Result :sat
Minimization took 312 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 215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 334/334 transitions.
Applied a total of 0 rules in 9 ms. Remains 215 /215 variables (removed 0) and now considering 334/334 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 215/215 places, 334/334 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 334/334 transitions.
Applied a total of 0 rules in 8 ms. Remains 215 /215 variables (removed 0) and now considering 334/334 (removed 0) transitions.
[2024-05-20 15:57:17] [INFO ] Invariant cache hit.
[2024-05-20 15:57:18] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-20 15:57:18] [INFO ] Invariant cache hit.
[2024-05-20 15:57:19] [INFO ] Implicit Places using invariants and state equation in 868 ms returned [1, 22, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136]
Discarding 30 places :
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT with State Equation took 1213 ms to find 30 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 185/215 places, 332/334 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 185 transition count 330
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 183 transition count 330
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 0 with 14 rules applied. Total rules applied 18 place count 183 transition count 328
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 32 place count 169 transition count 328
Applied a total of 32 rules in 18 ms. Remains 169 /185 variables (removed 16) and now considering 328/332 (removed 4) transitions.
// Phase 1: matrix 328 rows 169 cols
[2024-05-20 15:57:19] [INFO ] Computed 16 invariants in 8 ms
[2024-05-20 15:57:19] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-20 15:57:19] [INFO ] Invariant cache hit.
[2024-05-20 15:57:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-20 15:57:19] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 801 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 169/215 places, 328/334 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2040 ms. Remains : 169/215 places, 328/334 transitions.
[2024-05-20 15:57:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (24062 resets) in 1546 ms. (646 steps per ms)
BEST_FIRST walk for 1000001 steps (10085 resets) in 685 ms. (1457 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-20 15:57:22] [INFO ] Invariant cache hit.
[2024-05-20 15:57:22] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-20 15:57:22] [INFO ] [Real]Absence check using 8 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-20 15:57:22] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-20 15:57:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 15:57:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2024-05-20 15:57:22] [INFO ] [Nat]Absence check using 8 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-20 15:57:22] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-20 15:57:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-20 15:57:22] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2024-05-20 15:57:22] [INFO ] Computed and/alt/rep : 124/594/124 causal constraints (skipped 190 transitions) in 40 ms.
[2024-05-20 15:57:22] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 3 ms to minimize.
[2024-05-20 15:57:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2024-05-20 15:57:23] [INFO ] Added : 23 causal constraints over 5 iterations in 493 ms. Result :sat
Minimization took 231 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 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 328/328 transitions.
Applied a total of 0 rules in 6 ms. Remains 169 /169 variables (removed 0) and now considering 328/328 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 169/169 places, 328/328 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 328/328 transitions.
Applied a total of 0 rules in 7 ms. Remains 169 /169 variables (removed 0) and now considering 328/328 (removed 0) transitions.
[2024-05-20 15:57:23] [INFO ] Invariant cache hit.
[2024-05-20 15:57:23] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-20 15:57:23] [INFO ] Invariant cache hit.
[2024-05-20 15:57:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-20 15:57:24] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 989 ms to find 0 implicit places.
[2024-05-20 15:57:24] [INFO ] Redundant transitions in 81 ms returned []
Running 314 sub problems to find dead transitions.
[2024-05-20 15:57:24] [INFO ] Invariant cache hit.
[2024-05-20 15:57:24] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (OVERLAPS) 1/168 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-05-20 15:57:30] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 1/17 constraints. Problems are: Problem set: 1 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 313 unsolved
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
At refinement iteration 7 (OVERLAPS) 328/496 variables, 168/185 constraints. Problems are: Problem set: 88 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 4/189 constraints. Problems are: Problem set: 88 solved, 226 unsolved
[2024-05-20 15:57:37] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-20 15:57:38] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 2/191 constraints. Problems are: Problem set: 89 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/191 constraints. Problems are: Problem set: 89 solved, 225 unsolved
At refinement iteration 11 (OVERLAPS) 1/497 variables, 1/192 constraints. Problems are: Problem set: 89 solved, 225 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/497 variables, 0/192 constraints. Problems are: Problem set: 89 solved, 225 unsolved
At refinement iteration 13 (OVERLAPS) 0/497 variables, 0/192 constraints. Problems are: Problem set: 89 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 192 constraints, problems are : Problem set: 89 solved, 225 unsolved in 30001 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 169/169 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 89 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 5/5 constraints. Problems are: Problem set: 89 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 6/11 constraints. Problems are: Problem set: 89 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 1/12 constraints. Problems are: Problem set: 89 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/12 constraints. Problems are: Problem set: 89 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 1/168 variables, 3/15 constraints. Problems are: Problem set: 89 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 2/17 constraints. Problems are: Problem set: 89 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 2/19 constraints. Problems are: Problem set: 89 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/19 constraints. Problems are: Problem set: 89 solved, 225 unsolved
Problem TDEAD61 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
At refinement iteration 8 (OVERLAPS) 328/496 variables, 168/187 constraints. Problems are: Problem set: 137 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 4/191 constraints. Problems are: Problem set: 137 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 176/367 constraints. Problems are: Problem set: 137 solved, 177 unsolved
[2024-05-20 15:58:05] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 3 ms to minimize.
[2024-05-20 15:58:07] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 2/369 constraints. Problems are: Problem set: 137 solved, 177 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 0/369 constraints. Problems are: Problem set: 137 solved, 177 unsolved
At refinement iteration 13 (OVERLAPS) 1/497 variables, 1/370 constraints. Problems are: Problem set: 137 solved, 177 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/497 variables, 1/371 constraints. Problems are: Problem set: 137 solved, 177 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/497 variables, 0/371 constraints. Problems are: Problem set: 137 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/497 variables, and 371 constraints, problems are : Problem set: 137 solved, 177 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 169/169 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 177/314 constraints, Known Traps: 5/5 constraints]
After SMT, in 60283ms problems are : Problem set: 137 solved, 177 unsolved
Search for dead transitions found 137 dead transitions in 60291ms
Found 137 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 137 transitions
Dead transitions reduction (with SMT) removed 137 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 169/169 places, 191/328 transitions.
Ensure Unique test removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 154 transition count 162
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 73 place count 125 transition count 162
Applied a total of 73 rules in 5 ms. Remains 125 /169 variables (removed 44) and now considering 162/191 (removed 29) transitions.
// Phase 1: matrix 162 rows 125 cols
[2024-05-20 15:58:24] [INFO ] Computed 19 invariants in 2 ms
[2024-05-20 15:58:24] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-20 15:58:24] [INFO ] Invariant cache hit.
[2024-05-20 15:58:25] [INFO ] Implicit Places using invariants and state equation in 342 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 2 : 125/169 places, 162/328 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61873 ms. Remains : 125/169 places, 162/328 transitions.
[2024-05-20 15:58:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (38061 resets) in 1777 ms. (562 steps per ms)
BEST_FIRST walk for 1000000 steps (11796 resets) in 678 ms. (1472 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-20 15:58:27] [INFO ] Invariant cache hit.
[2024-05-20 15:58:27] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-20 15:58:27] [INFO ] [Real]Absence check using 12 positive and 7 generalized place invariants in 5 ms returned sat
[2024-05-20 15:58:27] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2024-05-20 15:58:27] [INFO ] Computed and/alt/rep : 70/209/70 causal constraints (skipped 78 transitions) in 19 ms.
[2024-05-20 15:58:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 15:58:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-20 15:58:28] [INFO ] [Nat]Absence check using 12 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-20 15:58:28] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2024-05-20 15:58:28] [INFO ] Computed and/alt/rep : 70/209/70 causal constraints (skipped 78 transitions) in 17 ms.
[2024-05-20 15:58:28] [INFO ] Added : 15 causal constraints over 4 iterations in 112 ms. Result :sat
Minimization took 115 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 162/162 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 125/125 places, 162/162 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 162/162 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2024-05-20 15:58:28] [INFO ] Invariant cache hit.
[2024-05-20 15:58:28] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-20 15:58:28] [INFO ] Invariant cache hit.
[2024-05-20 15:58:29] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
[2024-05-20 15:58:29] [INFO ] Redundant transitions in 2 ms returned []
Running 148 sub problems to find dead transitions.
[2024-05-20 15:58:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 2/125 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-20 15:58:31] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 162/287 variables, 125/145 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-20 15:58:35] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 146 constraints, problems are : Problem set: 0 solved, 148 unsolved in 9932 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 2/125 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 162/287 variables, 125/146 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 148/294 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 294 constraints, problems are : Problem set: 0 solved, 148 unsolved in 6909 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 2/2 constraints]
After SMT, in 16940ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 16943ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17537 ms. Remains : 125/125 places, 162/162 transitions.
[2024-05-20 15:58:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA ASLink-PT-02a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (37717 resets) in 1481 ms. (674 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-20 15:58:47] [INFO ] Flatten gal took : 70 ms
[2024-05-20 15:58:47] [INFO ] Flatten gal took : 27 ms
[2024-05-20 15:58:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality163198405665394432.gal : 14 ms
[2024-05-20 15:58:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2472994097709914064.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/ReachabilityCardinality163198405665394432.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2472994097709914064.prop' '--nowitness' '--gen-order' 'FOLLOW'

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

BK_STOP 1716220727886

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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-02a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ASLink-PT-02a, 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 r004-smll-171620117700029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02a.tgz
mv ASLink-PT-02a 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;