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.r003-smll-171620116900061.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 greatspnxred
Input is ASLink-PT-04a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620116900061
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 860K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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 22K May 19 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 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 436K 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-04a-UpperBounds-00
FORMULA_NAME ASLink-PT-04a-UpperBounds-01
FORMULA_NAME ASLink-PT-04a-UpperBounds-02
FORMULA_NAME ASLink-PT-04a-UpperBounds-03
FORMULA_NAME ASLink-PT-04a-UpperBounds-04
FORMULA_NAME ASLink-PT-04a-UpperBounds-05
FORMULA_NAME ASLink-PT-04a-UpperBounds-06
FORMULA_NAME ASLink-PT-04a-UpperBounds-07
FORMULA_NAME ASLink-PT-04a-UpperBounds-08
FORMULA_NAME ASLink-PT-04a-UpperBounds-09
FORMULA_NAME ASLink-PT-04a-UpperBounds-10
FORMULA_NAME ASLink-PT-04a-UpperBounds-11
FORMULA_NAME ASLink-PT-04a-UpperBounds-12
FORMULA_NAME ASLink-PT-04a-UpperBounds-13
FORMULA_NAME ASLink-PT-04a-UpperBounds-14
FORMULA_NAME ASLink-PT-04a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716258704568

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-04a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 02:31:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 02:31:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 02:31:46] [INFO ] Load time of PNML (sax parser for PT used): 256 ms
[2024-05-21 02:31:46] [INFO ] Transformed 1016 places.
[2024-05-21 02:31:46] [INFO ] Transformed 1554 transitions.
[2024-05-21 02:31:46] [INFO ] Found NUPN structural information;
[2024-05-21 02:31:46] [INFO ] Parsed PT model containing 1016 places and 1554 transitions and 5858 arcs in 453 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 16 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 1538 rows 1016 cols
[2024-05-21 02:31:46] [INFO ] Computed 194 invariants in 123 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 (75 resets) in 93 ms. (106 steps per ms)
FORMULA ASLink-PT-04a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (46 resets) in 112 ms. (354 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-05-21 02:31:47] [INFO ] Invariant cache hit.
[2024-05-21 02:31:48] [INFO ] [Real]Absence check using 46 positive place invariants in 41 ms returned sat
[2024-05-21 02:31:48] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 73 ms returned sat
[2024-05-21 02:31:49] [INFO ] [Real]Absence check using state equation in 849 ms returned sat
[2024-05-21 02:31:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:31:49] [INFO ] [Nat]Absence check using 46 positive place invariants in 37 ms returned sat
[2024-05-21 02:31:49] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 72 ms returned sat
[2024-05-21 02:31:50] [INFO ] [Nat]Absence check using state equation in 833 ms returned sat
[2024-05-21 02:31:50] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 196 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2024-05-21 02:31:54] [INFO ] [Real]Absence check using 46 positive place invariants in 36 ms returned sat
[2024-05-21 02:31:54] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 79 ms returned sat
[2024-05-21 02:31:55] [INFO ] [Real]Absence check using state equation in 864 ms returned sat
[2024-05-21 02:31:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:31:55] [INFO ] [Nat]Absence check using 46 positive place invariants in 34 ms returned sat
[2024-05-21 02:31:56] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 58 ms returned sat
[2024-05-21 02:31:57] [INFO ] [Nat]Absence check using state equation in 1016 ms returned sat
[2024-05-21 02:31:57] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 157 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-21 02:32:01] [INFO ] [Real]Absence check using 46 positive place invariants in 33 ms returned sat
[2024-05-21 02:32:01] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 65 ms returned sat
[2024-05-21 02:32:01] [INFO ] [Real]Absence check using state equation in 844 ms returned sat
[2024-05-21 02:32:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:32:02] [INFO ] [Nat]Absence check using 46 positive place invariants in 36 ms returned sat
[2024-05-21 02:32:02] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 159 ms returned sat
[2024-05-21 02:32:03] [INFO ] [Nat]Absence check using state equation in 1062 ms returned sat
[2024-05-21 02:32:03] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 324 ms.
[2024-05-21 02:32:07] [INFO ] Added : 145 causal constraints over 29 iterations in 3353 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 1016 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1016/1016 places, 1538/1538 transitions.
Ensure Unique test removed 16 places
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 992 transition count 1450
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 200 place count 904 transition count 1450
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 88 Pre rules applied. Total rules applied 200 place count 904 transition count 1362
Deduced a syphon composed of 88 places in 4 ms
Ensure Unique test removed 34 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 210 rules applied. Total rules applied 410 place count 782 transition count 1362
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 411 place count 782 transition count 1361
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 412 place count 781 transition count 1361
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 418 place count 775 transition count 1332
Ensure Unique test removed 1 places
Iterating global reduction 4 with 7 rules applied. Total rules applied 425 place count 774 transition count 1332
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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 431 place count 773 transition count 1327
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 434 place count 770 transition count 1327
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 435 place count 769 transition count 1319
Iterating global reduction 6 with 1 rules applied. Total rules applied 436 place count 769 transition count 1319
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 437 place count 768 transition count 1311
Iterating global reduction 6 with 1 rules applied. Total rules applied 438 place count 768 transition count 1311
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 439 place count 767 transition count 1303
Iterating global reduction 6 with 1 rules applied. Total rules applied 440 place count 767 transition count 1303
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 441 place count 766 transition count 1295
Iterating global reduction 6 with 1 rules applied. Total rules applied 442 place count 766 transition count 1295
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 443 place count 765 transition count 1287
Iterating global reduction 6 with 1 rules applied. Total rules applied 444 place count 765 transition count 1287
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 445 place count 764 transition count 1279
Iterating global reduction 6 with 1 rules applied. Total rules applied 446 place count 764 transition count 1279
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 447 place count 763 transition count 1271
Iterating global reduction 6 with 1 rules applied. Total rules applied 448 place count 763 transition count 1271
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 449 place count 762 transition count 1263
Iterating global reduction 6 with 1 rules applied. Total rules applied 450 place count 762 transition count 1263
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 451 place count 761 transition count 1255
Iterating global reduction 6 with 1 rules applied. Total rules applied 452 place count 761 transition count 1255
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 453 place count 760 transition count 1247
Iterating global reduction 6 with 1 rules applied. Total rules applied 454 place count 760 transition count 1247
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 455 place count 759 transition count 1239
Iterating global reduction 6 with 1 rules applied. Total rules applied 456 place count 759 transition count 1239
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 457 place count 758 transition count 1231
Iterating global reduction 6 with 1 rules applied. Total rules applied 458 place count 758 transition count 1231
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 459 place count 757 transition count 1223
Iterating global reduction 6 with 1 rules applied. Total rules applied 460 place count 757 transition count 1223
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 461 place count 756 transition count 1215
Iterating global reduction 6 with 1 rules applied. Total rules applied 462 place count 756 transition count 1215
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 463 place count 755 transition count 1207
Iterating global reduction 6 with 1 rules applied. Total rules applied 464 place count 755 transition count 1207
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 465 place count 754 transition count 1199
Iterating global reduction 6 with 1 rules applied. Total rules applied 466 place count 754 transition count 1199
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 522 place count 726 transition count 1171
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 525 place count 726 transition count 1168
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 528 place count 723 transition count 1168
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 532 place count 723 transition count 1168
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 533 place count 722 transition count 1167
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 541 place count 714 transition count 1167
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 16 Pre rules applied. Total rules applied 541 place count 714 transition count 1151
Deduced a syphon composed of 16 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 33 rules applied. Total rules applied 574 place count 697 transition count 1151
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 8 with 5 rules applied. Total rules applied 579 place count 692 transition count 1151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 579 place count 692 transition count 1150
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 581 place count 691 transition count 1150
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 591 place count 686 transition count 1145
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 595 place count 682 transition count 1141
Iterating global reduction 9 with 4 rules applied. Total rules applied 599 place count 682 transition count 1141
Free-agglomeration rule applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 603 place count 682 transition count 1137
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 608 place count 678 transition count 1136
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 611 place count 678 transition count 1136
Applied a total of 611 rules in 1459 ms. Remains 678 /1016 variables (removed 338) and now considering 1136/1538 (removed 402) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1476 ms. Remains : 678/1016 places, 1136/1538 transitions.
// Phase 1: matrix 1136 rows 678 cols
[2024-05-21 02:32:10] [INFO ] Computed 120 invariants in 33 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (12984 resets) in 2932 ms. (340 steps per ms)
BEST_FIRST walk for 3000001 steps (8941 resets) in 3760 ms. (797 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-05-21 02:32:17] [INFO ] Invariant cache hit.
[2024-05-21 02:32:17] [INFO ] [Real]Absence check using 29 positive place invariants in 17 ms returned sat
[2024-05-21 02:32:17] [INFO ] [Real]Absence check using 29 positive and 91 generalized place invariants in 35 ms returned sat
[2024-05-21 02:32:17] [INFO ] [Real]Absence check using state equation in 636 ms returned sat
[2024-05-21 02:32:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:32:18] [INFO ] [Nat]Absence check using 29 positive place invariants in 16 ms returned sat
[2024-05-21 02:32:18] [INFO ] [Nat]Absence check using 29 positive and 91 generalized place invariants in 36 ms returned sat
[2024-05-21 02:32:18] [INFO ] [Nat]Absence check using state equation in 540 ms returned sat
[2024-05-21 02:32:19] [INFO ] Computed and/alt/rep : 447/1724/447 causal constraints (skipped 663 transitions) in 264 ms.
[2024-05-21 02:32:25] [INFO ] Deduced a trap composed of 23 places in 343 ms of which 28 ms to minimize.
[2024-05-21 02:32:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 508 ms
[2024-05-21 02:32:25] [INFO ] Added : 332 causal constraints over 67 iterations in 7071 ms. Result :sat
Minimization took 1077 ms.
[2024-05-21 02:32:27] [INFO ] [Real]Absence check using 29 positive place invariants in 14 ms returned sat
[2024-05-21 02:32:27] [INFO ] [Real]Absence check using 29 positive and 91 generalized place invariants in 28 ms returned sat
[2024-05-21 02:32:27] [INFO ] [Real]Absence check using state equation in 493 ms returned sat
[2024-05-21 02:32:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:32:27] [INFO ] [Nat]Absence check using 29 positive place invariants in 16 ms returned sat
[2024-05-21 02:32:27] [INFO ] [Nat]Absence check using 29 positive and 91 generalized place invariants in 35 ms returned sat
[2024-05-21 02:32:28] [INFO ] [Nat]Absence check using state equation in 487 ms returned sat
[2024-05-21 02:32:28] [INFO ] Computed and/alt/rep : 447/1724/447 causal constraints (skipped 663 transitions) in 94 ms.
[2024-05-21 02:32:33] [INFO ] Added : 296 causal constraints over 60 iterations in 4580 ms. Result :sat
Minimization took 1124 ms.
[2024-05-21 02:32:34] [INFO ] [Real]Absence check using 29 positive place invariants in 22 ms returned sat
[2024-05-21 02:32:34] [INFO ] [Real]Absence check using 29 positive and 91 generalized place invariants in 28 ms returned sat
[2024-05-21 02:32:34] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2024-05-21 02:32:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:32:35] [INFO ] [Nat]Absence check using 29 positive place invariants in 17 ms returned sat
[2024-05-21 02:32:35] [INFO ] [Nat]Absence check using 29 positive and 91 generalized place invariants in 27 ms returned sat
[2024-05-21 02:32:35] [INFO ] [Nat]Absence check using state equation in 544 ms returned sat
[2024-05-21 02:32:35] [INFO ] Computed and/alt/rep : 447/1724/447 causal constraints (skipped 663 transitions) in 124 ms.
[2024-05-21 02:32:38] [INFO ] Added : 107 causal constraints over 22 iterations in 2598 ms. Result :sat
Minimization took 1150 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 678/678 places, 1136/1136 transitions.
Applied a total of 0 rules in 36 ms. Remains 678 /678 variables (removed 0) and now considering 1136/1136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 678/678 places, 1136/1136 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 678/678 places, 1136/1136 transitions.
Applied a total of 0 rules in 29 ms. Remains 678 /678 variables (removed 0) and now considering 1136/1136 (removed 0) transitions.
[2024-05-21 02:32:41] [INFO ] Invariant cache hit.
[2024-05-21 02:32:41] [INFO ] Implicit Places using invariants in 867 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 148, 149, 169, 187, 206, 225, 258, 263, 264, 275, 276, 277, 295, 313, 382, 386, 387, 398, 399, 400, 418, 436, 505, 509, 510, 513, 524, 525, 526, 544, 546, 549, 567, 568, 569, 570, 582, 588, 594, 600, 606, 612, 618, 624, 630, 636, 642]
[2024-05-21 02:32:42] [INFO ] Actually due to overlaps returned [544, 526, 30, 48, 169, 277, 295, 400, 418, 549, 149, 276, 399, 525, 568, 148, 275, 398, 524, 546, 567, 0, 263, 264, 386, 387, 509, 510, 18, 19, 66, 313, 436, 570, 612, 630, 642, 187, 206, 258, 513, 569, 582, 588, 594, 600, 606, 618, 624, 636]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 875 ms to find 50 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 628/678 places, 1136/1136 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 624 transition count 1053
Reduce places removed 83 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 84 rules applied. Total rules applied 171 place count 541 transition count 1052
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 172 place count 540 transition count 1052
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 172 place count 540 transition count 1028
Deduced a syphon composed of 24 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 49 rules applied. Total rules applied 221 place count 515 transition count 1028
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 233 place count 511 transition count 1020
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 241 place count 503 transition count 1020
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 256 place count 488 transition count 1005
Iterating global reduction 5 with 15 rules applied. Total rules applied 271 place count 488 transition count 1005
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 274 place count 488 transition count 1002
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 274 place count 488 transition count 1001
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 276 place count 487 transition count 1001
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 279 place count 484 transition count 998
Iterating global reduction 6 with 3 rules applied. Total rules applied 282 place count 484 transition count 998
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 283 place count 483 transition count 997
Iterating global reduction 6 with 1 rules applied. Total rules applied 284 place count 483 transition count 997
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 285 place count 482 transition count 996
Iterating global reduction 6 with 1 rules applied. Total rules applied 286 place count 482 transition count 996
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 366 place count 442 transition count 956
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 369 place count 442 transition count 953
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 373 place count 438 transition count 948
Iterating global reduction 7 with 4 rules applied. Total rules applied 377 place count 438 transition count 948
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 380 place count 438 transition count 945
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 381 place count 438 transition count 944
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 382 place count 437 transition count 944
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 9 with 8 rules applied. Total rules applied 390 place count 437 transition count 936
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 399 place count 428 transition count 936
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 10 with 13 rules applied. Total rules applied 412 place count 428 transition count 936
Applied a total of 412 rules in 336 ms. Remains 428 /628 variables (removed 200) and now considering 936/1136 (removed 200) transitions.
// Phase 1: matrix 936 rows 428 cols
[2024-05-21 02:32:42] [INFO ] Computed 60 invariants in 13 ms
[2024-05-21 02:32:42] [INFO ] Implicit Places using invariants in 509 ms returned [72, 89, 95, 98, 100, 101, 104, 105, 181, 187, 190, 192, 197, 198, 250, 268, 274, 277, 279, 284, 285, 337, 354, 360, 363, 365]
[2024-05-21 02:32:42] [INFO ] Actually due to overlaps returned [104, 197, 284, 105, 198, 285, 89, 95, 100, 101, 181, 187, 192, 268, 274, 279, 354, 360, 365, 72, 250, 337]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 513 ms to find 22 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 406/678 places, 936/1136 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 390 transition count 920
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 390 transition count 920
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 386 transition count 916
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 386 transition count 916
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 54 place count 379 transition count 909
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 66 place count 379 transition count 897
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 78 place count 367 transition count 897
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 81 place count 367 transition count 894
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 84 place count 364 transition count 894
Applied a total of 84 rules in 115 ms. Remains 364 /406 variables (removed 42) and now considering 894/936 (removed 42) transitions.
// Phase 1: matrix 894 rows 364 cols
[2024-05-21 02:32:42] [INFO ] Computed 38 invariants in 11 ms
[2024-05-21 02:32:43] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-05-21 02:32:43] [INFO ] Invariant cache hit.
[2024-05-21 02:32:44] [INFO ] Implicit Places using invariants and state equation in 982 ms returned []
Implicit Place search using SMT with State Equation took 1386 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 364/678 places, 894/1136 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3260 ms. Remains : 364/678 places, 894/1136 transitions.
[2024-05-21 02:32:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (19414 resets) in 2025 ms. (493 steps per ms)
BEST_FIRST walk for 3000002 steps (17339 resets) in 2593 ms. (1156 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-05-21 02:32:48] [INFO ] Invariant cache hit.
[2024-05-21 02:32:49] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-21 02:32:49] [INFO ] [Real]Absence check using 9 positive and 29 generalized place invariants in 15 ms returned sat
[2024-05-21 02:32:49] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2024-05-21 02:32:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:32:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-21 02:32:49] [INFO ] [Nat]Absence check using 9 positive and 29 generalized place invariants in 14 ms returned sat
[2024-05-21 02:32:49] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2024-05-21 02:32:49] [INFO ] Computed and/alt/rep : 193/933/193 causal constraints (skipped 679 transitions) in 76 ms.
[2024-05-21 02:32:50] [INFO ] Added : 16 causal constraints over 5 iterations in 518 ms. Result :sat
Minimization took 598 ms.
[2024-05-21 02:32:51] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-21 02:32:51] [INFO ] [Real]Absence check using 9 positive and 29 generalized place invariants in 16 ms returned sat
[2024-05-21 02:32:51] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2024-05-21 02:32:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:32:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-21 02:32:51] [INFO ] [Nat]Absence check using 9 positive and 29 generalized place invariants in 14 ms returned sat
[2024-05-21 02:32:51] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2024-05-21 02:32:52] [INFO ] Computed and/alt/rep : 193/933/193 causal constraints (skipped 679 transitions) in 67 ms.
[2024-05-21 02:32:52] [INFO ] Added : 11 causal constraints over 3 iterations in 290 ms. Result :sat
Minimization took 518 ms.
[2024-05-21 02:32:52] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-21 02:32:52] [INFO ] [Real]Absence check using 9 positive and 29 generalized place invariants in 15 ms returned sat
[2024-05-21 02:32:53] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2024-05-21 02:32:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:32:53] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-21 02:32:53] [INFO ] [Nat]Absence check using 9 positive and 29 generalized place invariants in 11 ms returned sat
[2024-05-21 02:32:53] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2024-05-21 02:32:53] [INFO ] Computed and/alt/rep : 193/933/193 causal constraints (skipped 679 transitions) in 66 ms.
[2024-05-21 02:32:54] [INFO ] Added : 23 causal constraints over 5 iterations in 399 ms. Result :sat
Minimization took 526 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 894/894 transitions.
Applied a total of 0 rules in 13 ms. Remains 364 /364 variables (removed 0) and now considering 894/894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 364/364 places, 894/894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 894/894 transitions.
Applied a total of 0 rules in 13 ms. Remains 364 /364 variables (removed 0) and now considering 894/894 (removed 0) transitions.
[2024-05-21 02:32:54] [INFO ] Invariant cache hit.
[2024-05-21 02:32:55] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-05-21 02:32:55] [INFO ] Invariant cache hit.
[2024-05-21 02:32:56] [INFO ] Implicit Places using invariants and state equation in 1043 ms returned []
Implicit Place search using SMT with State Equation took 1442 ms to find 0 implicit places.
[2024-05-21 02:32:56] [INFO ] Redundant transitions in 60 ms returned []
Running 872 sub problems to find dead transitions.
[2024-05-21 02:32:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 872 unsolved
[2024-05-21 02:33:06] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 3 ms to minimize.
[2024-05-21 02:33:12] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 2 ms to minimize.
Problem TDEAD660 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD669 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 2/34 constraints. Problems are: Problem set: 4 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/1258 variables, and 34 constraints, problems are : Problem set: 4 solved, 868 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 6/9 constraints, Generalized P Invariants (flows): 26/29 constraints, State Equation: 0/364 constraints, PredecessorRefiner: 872/872 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 4 solved, 868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 26/32 constraints. Problems are: Problem set: 4 solved, 868 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 2/34 constraints. Problems are: Problem set: 4 solved, 868 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 0/34 constraints. Problems are: Problem set: 4 solved, 868 unsolved
At refinement iteration 4 (OVERLAPS) 1/364 variables, 3/37 constraints. Problems are: Problem set: 4 solved, 868 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 3/40 constraints. Problems are: Problem set: 4 solved, 868 unsolved
[2024-05-21 02:33:45] [INFO ] Deduced a trap composed of 90 places in 345 ms of which 9 ms to minimize.
[2024-05-21 02:33:46] [INFO ] Deduced a trap composed of 103 places in 315 ms of which 4 ms to minimize.
[2024-05-21 02:33:47] [INFO ] Deduced a trap composed of 13 places in 287 ms of which 7 ms to minimize.
[2024-05-21 02:33:53] [INFO ] Deduced a trap composed of 77 places in 308 ms of which 5 ms to minimize.
[2024-05-21 02:33:54] [INFO ] Deduced a trap composed of 77 places in 330 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 5/45 constraints. Problems are: Problem set: 4 solved, 868 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/1258 variables, and 45 constraints, problems are : Problem set: 4 solved, 868 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/364 constraints, PredecessorRefiner: 0/872 constraints, Known Traps: 7/7 constraints]
After SMT, in 60925ms problems are : Problem set: 4 solved, 868 unsolved
Search for dead transitions found 4 dead transitions in 60957ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 364/364 places, 890/894 transitions.
Applied a total of 0 rules in 14 ms. Remains 364 /364 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2024-05-21 02:33:57] [INFO ] Redundant transitions in 93 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62619 ms. Remains : 364/364 places, 890/894 transitions.
// Phase 1: matrix 890 rows 364 cols
[2024-05-21 02:33:57] [INFO ] Computed 38 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (19547 resets) in 2013 ms. (496 steps per ms)
BEST_FIRST walk for 3000003 steps (17298 resets) in 2568 ms. (1167 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-05-21 02:34:02] [INFO ] Invariant cache hit.
[2024-05-21 02:34:02] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-21 02:34:02] [INFO ] [Real]Absence check using 9 positive and 29 generalized place invariants in 14 ms returned sat
[2024-05-21 02:34:02] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2024-05-21 02:34:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:34:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-21 02:34:02] [INFO ] [Nat]Absence check using 9 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-21 02:34:03] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2024-05-21 02:34:03] [INFO ] Computed and/alt/rep : 192/947/192 causal constraints (skipped 676 transitions) in 68 ms.
[2024-05-21 02:34:03] [INFO ] Added : 21 causal constraints over 5 iterations in 429 ms. Result :sat
Minimization took 594 ms.
[2024-05-21 02:34:04] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-21 02:34:04] [INFO ] [Real]Absence check using 9 positive and 29 generalized place invariants in 14 ms returned sat
[2024-05-21 02:34:04] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2024-05-21 02:34:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:34:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-05-21 02:34:04] [INFO ] [Nat]Absence check using 9 positive and 29 generalized place invariants in 14 ms returned sat
[2024-05-21 02:34:05] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2024-05-21 02:34:05] [INFO ] Computed and/alt/rep : 192/947/192 causal constraints (skipped 676 transitions) in 68 ms.
[2024-05-21 02:34:05] [INFO ] Added : 11 causal constraints over 3 iterations in 270 ms. Result :sat
Minimization took 580 ms.
[2024-05-21 02:34:06] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-21 02:34:06] [INFO ] [Real]Absence check using 9 positive and 29 generalized place invariants in 15 ms returned sat
[2024-05-21 02:34:06] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2024-05-21 02:34:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:34:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-05-21 02:34:06] [INFO ] [Nat]Absence check using 9 positive and 29 generalized place invariants in 14 ms returned sat
[2024-05-21 02:34:06] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2024-05-21 02:34:06] [INFO ] Computed and/alt/rep : 192/947/192 causal constraints (skipped 676 transitions) in 68 ms.
[2024-05-21 02:34:07] [INFO ] Added : 27 causal constraints over 6 iterations in 462 ms. Result :sat
Minimization took 577 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 890/890 transitions.
Applied a total of 0 rules in 22 ms. Remains 364 /364 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 364/364 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 890/890 transitions.
Applied a total of 0 rules in 13 ms. Remains 364 /364 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2024-05-21 02:34:08] [INFO ] Invariant cache hit.
[2024-05-21 02:34:08] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-05-21 02:34:08] [INFO ] Invariant cache hit.
[2024-05-21 02:34:09] [INFO ] Implicit Places using invariants and state equation in 1045 ms returned []
Implicit Place search using SMT with State Equation took 1489 ms to find 0 implicit places.
[2024-05-21 02:34:09] [INFO ] Redundant transitions in 9 ms returned []
Running 868 sub problems to find dead transitions.
[2024-05-21 02:34:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-05-21 02:34:18] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 868 unsolved
SMT process timed out in 30568ms, After SMT, problems are : Problem set: 0 solved, 868 unsolved
Search for dead transitions found 0 dead transitions in 30580ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32101 ms. Remains : 364/364 places, 890/890 transitions.
[2024-05-21 02:34:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
FORMULA ASLink-PT-04a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (19479 resets) in 2044 ms. (488 steps per ms)
BEST_FIRST walk for 2000001 steps (11553 resets) in 1825 ms. (1095 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-05-21 02:34:44] [INFO ] Invariant cache hit.
[2024-05-21 02:34:44] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-21 02:34:44] [INFO ] [Real]Absence check using 9 positive and 29 generalized place invariants in 14 ms returned sat
[2024-05-21 02:34:44] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2024-05-21 02:34:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:34:44] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-21 02:34:44] [INFO ] [Nat]Absence check using 9 positive and 29 generalized place invariants in 15 ms returned sat
[2024-05-21 02:34:45] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2024-05-21 02:34:45] [INFO ] Computed and/alt/rep : 192/947/192 causal constraints (skipped 676 transitions) in 70 ms.
[2024-05-21 02:34:45] [INFO ] Added : 11 causal constraints over 3 iterations in 271 ms. Result :sat
Minimization took 594 ms.
[2024-05-21 02:34:46] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-21 02:34:46] [INFO ] [Real]Absence check using 9 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-21 02:34:46] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2024-05-21 02:34:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:34:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-21 02:34:46] [INFO ] [Nat]Absence check using 9 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-21 02:34:46] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2024-05-21 02:34:47] [INFO ] Computed and/alt/rep : 192/947/192 causal constraints (skipped 676 transitions) in 69 ms.
[2024-05-21 02:34:47] [INFO ] Added : 27 causal constraints over 6 iterations in 451 ms. Result :sat
Minimization took 576 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 890/890 transitions.
Applied a total of 0 rules in 18 ms. Remains 364 /364 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 364/364 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 890/890 transitions.
Applied a total of 0 rules in 13 ms. Remains 364 /364 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2024-05-21 02:34:48] [INFO ] Invariant cache hit.
[2024-05-21 02:34:48] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-05-21 02:34:48] [INFO ] Invariant cache hit.
[2024-05-21 02:34:49] [INFO ] Implicit Places using invariants and state equation in 1004 ms returned []
Implicit Place search using SMT with State Equation took 1420 ms to find 0 implicit places.
[2024-05-21 02:34:49] [INFO ] Redundant transitions in 10 ms returned []
Running 868 sub problems to find dead transitions.
[2024-05-21 02:34:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-05-21 02:34:58] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 868 unsolved
SMT process timed out in 30474ms, After SMT, problems are : Problem set: 0 solved, 868 unsolved
Search for dead transitions found 0 dead transitions in 30485ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31935 ms. Remains : 364/364 places, 890/890 transitions.
RANDOM walk for 40000 steps (832 resets) in 1263 ms. (31 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (229 resets) in 270 ms. (147 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (224 resets) in 215 ms. (185 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (237 resets) in 213 ms. (186 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (220 resets) in 161 ms. (246 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 147031 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 4
Probabilistic random walk after 147031 steps, saw 107651 distinct states, run finished after 3006 ms. (steps per millisecond=48 ) properties seen :0
[2024-05-21 02:35:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 7/89 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 177/266 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 38/304 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 60/364 variables, 11/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 890/1254 variables, 364/402 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1254 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1254 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1254/1254 variables, and 402 constraints, problems are : Problem set: 0 solved, 4 unsolved in 965 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 7/89 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 177/266 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 38/304 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 02:35:25] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 60/364 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/364 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 890/1254 variables, 364/403 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1254 variables, 4/407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1254 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/1254 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1254/1254 variables, and 407 constraints, problems are : Problem set: 0 solved, 4 unsolved in 918 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 1912ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1295 ms.
Support contains 2 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 890/890 transitions.
Applied a total of 0 rules in 12 ms. Remains 364 /364 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 364/364 places, 890/890 transitions.
RANDOM walk for 40000 steps (776 resets) in 351 ms. (113 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (224 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (226 resets) in 156 ms. (254 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (240 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (225 resets) in 144 ms. (275 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 143847 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 4
Probabilistic random walk after 143847 steps, saw 105308 distinct states, run finished after 3005 ms. (steps per millisecond=47 ) properties seen :0
[2024-05-21 02:35:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 7/89 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 177/266 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 38/304 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 60/364 variables, 11/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 890/1254 variables, 364/402 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1254 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1254 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1254/1254 variables, and 402 constraints, problems are : Problem set: 0 solved, 4 unsolved in 950 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 7/89 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 177/266 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 38/304 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 02:35:31] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 60/364 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/364 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 890/1254 variables, 364/403 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1254 variables, 4/407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1254 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/1254 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1254/1254 variables, and 407 constraints, problems are : Problem set: 0 solved, 4 unsolved in 924 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 1889ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1040 ms.
Support contains 2 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 890/890 transitions.
Applied a total of 0 rules in 13 ms. Remains 364 /364 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 364/364 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 890/890 transitions.
Applied a total of 0 rules in 12 ms. Remains 364 /364 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2024-05-21 02:35:33] [INFO ] Invariant cache hit.
[2024-05-21 02:35:34] [INFO ] Implicit Places using invariants in 391 ms returned []
[2024-05-21 02:35:34] [INFO ] Invariant cache hit.
[2024-05-21 02:35:35] [INFO ] Implicit Places using invariants and state equation in 1009 ms returned []
Implicit Place search using SMT with State Equation took 1404 ms to find 0 implicit places.
[2024-05-21 02:35:35] [INFO ] Redundant transitions in 9 ms returned []
Running 868 sub problems to find dead transitions.
[2024-05-21 02:35:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-05-21 02:35:43] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 868 unsolved
SMT process timed out in 30512ms, After SMT, problems are : Problem set: 0 solved, 868 unsolved
Search for dead transitions found 0 dead transitions in 30524ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31967 ms. Remains : 364/364 places, 890/890 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 12 ms. Remains 364 /364 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-21 02:36:05] [INFO ] Invariant cache hit.
[2024-05-21 02:36:05] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-21 02:36:05] [INFO ] [Real]Absence check using 9 positive and 29 generalized place invariants in 18 ms returned sat
[2024-05-21 02:36:06] [INFO ] After 602ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 02:36:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-05-21 02:36:06] [INFO ] [Nat]Absence check using 9 positive and 29 generalized place invariants in 16 ms returned sat
[2024-05-21 02:36:06] [INFO ] After 514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-21 02:36:07] [INFO ] After 713ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-21 02:36:07] [INFO ] After 984ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 1626 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[1, 1]
Starting property specific reduction for ASLink-PT-04a-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-05-21 02:36:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (193 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 10001 steps (61 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 02:36:07] [INFO ] Invariant cache hit.
[2024-05-21 02:36:07] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-21 02:36:07] [INFO ] [Real]Absence check using 9 positive and 29 generalized place invariants in 18 ms returned sat
[2024-05-21 02:36:07] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2024-05-21 02:36:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:36:07] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-21 02:36:07] [INFO ] [Nat]Absence check using 9 positive and 29 generalized place invariants in 15 ms returned sat
[2024-05-21 02:36:08] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2024-05-21 02:36:08] [INFO ] Computed and/alt/rep : 192/947/192 causal constraints (skipped 676 transitions) in 71 ms.
[2024-05-21 02:36:08] [INFO ] Added : 11 causal constraints over 3 iterations in 274 ms. Result :sat
Minimization took 502 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 364 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p494) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 889/889 transitions.
Reduce places removed 1 places and 1 transitions.
Graph (complete) has 2204 edges and 363 vertex of which 362 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 3 rules applied. Total rules applied 3 place count 362 transition count 887
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 361 transition count 887
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 361 transition count 886
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 360 transition count 886
Applied a total of 6 rules in 33 ms. Remains 360 /364 variables (removed 4) and now considering 886/889 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 360/364 places, 886/889 transitions.
// Phase 1: matrix 886 rows 360 cols
[2024-05-21 02:36:09] [INFO ] Computed 37 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (19576 resets) in 2194 ms. (455 steps per ms)
BEST_FIRST walk for 1000001 steps (5757 resets) in 907 ms. (1101 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 02:36:12] [INFO ] Invariant cache hit.
[2024-05-21 02:36:12] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-21 02:36:12] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-21 02:36:12] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2024-05-21 02:36:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:36:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-21 02:36:12] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-21 02:36:12] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2024-05-21 02:36:13] [INFO ] Computed and/alt/rep : 188/942/188 causal constraints (skipped 676 transitions) in 69 ms.
[2024-05-21 02:36:13] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
[2024-05-21 02:36:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2024-05-21 02:36:13] [INFO ] Added : 36 causal constraints over 9 iterations in 740 ms. Result :sat
Minimization took 525 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 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 886/886 transitions.
Applied a total of 0 rules in 12 ms. Remains 360 /360 variables (removed 0) and now considering 886/886 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 360/360 places, 886/886 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 886/886 transitions.
Applied a total of 0 rules in 11 ms. Remains 360 /360 variables (removed 0) and now considering 886/886 (removed 0) transitions.
[2024-05-21 02:36:14] [INFO ] Invariant cache hit.
[2024-05-21 02:36:14] [INFO ] Implicit Places using invariants in 457 ms returned []
[2024-05-21 02:36:14] [INFO ] Invariant cache hit.
[2024-05-21 02:36:15] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1505 ms to find 0 implicit places.
[2024-05-21 02:36:15] [INFO ] Redundant transitions in 9 ms returned []
Running 864 sub problems to find dead transitions.
[2024-05-21 02:36:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-05-21 02:36:24] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 864 unsolved
SMT process timed out in 30467ms, After SMT, problems are : Problem set: 0 solved, 864 unsolved
Search for dead transitions found 0 dead transitions in 30477ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32012 ms. Remains : 360/360 places, 886/886 transitions.
RANDOM walk for 40000 steps (769 resets) in 198 ms. (201 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (241 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (236 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 242503 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 2
Probabilistic random walk after 242503 steps, saw 176952 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
[2024-05-21 02:36:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/50 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 110/160 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 37/197 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 02:36:49] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 147/344 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/344 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 4/348 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/348 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 11/359 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/359 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 886/1245 variables, 359/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1245 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/1246 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1246 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1246 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1246/1246 variables, and 398 constraints, problems are : Problem set: 0 solved, 2 unsolved in 828 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/50 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 110/160 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 37/197 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 147/344 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/344 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 4/348 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/348 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 11/359 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/359 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 886/1245 variables, 359/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1245 variables, 2/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1245 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/1246 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1246 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1246 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1246/1246 variables, and 400 constraints, problems are : Problem set: 0 solved, 2 unsolved in 636 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1476ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 204 ms.
Support contains 1 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 886/886 transitions.
Applied a total of 0 rules in 12 ms. Remains 360 /360 variables (removed 0) and now considering 886/886 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 360/360 places, 886/886 transitions.
RANDOM walk for 40000 steps (775 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (228 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (241 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 245232 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 2
Probabilistic random walk after 245232 steps, saw 178943 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
[2024-05-21 02:36:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/50 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 110/160 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 37/197 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 02:36:54] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 147/344 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/344 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 4/348 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/348 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 11/359 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/359 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 886/1245 variables, 359/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1245 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/1246 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1246 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1246 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1246/1246 variables, and 398 constraints, problems are : Problem set: 0 solved, 2 unsolved in 803 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/50 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 110/160 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 37/197 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 147/344 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/344 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 4/348 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/348 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 11/359 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/359 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 886/1245 variables, 359/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1245 variables, 2/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1245 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/1246 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1246 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1246 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1246/1246 variables, and 400 constraints, problems are : Problem set: 0 solved, 2 unsolved in 630 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1445ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 188 ms.
Support contains 1 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 886/886 transitions.
Applied a total of 0 rules in 25 ms. Remains 360 /360 variables (removed 0) and now considering 886/886 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 360/360 places, 886/886 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 886/886 transitions.
Applied a total of 0 rules in 12 ms. Remains 360 /360 variables (removed 0) and now considering 886/886 (removed 0) transitions.
[2024-05-21 02:36:56] [INFO ] Invariant cache hit.
[2024-05-21 02:36:56] [INFO ] Implicit Places using invariants in 452 ms returned []
[2024-05-21 02:36:56] [INFO ] Invariant cache hit.
[2024-05-21 02:36:57] [INFO ] Implicit Places using invariants and state equation in 1020 ms returned []
Implicit Place search using SMT with State Equation took 1479 ms to find 0 implicit places.
[2024-05-21 02:36:57] [INFO ] Redundant transitions in 9 ms returned []
Running 864 sub problems to find dead transitions.
[2024-05-21 02:36:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-05-21 02:37:06] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 864 unsolved
SMT process timed out in 30462ms, After SMT, problems are : Problem set: 0 solved, 864 unsolved
Search for dead transitions found 0 dead transitions in 30471ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31980 ms. Remains : 360/360 places, 886/886 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 12 ms. Remains 360 /360 variables (removed 0) and now considering 886/886 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-21 02:37:28] [INFO ] Invariant cache hit.
[2024-05-21 02:37:28] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-21 02:37:28] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 16 ms returned sat
[2024-05-21 02:37:28] [INFO ] After 535ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 02:37:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-21 02:37:28] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 14 ms returned sat
[2024-05-21 02:37:29] [INFO ] After 371ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 02:37:29] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-21 02:37:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
TRAPS : Iteration 1
[2024-05-21 02:37:29] [INFO ] After 664ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 02:37:29] [INFO ] After 838ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1398 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for ASLink-PT-04a-UpperBounds-03 in 82170 ms.
Starting property specific reduction for ASLink-PT-04a-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 890 rows 364 cols
[2024-05-21 02:37:29] [INFO ] Computed 38 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (194 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10001 steps (56 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 02:37:29] [INFO ] Invariant cache hit.
[2024-05-21 02:37:29] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-21 02:37:29] [INFO ] [Real]Absence check using 9 positive and 29 generalized place invariants in 14 ms returned sat
[2024-05-21 02:37:29] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2024-05-21 02:37:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:37:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-21 02:37:29] [INFO ] [Nat]Absence check using 9 positive and 29 generalized place invariants in 15 ms returned sat
[2024-05-21 02:37:30] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2024-05-21 02:37:30] [INFO ] Computed and/alt/rep : 192/947/192 causal constraints (skipped 676 transitions) in 71 ms.
[2024-05-21 02:37:30] [INFO ] Added : 27 causal constraints over 6 iterations in 461 ms. Result :sat
Minimization took 515 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 364 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p311) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 889/889 transitions.
Reduce places removed 1 places and 1 transitions.
Graph (complete) has 2205 edges and 363 vertex of which 362 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 3 rules applied. Total rules applied 3 place count 362 transition count 887
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 361 transition count 887
Applied a total of 4 rules in 17 ms. Remains 361 /364 variables (removed 3) and now considering 887/889 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 361/364 places, 887/889 transitions.
// Phase 1: matrix 887 rows 361 cols
[2024-05-21 02:37:31] [INFO ] Computed 37 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (19438 resets) in 2151 ms. (464 steps per ms)
BEST_FIRST walk for 1000001 steps (5700 resets) in 903 ms. (1106 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 02:37:34] [INFO ] Invariant cache hit.
[2024-05-21 02:37:34] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-21 02:37:34] [INFO ] [Real]Absence check using 13 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-21 02:37:34] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2024-05-21 02:37:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:37:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-21 02:37:34] [INFO ] [Nat]Absence check using 13 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-21 02:37:35] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2024-05-21 02:37:35] [INFO ] Computed and/alt/rep : 189/943/189 causal constraints (skipped 676 transitions) in 71 ms.
[2024-05-21 02:37:35] [INFO ] Added : 36 causal constraints over 8 iterations in 583 ms. Result :sat
Minimization took 512 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 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 887/887 transitions.
Applied a total of 0 rules in 11 ms. Remains 361 /361 variables (removed 0) and now considering 887/887 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 361/361 places, 887/887 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 887/887 transitions.
Applied a total of 0 rules in 13 ms. Remains 361 /361 variables (removed 0) and now considering 887/887 (removed 0) transitions.
[2024-05-21 02:37:36] [INFO ] Invariant cache hit.
[2024-05-21 02:37:37] [INFO ] Implicit Places using invariants in 453 ms returned []
[2024-05-21 02:37:37] [INFO ] Invariant cache hit.
[2024-05-21 02:37:38] [INFO ] Implicit Places using invariants and state equation in 1048 ms returned []
Implicit Place search using SMT with State Equation took 1505 ms to find 0 implicit places.
[2024-05-21 02:37:38] [INFO ] Redundant transitions in 10 ms returned []
Running 865 sub problems to find dead transitions.
[2024-05-21 02:37:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 3 (OVERLAPS) 2/361 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 865 unsolved
[2024-05-21 02:38:03] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2024-05-21 02:38:06] [INFO ] Deduced a trap composed of 86 places in 331 ms of which 4 ms to minimize.
[2024-05-21 02:38:07] [INFO ] Deduced a trap composed of 101 places in 279 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/1248 variables, and 40 constraints, problems are : Problem set: 0 solved, 865 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/361 constraints, PredecessorRefiner: 865/865 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 865 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 3 (OVERLAPS) 2/361 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 865 unsolved
[2024-05-21 02:38:27] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 2 ms to minimize.
[2024-05-21 02:38:31] [INFO ] Deduced a trap composed of 70 places in 323 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 865 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/1248 variables, and 42 constraints, problems are : Problem set: 0 solved, 865 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/361 constraints, PredecessorRefiner: 0/865 constraints, Known Traps: 5/5 constraints]
After SMT, in 60492ms problems are : Problem set: 0 solved, 865 unsolved
Search for dead transitions found 0 dead transitions in 60501ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62037 ms. Remains : 361/361 places, 887/887 transitions.
RANDOM walk for 40000 steps (757 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (229 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (237 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 228539 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 2
Probabilistic random walk after 228539 steps, saw 166790 distinct states, run finished after 3005 ms. (steps per millisecond=76 ) properties seen :0
[2024-05-21 02:38:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/56 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/62 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 13/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 187/262 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 52/314 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 46/360 variables, 11/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 887/1247 variables, 360/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1247 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/1248 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1248 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1248 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1248/1248 variables, and 398 constraints, problems are : Problem set: 0 solved, 2 unsolved in 732 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 361/361 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/56 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/62 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 13/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 187/262 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 52/314 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 46/360 variables, 11/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 887/1247 variables, 360/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1247 variables, 2/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1247 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/1248 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1248 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1248 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1248/1248 variables, and 400 constraints, problems are : Problem set: 0 solved, 2 unsolved in 655 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 361/361 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1406ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 316 ms.
Support contains 1 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 887/887 transitions.
Applied a total of 0 rules in 14 ms. Remains 361 /361 variables (removed 0) and now considering 887/887 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 361/361 places, 887/887 transitions.
RANDOM walk for 40000 steps (783 resets) in 180 ms. (220 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (227 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (228 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 229320 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 2
Probabilistic random walk after 229320 steps, saw 167339 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
[2024-05-21 02:38:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/56 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/62 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 13/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 187/262 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 52/314 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 46/360 variables, 11/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 887/1247 variables, 360/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1247 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/1248 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1248 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1248 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1248/1248 variables, and 398 constraints, problems are : Problem set: 0 solved, 2 unsolved in 731 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 361/361 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/56 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/62 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 13/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 187/262 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 52/314 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 46/360 variables, 11/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 887/1247 variables, 360/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1247 variables, 2/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1247 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/1248 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1248 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1248 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1248/1248 variables, and 400 constraints, problems are : Problem set: 0 solved, 2 unsolved in 652 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 361/361 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1394ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 237 ms.
Support contains 1 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 887/887 transitions.
Applied a total of 0 rules in 12 ms. Remains 361 /361 variables (removed 0) and now considering 887/887 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 361/361 places, 887/887 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 887/887 transitions.
Applied a total of 0 rules in 12 ms. Remains 361 /361 variables (removed 0) and now considering 887/887 (removed 0) transitions.
[2024-05-21 02:38:48] [INFO ] Invariant cache hit.
[2024-05-21 02:38:48] [INFO ] Implicit Places using invariants in 452 ms returned []
[2024-05-21 02:38:48] [INFO ] Invariant cache hit.
[2024-05-21 02:38:49] [INFO ] Implicit Places using invariants and state equation in 1044 ms returned []
Implicit Place search using SMT with State Equation took 1504 ms to find 0 implicit places.
[2024-05-21 02:38:49] [INFO ] Redundant transitions in 10 ms returned []
Running 865 sub problems to find dead transitions.
[2024-05-21 02:38:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 3 (OVERLAPS) 2/361 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 865 unsolved
[2024-05-21 02:39:14] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2024-05-21 02:39:18] [INFO ] Deduced a trap composed of 86 places in 305 ms of which 4 ms to minimize.
[2024-05-21 02:39:19] [INFO ] Deduced a trap composed of 101 places in 294 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/1248 variables, and 40 constraints, problems are : Problem set: 0 solved, 865 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/361 constraints, PredecessorRefiner: 865/865 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 865 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 3 (OVERLAPS) 2/361 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 865 unsolved
[2024-05-21 02:39:39] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 2 ms to minimize.
[2024-05-21 02:39:43] [INFO ] Deduced a trap composed of 70 places in 319 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 865 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/1248 variables, and 42 constraints, problems are : Problem set: 0 solved, 865 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/361 constraints, PredecessorRefiner: 0/865 constraints, Known Traps: 5/5 constraints]
After SMT, in 60497ms problems are : Problem set: 0 solved, 865 unsolved
Search for dead transitions found 0 dead transitions in 60506ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62039 ms. Remains : 361/361 places, 887/887 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 12 ms. Remains 361 /361 variables (removed 0) and now considering 887/887 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-21 02:39:50] [INFO ] Invariant cache hit.
[2024-05-21 02:39:50] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-21 02:39:50] [INFO ] [Real]Absence check using 13 positive and 24 generalized place invariants in 16 ms returned sat
[2024-05-21 02:39:51] [INFO ] After 531ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 02:39:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-21 02:39:51] [INFO ] [Nat]Absence check using 13 positive and 24 generalized place invariants in 16 ms returned sat
[2024-05-21 02:39:51] [INFO ] After 390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 02:39:51] [INFO ] After 487ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 02:39:51] [INFO ] After 664ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1218 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for ASLink-PT-04a-UpperBounds-12 in 142316 ms.
[2024-05-21 02:39:52] [INFO ] Flatten gal took : 181 ms
[2024-05-21 02:39:52] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2024-05-21 02:39:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 364 places, 890 transitions and 3621 arcs took 14 ms.
Total runtime 485889 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ASLink-PT-04a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 364
TRANSITIONS: 890
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.022s, Sys 0.006s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.004s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 980
MODEL NAME: /home/mcc/execution/415/model
364 places, 890 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ASLink-PT-04a-UpperBounds-03 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ASLink-PT-04a-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716259200624

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-04a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ASLink-PT-04a, 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 r003-smll-171620116900061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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