Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813592700157.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ASLink-PT-10a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813592700157
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.9K Feb 26 13:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 13:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 13:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 13:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 26 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 920K Mar 5 18:22 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-10a-UpperBounds-00
FORMULA_NAME ASLink-PT-10a-UpperBounds-01
FORMULA_NAME ASLink-PT-10a-UpperBounds-02
FORMULA_NAME ASLink-PT-10a-UpperBounds-03
FORMULA_NAME ASLink-PT-10a-UpperBounds-04
FORMULA_NAME ASLink-PT-10a-UpperBounds-05
FORMULA_NAME ASLink-PT-10a-UpperBounds-06
FORMULA_NAME ASLink-PT-10a-UpperBounds-07
FORMULA_NAME ASLink-PT-10a-UpperBounds-08
FORMULA_NAME ASLink-PT-10a-UpperBounds-09
FORMULA_NAME ASLink-PT-10a-UpperBounds-10
FORMULA_NAME ASLink-PT-10a-UpperBounds-11
FORMULA_NAME ASLink-PT-10a-UpperBounds-12
FORMULA_NAME ASLink-PT-10a-UpperBounds-13
FORMULA_NAME ASLink-PT-10a-UpperBounds-14
FORMULA_NAME ASLink-PT-10a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678504725055

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-10a
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-11 03:18:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 03:18:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:18:47] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2023-03-11 03:18:47] [INFO ] Transformed 2186 places.
[2023-03-11 03:18:47] [INFO ] Transformed 3192 transitions.
[2023-03-11 03:18:47] [INFO ] Found NUPN structural information;
[2023-03-11 03:18:47] [INFO ] Parsed PT model containing 2186 places and 3192 transitions and 11972 arcs in 281 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 34 transitions
Reduce redundant transitions removed 34 transitions.
// Phase 1: matrix 3158 rows 2186 cols
[2023-03-11 03:18:47] [INFO ] Computed 422 place invariants in 160 ms
Incomplete random walk after 10000 steps, including 44 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 16) seen :8
FORMULA ASLink-PT-10a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :1
FORMULA ASLink-PT-10a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-11 03:18:47] [INFO ] Invariant cache hit.
[2023-03-11 03:18:48] [INFO ] [Real]Absence check using 105 positive place invariants in 79 ms returned sat
[2023-03-11 03:18:48] [INFO ] [Real]Absence check using 105 positive and 317 generalized place invariants in 136 ms returned sat
[2023-03-11 03:18:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:18:50] [INFO ] [Real]Absence check using state equation in 1964 ms returned sat
[2023-03-11 03:18:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:18:51] [INFO ] [Nat]Absence check using 105 positive place invariants in 47 ms returned sat
[2023-03-11 03:18:51] [INFO ] [Nat]Absence check using 105 positive and 317 generalized place invariants in 92 ms returned sat
[2023-03-11 03:18:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:18:56] [INFO ] [Nat]Absence check using state equation in 4472 ms returned unknown
[2023-03-11 03:18:56] [INFO ] [Real]Absence check using 105 positive place invariants in 86 ms returned sat
[2023-03-11 03:18:56] [INFO ] [Real]Absence check using 105 positive and 317 generalized place invariants in 174 ms returned sat
[2023-03-11 03:18:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:18:58] [INFO ] [Real]Absence check using state equation in 1780 ms returned sat
[2023-03-11 03:18:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:18:59] [INFO ] [Nat]Absence check using 105 positive place invariants in 51 ms returned sat
[2023-03-11 03:18:59] [INFO ] [Nat]Absence check using 105 positive and 317 generalized place invariants in 135 ms returned sat
[2023-03-11 03:18:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:19:03] [INFO ] [Nat]Absence check using state equation in 4435 ms returned unknown
[2023-03-11 03:19:04] [INFO ] [Real]Absence check using 105 positive place invariants in 46 ms returned sat
[2023-03-11 03:19:04] [INFO ] [Real]Absence check using 105 positive and 317 generalized place invariants in 162 ms returned sat
[2023-03-11 03:19:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:19:06] [INFO ] [Real]Absence check using state equation in 1802 ms returned sat
[2023-03-11 03:19:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:19:07] [INFO ] [Nat]Absence check using 105 positive place invariants in 50 ms returned sat
[2023-03-11 03:19:07] [INFO ] [Nat]Absence check using 105 positive and 317 generalized place invariants in 143 ms returned sat
[2023-03-11 03:19:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:19:11] [INFO ] [Nat]Absence check using state equation in 4410 ms returned unknown
[2023-03-11 03:19:12] [INFO ] [Real]Absence check using 105 positive place invariants in 47 ms returned sat
[2023-03-11 03:19:12] [INFO ] [Real]Absence check using 105 positive and 317 generalized place invariants in 146 ms returned sat
[2023-03-11 03:19:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:19:13] [INFO ] [Real]Absence check using state equation in 1741 ms returned sat
[2023-03-11 03:19:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:19:14] [INFO ] [Nat]Absence check using 105 positive place invariants in 46 ms returned sat
[2023-03-11 03:19:14] [INFO ] [Nat]Absence check using 105 positive and 317 generalized place invariants in 101 ms returned sat
[2023-03-11 03:19:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:19:19] [INFO ] [Nat]Absence check using state equation in 4508 ms returned unknown
[2023-03-11 03:19:19] [INFO ] [Real]Absence check using 105 positive place invariants in 45 ms returned sat
[2023-03-11 03:19:19] [INFO ] [Real]Absence check using 105 positive and 317 generalized place invariants in 107 ms returned sat
[2023-03-11 03:19:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:19:21] [INFO ] [Real]Absence check using state equation in 1777 ms returned sat
[2023-03-11 03:19:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:19:22] [INFO ] [Nat]Absence check using 105 positive place invariants in 82 ms returned sat
[2023-03-11 03:19:22] [INFO ] [Nat]Absence check using 105 positive and 317 generalized place invariants in 160 ms returned sat
[2023-03-11 03:19:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:19:26] [INFO ] [Nat]Absence check using state equation in 4161 ms returned unknown
[2023-03-11 03:19:27] [INFO ] [Real]Absence check using 105 positive place invariants in 49 ms returned sat
[2023-03-11 03:19:27] [INFO ] [Real]Absence check using 105 positive and 317 generalized place invariants in 118 ms returned sat
[2023-03-11 03:19:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:19:29] [INFO ] [Real]Absence check using state equation in 1707 ms returned sat
[2023-03-11 03:19:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:19:29] [INFO ] [Nat]Absence check using 105 positive place invariants in 50 ms returned sat
[2023-03-11 03:19:29] [INFO ] [Nat]Absence check using 105 positive and 317 generalized place invariants in 110 ms returned sat
[2023-03-11 03:19:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:19:34] [INFO ] [Nat]Absence check using state equation in 4451 ms returned unknown
[2023-03-11 03:19:34] [INFO ] [Real]Absence check using 105 positive place invariants in 46 ms returned sat
[2023-03-11 03:19:34] [INFO ] [Real]Absence check using 105 positive and 317 generalized place invariants in 151 ms returned sat
[2023-03-11 03:19:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:19:36] [INFO ] [Real]Absence check using state equation in 1883 ms returned sat
[2023-03-11 03:19:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:19:37] [INFO ] [Nat]Absence check using 105 positive place invariants in 45 ms returned sat
[2023-03-11 03:19:37] [INFO ] [Nat]Absence check using 105 positive and 317 generalized place invariants in 100 ms returned sat
[2023-03-11 03:19:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:19:41] [INFO ] [Nat]Absence check using state equation in 4498 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 2186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2186/2186 places, 3158/3158 transitions.
Ensure Unique test removed 40 places
Discarding 20 places :
Implicit places reduction removed 20 places
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 260 rules applied. Total rules applied 260 place count 2126 transition count 2958
Reduce places removed 200 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 203 rules applied. Total rules applied 463 place count 1926 transition count 2955
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 466 place count 1923 transition count 2955
Performed 207 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 207 Pre rules applied. Total rules applied 466 place count 1923 transition count 2748
Deduced a syphon composed of 207 places in 7 ms
Ensure Unique test removed 81 places
Reduce places removed 288 places and 0 transitions.
Iterating global reduction 3 with 495 rules applied. Total rules applied 961 place count 1635 transition count 2748
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 962 place count 1635 transition count 2747
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 963 place count 1634 transition count 2747
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 976 place count 1621 transition count 2676
Ensure Unique test removed 1 places
Iterating global reduction 5 with 14 rules applied. Total rules applied 990 place count 1620 transition count 2676
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 996 place count 1619 transition count 2671
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 999 place count 1616 transition count 2671
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1000 place count 1615 transition count 2663
Iterating global reduction 7 with 1 rules applied. Total rules applied 1001 place count 1615 transition count 2663
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1002 place count 1614 transition count 2655
Iterating global reduction 7 with 1 rules applied. Total rules applied 1003 place count 1614 transition count 2655
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1004 place count 1613 transition count 2647
Iterating global reduction 7 with 1 rules applied. Total rules applied 1005 place count 1613 transition count 2647
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1006 place count 1612 transition count 2639
Iterating global reduction 7 with 1 rules applied. Total rules applied 1007 place count 1612 transition count 2639
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1008 place count 1611 transition count 2631
Iterating global reduction 7 with 1 rules applied. Total rules applied 1009 place count 1611 transition count 2631
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1010 place count 1610 transition count 2623
Iterating global reduction 7 with 1 rules applied. Total rules applied 1011 place count 1610 transition count 2623
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1012 place count 1609 transition count 2615
Iterating global reduction 7 with 1 rules applied. Total rules applied 1013 place count 1609 transition count 2615
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1014 place count 1608 transition count 2607
Iterating global reduction 7 with 1 rules applied. Total rules applied 1015 place count 1608 transition count 2607
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1016 place count 1607 transition count 2599
Iterating global reduction 7 with 1 rules applied. Total rules applied 1017 place count 1607 transition count 2599
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1018 place count 1606 transition count 2591
Iterating global reduction 7 with 1 rules applied. Total rules applied 1019 place count 1606 transition count 2591
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1020 place count 1605 transition count 2583
Iterating global reduction 7 with 1 rules applied. Total rules applied 1021 place count 1605 transition count 2583
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1022 place count 1604 transition count 2575
Iterating global reduction 7 with 1 rules applied. Total rules applied 1023 place count 1604 transition count 2575
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1024 place count 1603 transition count 2567
Iterating global reduction 7 with 1 rules applied. Total rules applied 1025 place count 1603 transition count 2567
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1026 place count 1602 transition count 2559
Iterating global reduction 7 with 1 rules applied. Total rules applied 1027 place count 1602 transition count 2559
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1028 place count 1601 transition count 2551
Iterating global reduction 7 with 1 rules applied. Total rules applied 1029 place count 1601 transition count 2551
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1030 place count 1600 transition count 2543
Iterating global reduction 7 with 1 rules applied. Total rules applied 1031 place count 1600 transition count 2543
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 7 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 7 with 136 rules applied. Total rules applied 1167 place count 1532 transition count 2475
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 1176 place count 1532 transition count 2466
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1185 place count 1523 transition count 2466
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 1196 place count 1523 transition count 2466
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1197 place count 1522 transition count 2465
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 1217 place count 1502 transition count 2465
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 40 Pre rules applied. Total rules applied 1217 place count 1502 transition count 2425
Deduced a syphon composed of 40 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 9 with 81 rules applied. Total rules applied 1298 place count 1461 transition count 2425
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 9 with 11 rules applied. Total rules applied 1309 place count 1450 transition count 2425
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1309 place count 1450 transition count 2424
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1311 place count 1449 transition count 2424
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 10 with 22 rules applied. Total rules applied 1333 place count 1438 transition count 2413
Discarding 10 places :
Symmetric choice reduction at 10 with 10 rule applications. Total rules 1343 place count 1428 transition count 2403
Iterating global reduction 10 with 10 rules applied. Total rules applied 1353 place count 1428 transition count 2403
Free-agglomeration rule applied 10 times.
Iterating global reduction 10 with 10 rules applied. Total rules applied 1363 place count 1428 transition count 2393
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 1373 place count 1418 transition count 2393
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 11 with 10 rules applied. Total rules applied 1383 place count 1418 transition count 2393
Applied a total of 1383 rules in 2301 ms. Remains 1418 /2186 variables (removed 768) and now considering 2393/3158 (removed 765) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2302 ms. Remains : 1418/2186 places, 2393/3158 transitions.
// Phase 1: matrix 2393 rows 1418 cols
[2023-03-11 03:19:44] [INFO ] Computed 247 place invariants in 90 ms
Incomplete random walk after 1000000 steps, including 9509 resets, run finished after 4855 ms. (steps per millisecond=205 ) properties (out of 7) seen :1
FORMULA ASLink-PT-10a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 924 resets, run finished after 1846 ms. (steps per millisecond=541 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 923 resets, run finished after 1786 ms. (steps per millisecond=559 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 916 resets, run finished after 1933 ms. (steps per millisecond=517 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 925 resets, run finished after 1999 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 925 resets, run finished after 1991 ms. (steps per millisecond=502 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 934 resets, run finished after 1931 ms. (steps per millisecond=517 ) properties (out of 6) seen :0
[2023-03-11 03:20:00] [INFO ] Invariant cache hit.
[2023-03-11 03:20:00] [INFO ] [Real]Absence check using 65 positive place invariants in 24 ms returned sat
[2023-03-11 03:20:00] [INFO ] [Real]Absence check using 65 positive and 182 generalized place invariants in 62 ms returned sat
[2023-03-11 03:20:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:20:02] [INFO ] [Real]Absence check using state equation in 1097 ms returned sat
[2023-03-11 03:20:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:20:02] [INFO ] [Nat]Absence check using 65 positive place invariants in 28 ms returned sat
[2023-03-11 03:20:02] [INFO ] [Nat]Absence check using 65 positive and 182 generalized place invariants in 89 ms returned sat
[2023-03-11 03:20:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:20:03] [INFO ] [Nat]Absence check using state equation in 1534 ms returned sat
[2023-03-11 03:20:04] [INFO ] Computed and/alt/rep : 957/3600/957 causal constraints (skipped 1387 transitions) in 163 ms.
[2023-03-11 03:20:22] [INFO ] Added : 531 causal constraints over 107 iterations in 18034 ms. Result :sat
Minimization took 685 ms.
[2023-03-11 03:20:23] [INFO ] [Real]Absence check using 65 positive place invariants in 50 ms returned sat
[2023-03-11 03:20:23] [INFO ] [Real]Absence check using 65 positive and 182 generalized place invariants in 71 ms returned sat
[2023-03-11 03:20:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:20:24] [INFO ] [Real]Absence check using state equation in 917 ms returned sat
[2023-03-11 03:20:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:20:24] [INFO ] [Nat]Absence check using 65 positive place invariants in 21 ms returned sat
[2023-03-11 03:20:24] [INFO ] [Nat]Absence check using 65 positive and 182 generalized place invariants in 56 ms returned sat
[2023-03-11 03:20:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:20:26] [INFO ] [Nat]Absence check using state equation in 1402 ms returned sat
[2023-03-11 03:20:26] [INFO ] Computed and/alt/rep : 957/3600/957 causal constraints (skipped 1387 transitions) in 153 ms.
[2023-03-11 03:20:46] [INFO ] Added : 590 causal constraints over 118 iterations in 20054 ms.(timeout) Result :sat
Minimization took 1028 ms.
[2023-03-11 03:20:47] [INFO ] [Real]Absence check using 65 positive place invariants in 17 ms returned sat
[2023-03-11 03:20:47] [INFO ] [Real]Absence check using 65 positive and 182 generalized place invariants in 39 ms returned sat
[2023-03-11 03:20:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:20:48] [INFO ] [Real]Absence check using state equation in 1009 ms returned sat
[2023-03-11 03:20:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:20:48] [INFO ] [Nat]Absence check using 65 positive place invariants in 20 ms returned sat
[2023-03-11 03:20:49] [INFO ] [Nat]Absence check using 65 positive and 182 generalized place invariants in 114 ms returned sat
[2023-03-11 03:20:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:20:50] [INFO ] [Nat]Absence check using state equation in 1487 ms returned sat
[2023-03-11 03:20:50] [INFO ] Computed and/alt/rep : 957/3600/957 causal constraints (skipped 1387 transitions) in 165 ms.
[2023-03-11 03:20:56] [INFO ] Added : 165 causal constraints over 33 iterations in 5514 ms. Result :sat
Minimization took 670 ms.
[2023-03-11 03:20:57] [INFO ] [Real]Absence check using 65 positive place invariants in 18 ms returned sat
[2023-03-11 03:20:57] [INFO ] [Real]Absence check using 65 positive and 182 generalized place invariants in 71 ms returned sat
[2023-03-11 03:20:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:20:58] [INFO ] [Real]Absence check using state equation in 904 ms returned sat
[2023-03-11 03:20:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:20:58] [INFO ] [Nat]Absence check using 65 positive place invariants in 21 ms returned sat
[2023-03-11 03:20:58] [INFO ] [Nat]Absence check using 65 positive and 182 generalized place invariants in 46 ms returned sat
[2023-03-11 03:20:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:20:59] [INFO ] [Nat]Absence check using state equation in 972 ms returned sat
[2023-03-11 03:20:59] [INFO ] Computed and/alt/rep : 957/3600/957 causal constraints (skipped 1387 transitions) in 184 ms.
[2023-03-11 03:21:19] [INFO ] Added : 635 causal constraints over 127 iterations in 20109 ms.(timeout) Result :sat
Minimization took 576 ms.
[2023-03-11 03:21:20] [INFO ] [Real]Absence check using 65 positive place invariants in 18 ms returned sat
[2023-03-11 03:21:20] [INFO ] [Real]Absence check using 65 positive and 182 generalized place invariants in 40 ms returned sat
[2023-03-11 03:21:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:21:21] [INFO ] [Real]Absence check using state equation in 814 ms returned sat
[2023-03-11 03:21:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:21:21] [INFO ] [Nat]Absence check using 65 positive place invariants in 22 ms returned sat
[2023-03-11 03:21:21] [INFO ] [Nat]Absence check using 65 positive and 182 generalized place invariants in 52 ms returned sat
[2023-03-11 03:21:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:21:23] [INFO ] [Nat]Absence check using state equation in 1626 ms returned sat
[2023-03-11 03:21:23] [INFO ] Computed and/alt/rep : 957/3600/957 causal constraints (skipped 1387 transitions) in 118 ms.
[2023-03-11 03:21:43] [INFO ] Added : 615 causal constraints over 123 iterations in 20209 ms.(timeout) Result :sat
Minimization took 838 ms.
[2023-03-11 03:21:45] [INFO ] [Real]Absence check using 65 positive place invariants in 25 ms returned sat
[2023-03-11 03:21:45] [INFO ] [Real]Absence check using 65 positive and 182 generalized place invariants in 80 ms returned sat
[2023-03-11 03:21:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:21:46] [INFO ] [Real]Absence check using state equation in 917 ms returned sat
[2023-03-11 03:21:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:21:46] [INFO ] [Nat]Absence check using 65 positive place invariants in 38 ms returned sat
[2023-03-11 03:21:46] [INFO ] [Nat]Absence check using 65 positive and 182 generalized place invariants in 82 ms returned sat
[2023-03-11 03:21:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:21:47] [INFO ] [Nat]Absence check using state equation in 1343 ms returned sat
[2023-03-11 03:21:48] [INFO ] Computed and/alt/rep : 957/3600/957 causal constraints (skipped 1387 transitions) in 187 ms.
[2023-03-11 03:22:07] [INFO ] Added : 605 causal constraints over 121 iterations in 20059 ms.(timeout) Result :sat
Minimization took 818 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 1418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1418/1418 places, 2393/2393 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1417 transition count 2392
Applied a total of 2 rules in 93 ms. Remains 1417 /1418 variables (removed 1) and now considering 2392/2393 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 1417/1418 places, 2392/2393 transitions.
// Phase 1: matrix 2392 rows 1417 cols
[2023-03-11 03:22:21] [INFO ] Computed 247 place invariants in 58 ms
Incomplete random walk after 1000000 steps, including 9487 resets, run finished after 4191 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 920 resets, run finished after 1940 ms. (steps per millisecond=515 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 924 resets, run finished after 1831 ms. (steps per millisecond=546 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 918 resets, run finished after 1928 ms. (steps per millisecond=518 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 922 resets, run finished after 1913 ms. (steps per millisecond=522 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 926 resets, run finished after 1997 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 919 resets, run finished after 1864 ms. (steps per millisecond=536 ) properties (out of 6) seen :0
[2023-03-11 03:22:37] [INFO ] Invariant cache hit.
[2023-03-11 03:22:37] [INFO ] [Real]Absence check using 63 positive place invariants in 59 ms returned sat
[2023-03-11 03:22:37] [INFO ] [Real]Absence check using 63 positive and 184 generalized place invariants in 60 ms returned sat
[2023-03-11 03:22:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:22:39] [INFO ] [Real]Absence check using state equation in 1440 ms returned sat
[2023-03-11 03:22:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:22:39] [INFO ] [Nat]Absence check using 63 positive place invariants in 20 ms returned sat
[2023-03-11 03:22:39] [INFO ] [Nat]Absence check using 63 positive and 184 generalized place invariants in 61 ms returned sat
[2023-03-11 03:22:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:22:41] [INFO ] [Nat]Absence check using state equation in 1699 ms returned sat
[2023-03-11 03:22:41] [INFO ] Computed and/alt/rep : 956/3599/956 causal constraints (skipped 1387 transitions) in 150 ms.
[2023-03-11 03:23:01] [INFO ] Added : 575 causal constraints over 115 iterations in 20088 ms.(timeout) Result :sat
Minimization took 772 ms.
[2023-03-11 03:23:02] [INFO ] [Real]Absence check using 63 positive place invariants in 24 ms returned sat
[2023-03-11 03:23:02] [INFO ] [Real]Absence check using 63 positive and 184 generalized place invariants in 85 ms returned sat
[2023-03-11 03:23:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:23:03] [INFO ] [Real]Absence check using state equation in 1050 ms returned sat
[2023-03-11 03:23:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:23:04] [INFO ] [Nat]Absence check using 63 positive place invariants in 21 ms returned sat
[2023-03-11 03:23:04] [INFO ] [Nat]Absence check using 63 positive and 184 generalized place invariants in 51 ms returned sat
[2023-03-11 03:23:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:23:05] [INFO ] [Nat]Absence check using state equation in 1500 ms returned sat
[2023-03-11 03:23:06] [INFO ] Computed and/alt/rep : 956/3599/956 causal constraints (skipped 1387 transitions) in 153 ms.
[2023-03-11 03:23:26] [INFO ] Added : 460 causal constraints over 92 iterations in 20101 ms.(timeout) Result :sat
Minimization took 990 ms.
[2023-03-11 03:23:27] [INFO ] [Real]Absence check using 63 positive place invariants in 21 ms returned sat
[2023-03-11 03:23:27] [INFO ] [Real]Absence check using 63 positive and 184 generalized place invariants in 43 ms returned sat
[2023-03-11 03:23:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:23:28] [INFO ] [Real]Absence check using state equation in 1034 ms returned sat
[2023-03-11 03:23:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:23:28] [INFO ] [Nat]Absence check using 63 positive place invariants in 79 ms returned sat
[2023-03-11 03:23:29] [INFO ] [Nat]Absence check using 63 positive and 184 generalized place invariants in 105 ms returned sat
[2023-03-11 03:23:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:23:30] [INFO ] [Nat]Absence check using state equation in 1545 ms returned sat
[2023-03-11 03:23:30] [INFO ] Computed and/alt/rep : 956/3599/956 causal constraints (skipped 1387 transitions) in 157 ms.
[2023-03-11 03:23:50] [INFO ] Added : 610 causal constraints over 122 iterations in 20069 ms.(timeout) Result :sat
Minimization took 879 ms.
[2023-03-11 03:23:51] [INFO ] [Real]Absence check using 63 positive place invariants in 18 ms returned sat
[2023-03-11 03:23:51] [INFO ] [Real]Absence check using 63 positive and 184 generalized place invariants in 43 ms returned sat
[2023-03-11 03:23:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:23:53] [INFO ] [Real]Absence check using state equation in 1529 ms returned sat
[2023-03-11 03:23:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:23:53] [INFO ] [Nat]Absence check using 63 positive place invariants in 21 ms returned sat
[2023-03-11 03:23:53] [INFO ] [Nat]Absence check using 63 positive and 184 generalized place invariants in 62 ms returned sat
[2023-03-11 03:23:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:23:55] [INFO ] [Nat]Absence check using state equation in 1340 ms returned sat
[2023-03-11 03:23:55] [INFO ] Computed and/alt/rep : 956/3599/956 causal constraints (skipped 1387 transitions) in 157 ms.
[2023-03-11 03:24:15] [INFO ] Added : 600 causal constraints over 120 iterations in 20210 ms.(timeout) Result :sat
Minimization took 814 ms.
[2023-03-11 03:24:16] [INFO ] [Real]Absence check using 63 positive place invariants in 17 ms returned sat
[2023-03-11 03:24:16] [INFO ] [Real]Absence check using 63 positive and 184 generalized place invariants in 50 ms returned sat
[2023-03-11 03:24:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:24:17] [INFO ] [Real]Absence check using state equation in 1034 ms returned sat
[2023-03-11 03:24:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:24:18] [INFO ] [Nat]Absence check using 63 positive place invariants in 33 ms returned sat
[2023-03-11 03:24:18] [INFO ] [Nat]Absence check using 63 positive and 184 generalized place invariants in 166 ms returned sat
[2023-03-11 03:24:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:24:20] [INFO ] [Nat]Absence check using state equation in 2614 ms returned sat
[2023-03-11 03:24:21] [INFO ] Deduced a trap composed of 98 places in 228 ms of which 4 ms to minimize.
[2023-03-11 03:24:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 431 ms
[2023-03-11 03:24:21] [INFO ] Computed and/alt/rep : 956/3599/956 causal constraints (skipped 1387 transitions) in 179 ms.
[2023-03-11 03:24:27] [INFO ] Added : 148 causal constraints over 30 iterations in 5687 ms. Result :sat
Minimization took 573 ms.
[2023-03-11 03:24:28] [INFO ] [Real]Absence check using 63 positive place invariants in 28 ms returned sat
[2023-03-11 03:24:28] [INFO ] [Real]Absence check using 63 positive and 184 generalized place invariants in 167 ms returned sat
[2023-03-11 03:24:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:24:29] [INFO ] [Real]Absence check using state equation in 1199 ms returned sat
[2023-03-11 03:24:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:24:29] [INFO ] [Nat]Absence check using 63 positive place invariants in 70 ms returned sat
[2023-03-11 03:24:29] [INFO ] [Nat]Absence check using 63 positive and 184 generalized place invariants in 77 ms returned sat
[2023-03-11 03:24:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:24:31] [INFO ] [Nat]Absence check using state equation in 1424 ms returned sat
[2023-03-11 03:24:31] [INFO ] Computed and/alt/rep : 956/3599/956 causal constraints (skipped 1387 transitions) in 131 ms.
[2023-03-11 03:24:41] [INFO ] Added : 276 causal constraints over 57 iterations in 10178 ms. Result :sat
Minimization took 1283 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 1417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1417/1417 places, 2392/2392 transitions.
Applied a total of 0 rules in 48 ms. Remains 1417 /1417 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 1417/1417 places, 2392/2392 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1417/1417 places, 2392/2392 transitions.
Applied a total of 0 rules in 46 ms. Remains 1417 /1417 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
[2023-03-11 03:24:59] [INFO ] Invariant cache hit.
[2023-03-11 03:25:01] [INFO ] Implicit Places using invariants in 1401 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 148, 149, 150, 168, 186, 255, 259, 260, 271, 272, 273, 291, 309, 379, 383, 384, 395, 396, 397, 415, 433, 470, 504, 508, 509, 520, 521, 522, 540, 558, 627, 631, 632, 643, 644, 645, 663, 681, 750, 754, 755, 766, 767, 768, 786, 804, 873, 877, 878, 889, 890, 891, 909, 927, 962, 998, 1002, 1003, 1014, 1015, 1016, 1034, 1052, 1121, 1125, 1126, 1137, 1138, 1139, 1157, 1175, 1244, 1248, 1249, 1252, 1263, 1264, 1265, 1283, 1285, 1288, 1306, 1307, 1308, 1309, 1321, 1327, 1333, 1339, 1345, 1351, 1357, 1363, 1369, 1375, 1381]
Discarding 104 places :
Implicit Place search using SMT only with invariants took 1404 ms to find 104 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1313/1417 places, 2392/2392 transitions.
Drop transitions removed 176 transitions
Trivial Post-agglo rules discarded 176 transitions
Performed 176 trivial Post agglomeration. Transition count delta: 176
Iterating post reduction 0 with 176 rules applied. Total rules applied 176 place count 1313 transition count 2216
Reduce places removed 176 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 179 rules applied. Total rules applied 355 place count 1137 transition count 2213
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 358 place count 1134 transition count 2213
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 358 place count 1134 transition count 2168
Deduced a syphon composed of 45 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 91 rules applied. Total rules applied 449 place count 1088 transition count 2168
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions 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 461 place count 1084 transition count 2160
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 469 place count 1076 transition count 2160
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 484 place count 1061 transition count 2145
Iterating global reduction 5 with 15 rules applied. Total rules applied 499 place count 1061 transition count 2145
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 502 place count 1061 transition count 2142
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 502 place count 1061 transition count 2141
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 504 place count 1060 transition count 2141
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 507 place count 1057 transition count 2138
Iterating global reduction 6 with 3 rules applied. Total rules applied 510 place count 1057 transition count 2138
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 511 place count 1056 transition count 2137
Iterating global reduction 6 with 1 rules applied. Total rules applied 512 place count 1056 transition count 2137
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 513 place count 1055 transition count 2136
Iterating global reduction 6 with 1 rules applied. Total rules applied 514 place count 1055 transition count 2136
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 6 with 160 rules applied. Total rules applied 674 place count 975 transition count 2056
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 682 place count 975 transition count 2048
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 691 place count 966 transition count 2039
Iterating global reduction 7 with 9 rules applied. Total rules applied 700 place count 966 transition count 2039
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 708 place count 966 transition count 2031
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 711 place count 966 transition count 2028
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 713 place count 965 transition count 2027
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 8 with 22 rules applied. Total rules applied 735 place count 965 transition count 2005
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 758 place count 942 transition count 2005
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 9 with 30 rules applied. Total rules applied 788 place count 942 transition count 2005
Applied a total of 788 rules in 540 ms. Remains 942 /1313 variables (removed 371) and now considering 2005/2392 (removed 387) transitions.
// Phase 1: matrix 2005 rows 942 cols
[2023-03-11 03:25:01] [INFO ] Computed 137 place invariants in 44 ms
[2023-03-11 03:25:02] [INFO ] Implicit Places using invariants in 763 ms returned [89, 95, 98, 100, 104, 105, 157, 174, 180, 183, 185, 190, 191, 243, 260, 267, 270, 272, 277, 278, 330, 349, 355, 358, 360, 365, 366, 418, 435, 441, 444, 446, 451, 452, 504, 521, 527, 530, 532, 537, 538, 590, 607, 613, 616, 618, 624, 625, 677, 696, 702, 705, 707, 712, 713, 765, 782, 788, 791, 793, 798, 799, 851, 868, 874, 877, 879]
Discarding 67 places :
Implicit Place search using SMT only with invariants took 766 ms to find 67 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 875/1417 places, 2005/2392 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 846 transition count 1976
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 846 transition count 1976
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 837 transition count 1967
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 837 transition count 1967
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 114 place count 818 transition count 1948
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 144 place count 818 transition count 1918
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 174 place count 788 transition count 1918
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 182 place count 788 transition count 1910
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 190 place count 780 transition count 1910
Applied a total of 190 rules in 162 ms. Remains 780 /875 variables (removed 95) and now considering 1910/2005 (removed 95) transitions.
// Phase 1: matrix 1910 rows 780 cols
[2023-03-11 03:25:02] [INFO ] Computed 70 place invariants in 39 ms
[2023-03-11 03:25:03] [INFO ] Implicit Places using invariants in 455 ms returned []
[2023-03-11 03:25:03] [INFO ] Invariant cache hit.
[2023-03-11 03:25:05] [INFO ] Implicit Places using invariants and state equation in 2129 ms returned []
Implicit Place search using SMT with State Equation took 2598 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 780/1417 places, 1910/2392 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5516 ms. Remains : 780/1417 places, 1910/2392 transitions.
Successfully produced net in file /tmp/petri1000_6161725633730907961.dot
Successfully produced net in file /tmp/petri1001_12225057018097248259.dot
Successfully produced net in file /tmp/petri1002_13403983120031367283.dot
Successfully produced net in file /tmp/petri1003_18069225443045681976.dot
Successfully produced net in file /tmp/petri1004_12853276087083517900.dot
Successfully produced net in file /tmp/petri1005_12028037806792366517.dot
Successfully produced net in file /tmp/petri1006_15278510843695399666.dot
Successfully produced net in file /tmp/petri1007_8895651361756592729.dot
Successfully produced net in file /tmp/petri1008_8111747791461700837.dot
Successfully produced net in file /tmp/petri1009_17847176882942830628.dot
Drop transitions removed 10 transitions
Dominated transitions for bounds rules discarded 10 transitions
// Phase 1: matrix 1900 rows 780 cols
[2023-03-11 03:25:05] [INFO ] Computed 70 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 16167 resets, run finished after 2584 ms. (steps per millisecond=386 ) properties (out of 6) seen :1
FORMULA ASLink-PT-10a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 2212 resets, run finished after 816 ms. (steps per millisecond=1225 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2204 resets, run finished after 793 ms. (steps per millisecond=1261 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2199 resets, run finished after 821 ms. (steps per millisecond=1218 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2214 resets, run finished after 922 ms. (steps per millisecond=1084 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2213 resets, run finished after 1015 ms. (steps per millisecond=985 ) properties (out of 5) seen :0
[2023-03-11 03:25:12] [INFO ] Invariant cache hit.
[2023-03-11 03:25:12] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-11 03:25:12] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 31 ms returned sat
[2023-03-11 03:25:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:25:13] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2023-03-11 03:25:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:25:13] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-11 03:25:13] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 80 ms returned sat
[2023-03-11 03:25:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:25:13] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2023-03-11 03:25:13] [INFO ] Computed and/alt/rep : 454/1926/454 causal constraints (skipped 1400 transitions) in 115 ms.
[2023-03-11 03:25:18] [INFO ] Added : 124 causal constraints over 25 iterations in 4835 ms. Result :sat
Minimization took 303 ms.
[2023-03-11 03:25:19] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 03:25:19] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 26 ms returned sat
[2023-03-11 03:25:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:25:19] [INFO ] [Real]Absence check using state equation in 592 ms returned sat
[2023-03-11 03:25:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:25:20] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 03:25:20] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 39 ms returned sat
[2023-03-11 03:25:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:25:21] [INFO ] [Nat]Absence check using state equation in 1044 ms returned sat
[2023-03-11 03:25:21] [INFO ] Computed and/alt/rep : 454/1926/454 causal constraints (skipped 1400 transitions) in 160 ms.
[2023-03-11 03:25:23] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 1 ms to minimize.
[2023-03-11 03:25:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 366 ms
[2023-03-11 03:25:23] [INFO ] Added : 64 causal constraints over 13 iterations in 2596 ms. Result :sat
Minimization took 359 ms.
[2023-03-11 03:25:24] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 03:25:24] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 22 ms returned sat
[2023-03-11 03:25:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:25:24] [INFO ] [Real]Absence check using state equation in 490 ms returned sat
[2023-03-11 03:25:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:25:25] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 03:25:25] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 32 ms returned sat
[2023-03-11 03:25:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:25:26] [INFO ] [Nat]Absence check using state equation in 943 ms returned sat
[2023-03-11 03:25:26] [INFO ] Computed and/alt/rep : 454/1926/454 causal constraints (skipped 1400 transitions) in 106 ms.
[2023-03-11 03:25:27] [INFO ] Added : 57 causal constraints over 12 iterations in 1800 ms. Result :sat
Minimization took 453 ms.
[2023-03-11 03:25:28] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 03:25:28] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 15 ms returned sat
[2023-03-11 03:25:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:25:29] [INFO ] [Real]Absence check using state equation in 617 ms returned sat
[2023-03-11 03:25:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:25:29] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 03:25:29] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 23 ms returned sat
[2023-03-11 03:25:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:25:30] [INFO ] [Nat]Absence check using state equation in 645 ms returned sat
[2023-03-11 03:25:30] [INFO ] Computed and/alt/rep : 454/1926/454 causal constraints (skipped 1400 transitions) in 128 ms.
[2023-03-11 03:25:31] [INFO ] Added : 18 causal constraints over 4 iterations in 855 ms. Result :sat
Minimization took 307 ms.
[2023-03-11 03:25:31] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 03:25:31] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 65 ms returned sat
[2023-03-11 03:25:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:25:32] [INFO ] [Real]Absence check using state equation in 534 ms returned sat
[2023-03-11 03:25:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:25:32] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 03:25:32] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 36 ms returned sat
[2023-03-11 03:25:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:25:33] [INFO ] [Nat]Absence check using state equation in 928 ms returned sat
[2023-03-11 03:25:33] [INFO ] Computed and/alt/rep : 454/1926/454 causal constraints (skipped 1400 transitions) in 172 ms.
[2023-03-11 03:25:35] [INFO ] Added : 65 causal constraints over 13 iterations in 2037 ms. Result :sat
Minimization took 441 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA ASLink-PT-10a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 780 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 780/780 places, 1900/1900 transitions.
Graph (complete) has 4701 edges and 780 vertex of which 770 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 770 transition count 1899
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 769 transition count 1899
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 769 transition count 1898
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 768 transition count 1898
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 15 place count 768 transition count 1898
Applied a total of 15 rules in 77 ms. Remains 768 /780 variables (removed 12) and now considering 1898/1900 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 768/780 places, 1898/1900 transitions.
Successfully produced net in file /tmp/petri1010_7043233063393274130.dot
Drop transitions removed 1 transitions
Dominated transitions for bounds rules discarded 1 transitions
// Phase 1: matrix 1897 rows 768 cols
[2023-03-11 03:25:38] [INFO ] Computed 70 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 16140 resets, run finished after 2500 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2224 resets, run finished after 779 ms. (steps per millisecond=1283 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2208 resets, run finished after 830 ms. (steps per millisecond=1204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2209 resets, run finished after 986 ms. (steps per millisecond=1014 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2229 resets, run finished after 993 ms. (steps per millisecond=1007 ) properties (out of 4) seen :0
[2023-03-11 03:25:44] [INFO ] Invariant cache hit.
[2023-03-11 03:25:44] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 03:25:44] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 72 ms returned sat
[2023-03-11 03:25:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:25:44] [INFO ] [Real]Absence check using state equation in 561 ms returned sat
[2023-03-11 03:25:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:25:45] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 03:25:45] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 16 ms returned sat
[2023-03-11 03:25:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:25:46] [INFO ] [Nat]Absence check using state equation in 1188 ms returned sat
[2023-03-11 03:25:46] [INFO ] Computed and/alt/rep : 444/1857/444 causal constraints (skipped 1407 transitions) in 143 ms.
[2023-03-11 03:25:48] [INFO ] Added : 51 causal constraints over 11 iterations in 1872 ms. Result :sat
Minimization took 399 ms.
[2023-03-11 03:25:48] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-11 03:25:48] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 29 ms returned sat
[2023-03-11 03:25:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:25:49] [INFO ] [Real]Absence check using state equation in 541 ms returned sat
[2023-03-11 03:25:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:25:49] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 03:25:49] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 14 ms returned sat
[2023-03-11 03:25:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:25:50] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2023-03-11 03:25:50] [INFO ] Computed and/alt/rep : 444/1857/444 causal constraints (skipped 1407 transitions) in 112 ms.
[2023-03-11 03:25:51] [INFO ] Added : 15 causal constraints over 5 iterations in 1006 ms. Result :sat
Minimization took 286 ms.
[2023-03-11 03:25:51] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-11 03:25:51] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 35 ms returned sat
[2023-03-11 03:25:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:25:52] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2023-03-11 03:25:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:25:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 03:25:52] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 38 ms returned sat
[2023-03-11 03:25:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:25:53] [INFO ] [Nat]Absence check using state equation in 667 ms returned sat
[2023-03-11 03:25:53] [INFO ] Computed and/alt/rep : 444/1857/444 causal constraints (skipped 1407 transitions) in 218 ms.
[2023-03-11 03:25:54] [INFO ] Added : 16 causal constraints over 4 iterations in 940 ms. Result :sat
Minimization took 197 ms.
[2023-03-11 03:25:54] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 03:25:54] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 35 ms returned sat
[2023-03-11 03:25:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:25:55] [INFO ] [Real]Absence check using state equation in 592 ms returned sat
[2023-03-11 03:25:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:25:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-11 03:25:55] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 20 ms returned sat
[2023-03-11 03:25:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:25:56] [INFO ] [Nat]Absence check using state equation in 752 ms returned sat
[2023-03-11 03:25:56] [INFO ] Computed and/alt/rep : 444/1857/444 causal constraints (skipped 1407 transitions) in 105 ms.
[2023-03-11 03:25:57] [INFO ] Added : 32 causal constraints over 7 iterations in 1179 ms. Result :sat
Minimization took 350 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA ASLink-PT-10a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 768 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 768/768 places, 1897/1897 transitions.
Graph (complete) has 4715 edges and 768 vertex of which 767 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 766 transition count 1896
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 766 transition count 1896
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 766 transition count 1895
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 766 transition count 1895
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 765 transition count 1894
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 765 transition count 1894
Applied a total of 7 rules in 93 ms. Remains 765 /768 variables (removed 3) and now considering 1894/1897 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 765/768 places, 1894/1897 transitions.
// Phase 1: matrix 1894 rows 765 cols
[2023-03-11 03:25:59] [INFO ] Computed 70 place invariants in 38 ms
Incomplete random walk after 1000000 steps, including 16189 resets, run finished after 2749 ms. (steps per millisecond=363 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2220 resets, run finished after 846 ms. (steps per millisecond=1182 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2213 resets, run finished after 910 ms. (steps per millisecond=1098 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2199 resets, run finished after 947 ms. (steps per millisecond=1055 ) properties (out of 3) seen :0
[2023-03-11 03:26:04] [INFO ] Invariant cache hit.
[2023-03-11 03:26:05] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 03:26:05] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 33 ms returned sat
[2023-03-11 03:26:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:26:05] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2023-03-11 03:26:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:26:05] [INFO ] [Nat]Absence check using 15 positive place invariants in 18 ms returned sat
[2023-03-11 03:26:05] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 43 ms returned sat
[2023-03-11 03:26:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:26:06] [INFO ] [Nat]Absence check using state equation in 712 ms returned sat
[2023-03-11 03:26:06] [INFO ] Computed and/alt/rep : 448/1900/448 causal constraints (skipped 1400 transitions) in 139 ms.
[2023-03-11 03:26:07] [INFO ] Added : 24 causal constraints over 5 iterations in 1019 ms. Result :sat
Minimization took 242 ms.
[2023-03-11 03:26:08] [INFO ] [Real]Absence check using 15 positive place invariants in 19 ms returned sat
[2023-03-11 03:26:08] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 25 ms returned sat
[2023-03-11 03:26:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:26:08] [INFO ] [Real]Absence check using state equation in 612 ms returned sat
[2023-03-11 03:26:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:26:08] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 03:26:09] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 28 ms returned sat
[2023-03-11 03:26:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:26:09] [INFO ] [Nat]Absence check using state equation in 493 ms returned sat
[2023-03-11 03:26:09] [INFO ] Computed and/alt/rep : 448/1900/448 causal constraints (skipped 1400 transitions) in 100 ms.
[2023-03-11 03:26:11] [INFO ] Added : 74 causal constraints over 15 iterations in 1917 ms. Result :sat
Minimization took 199 ms.
[2023-03-11 03:26:11] [INFO ] [Real]Absence check using 15 positive place invariants in 28 ms returned sat
[2023-03-11 03:26:11] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 16 ms returned sat
[2023-03-11 03:26:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:26:12] [INFO ] [Real]Absence check using state equation in 716 ms returned sat
[2023-03-11 03:26:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:26:12] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 03:26:12] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 18 ms returned sat
[2023-03-11 03:26:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:26:13] [INFO ] [Nat]Absence check using state equation in 1059 ms returned sat
[2023-03-11 03:26:14] [INFO ] Computed and/alt/rep : 448/1900/448 causal constraints (skipped 1400 transitions) in 107 ms.
[2023-03-11 03:26:15] [INFO ] Added : 56 causal constraints over 12 iterations in 1651 ms. Result :sat
Minimization took 267 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA ASLink-PT-10a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 765/765 places, 1894/1894 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 765 transition count 1893
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 764 transition count 1893
Applied a total of 2 rules in 30 ms. Remains 764 /765 variables (removed 1) and now considering 1893/1894 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 764/765 places, 1893/1894 transitions.
// Phase 1: matrix 1893 rows 764 cols
[2023-03-11 03:26:16] [INFO ] Computed 70 place invariants in 36 ms
Incomplete random walk after 1000000 steps, including 16205 resets, run finished after 2832 ms. (steps per millisecond=353 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2214 resets, run finished after 928 ms. (steps per millisecond=1077 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2226 resets, run finished after 867 ms. (steps per millisecond=1153 ) properties (out of 2) seen :0
[2023-03-11 03:26:21] [INFO ] Invariant cache hit.
[2023-03-11 03:26:21] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-11 03:26:21] [INFO ] [Real]Absence check using 17 positive and 53 generalized place invariants in 16 ms returned sat
[2023-03-11 03:26:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:26:22] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2023-03-11 03:26:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:26:22] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-11 03:26:22] [INFO ] [Nat]Absence check using 17 positive and 53 generalized place invariants in 36 ms returned sat
[2023-03-11 03:26:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:26:23] [INFO ] [Nat]Absence check using state equation in 1183 ms returned sat
[2023-03-11 03:26:23] [INFO ] Computed and/alt/rep : 447/1899/447 causal constraints (skipped 1400 transitions) in 107 ms.
[2023-03-11 03:26:24] [INFO ] Added : 22 causal constraints over 5 iterations in 812 ms. Result :sat
Minimization took 448 ms.
[2023-03-11 03:26:25] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-11 03:26:25] [INFO ] [Real]Absence check using 17 positive and 53 generalized place invariants in 16 ms returned sat
[2023-03-11 03:26:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:26:25] [INFO ] [Real]Absence check using state equation in 641 ms returned sat
[2023-03-11 03:26:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:26:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2023-03-11 03:26:25] [INFO ] [Nat]Absence check using 17 positive and 53 generalized place invariants in 39 ms returned sat
[2023-03-11 03:26:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:26:26] [INFO ] [Nat]Absence check using state equation in 726 ms returned sat
[2023-03-11 03:26:26] [INFO ] Computed and/alt/rep : 447/1899/447 causal constraints (skipped 1400 transitions) in 151 ms.
[2023-03-11 03:26:28] [INFO ] Added : 41 causal constraints over 9 iterations in 1462 ms. Result :sat
Minimization took 261 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 764 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 764/764 places, 1893/1893 transitions.
Applied a total of 0 rules in 23 ms. Remains 764 /764 variables (removed 0) and now considering 1893/1893 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 764/764 places, 1893/1893 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 764/764 places, 1893/1893 transitions.
Applied a total of 0 rules in 23 ms. Remains 764 /764 variables (removed 0) and now considering 1893/1893 (removed 0) transitions.
[2023-03-11 03:26:29] [INFO ] Invariant cache hit.
[2023-03-11 03:26:29] [INFO ] Implicit Places using invariants in 549 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 552 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 763/764 places, 1893/1893 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 1892
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 762 transition count 1891
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 761 transition count 1891
Applied a total of 4 rules in 71 ms. Remains 761 /763 variables (removed 2) and now considering 1891/1893 (removed 2) transitions.
// Phase 1: matrix 1891 rows 761 cols
[2023-03-11 03:26:30] [INFO ] Computed 69 place invariants in 15 ms
[2023-03-11 03:26:30] [INFO ] Implicit Places using invariants in 544 ms returned []
[2023-03-11 03:26:30] [INFO ] Invariant cache hit.
[2023-03-11 03:26:32] [INFO ] Implicit Places using invariants and state equation in 1967 ms returned []
Implicit Place search using SMT with State Equation took 2512 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 761/764 places, 1891/1893 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3158 ms. Remains : 761/764 places, 1891/1893 transitions.
[2023-03-11 03:26:32] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 16129 resets, run finished after 2603 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2216 resets, run finished after 870 ms. (steps per millisecond=1149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2223 resets, run finished after 867 ms. (steps per millisecond=1153 ) properties (out of 2) seen :0
[2023-03-11 03:26:36] [INFO ] Invariant cache hit.
[2023-03-11 03:26:36] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 03:26:36] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 18 ms returned sat
[2023-03-11 03:26:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:26:37] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2023-03-11 03:26:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:26:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 03:26:37] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 21 ms returned sat
[2023-03-11 03:26:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:26:38] [INFO ] [Nat]Absence check using state equation in 669 ms returned sat
[2023-03-11 03:26:38] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2023-03-11 03:26:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 322 ms
[2023-03-11 03:26:38] [INFO ] Computed and/alt/rep : 438/1826/438 causal constraints (skipped 1407 transitions) in 143 ms.
[2023-03-11 03:26:40] [INFO ] Added : 44 causal constraints over 9 iterations in 1490 ms. Result :sat
Minimization took 184 ms.
[2023-03-11 03:26:40] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 03:26:40] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 38 ms returned sat
[2023-03-11 03:26:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:26:41] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2023-03-11 03:26:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:26:41] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 03:26:41] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 36 ms returned sat
[2023-03-11 03:26:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:26:42] [INFO ] [Nat]Absence check using state equation in 845 ms returned sat
[2023-03-11 03:26:42] [INFO ] Computed and/alt/rep : 438/1826/438 causal constraints (skipped 1407 transitions) in 146 ms.
[2023-03-11 03:26:45] [INFO ] Deduced a trap composed of 54 places in 332 ms of which 2 ms to minimize.
[2023-03-11 03:26:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 469 ms
[2023-03-11 03:26:45] [INFO ] Added : 75 causal constraints over 15 iterations in 2905 ms. Result :sat
Minimization took 302 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 1891/1891 transitions.
Applied a total of 0 rules in 23 ms. Remains 761 /761 variables (removed 0) and now considering 1891/1891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 761/761 places, 1891/1891 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 1891/1891 transitions.
Applied a total of 0 rules in 23 ms. Remains 761 /761 variables (removed 0) and now considering 1891/1891 (removed 0) transitions.
[2023-03-11 03:26:46] [INFO ] Invariant cache hit.
[2023-03-11 03:26:46] [INFO ] Implicit Places using invariants in 578 ms returned []
[2023-03-11 03:26:47] [INFO ] Invariant cache hit.
[2023-03-11 03:26:49] [INFO ] Implicit Places using invariants and state equation in 2089 ms returned []
Implicit Place search using SMT with State Equation took 2671 ms to find 0 implicit places.
[2023-03-11 03:26:49] [INFO ] Redundant transitions in 216 ms returned []
[2023-03-11 03:26:49] [INFO ] Invariant cache hit.
[2023-03-11 03:26:49] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3577 ms. Remains : 761/761 places, 1891/1891 transitions.
Starting property specific reduction for ASLink-PT-10a-UpperBounds-11
[2023-03-11 03:26:50] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 168 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
[2023-03-11 03:26:50] [INFO ] Invariant cache hit.
[2023-03-11 03:26:50] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-11 03:26:50] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 27 ms returned sat
[2023-03-11 03:26:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:26:50] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2023-03-11 03:26:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:26:51] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-11 03:26:51] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 43 ms returned sat
[2023-03-11 03:26:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:26:51] [INFO ] [Nat]Absence check using state equation in 515 ms returned sat
[2023-03-11 03:26:51] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 14 ms to minimize.
[2023-03-11 03:26:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 378 ms
[2023-03-11 03:26:52] [INFO ] Computed and/alt/rep : 438/1826/438 causal constraints (skipped 1407 transitions) in 128 ms.
[2023-03-11 03:26:53] [INFO ] Added : 44 causal constraints over 9 iterations in 1269 ms. Result :sat
Minimization took 172 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 1891/1891 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 761 transition count 1890
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 760 transition count 1890
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 760 transition count 1889
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 4 place count 759 transition count 1889
Applied a total of 4 rules in 34 ms. Remains 759 /761 variables (removed 2) and now considering 1889/1891 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 759/761 places, 1889/1891 transitions.
// Phase 1: matrix 1889 rows 759 cols
[2023-03-11 03:26:53] [INFO ] Computed 69 place invariants in 37 ms
Incomplete random walk after 1000000 steps, including 16083 resets, run finished after 2653 ms. (steps per millisecond=376 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2195 resets, run finished after 924 ms. (steps per millisecond=1082 ) properties (out of 1) seen :0
[2023-03-11 03:26:57] [INFO ] Invariant cache hit.
[2023-03-11 03:26:57] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 03:26:57] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 307 ms returned sat
[2023-03-11 03:26:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:26:58] [INFO ] [Real]Absence check using state equation in 970 ms returned sat
[2023-03-11 03:26:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:26:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 03:26:59] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 80 ms returned sat
[2023-03-11 03:26:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:27:00] [INFO ] [Nat]Absence check using state equation in 920 ms returned sat
[2023-03-11 03:27:00] [INFO ] Computed and/alt/rep : 436/1824/436 causal constraints (skipped 1407 transitions) in 159 ms.
[2023-03-11 03:27:01] [INFO ] Added : 48 causal constraints over 10 iterations in 1641 ms. Result :sat
Minimization took 284 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 1889/1889 transitions.
Applied a total of 0 rules in 23 ms. Remains 759 /759 variables (removed 0) and now considering 1889/1889 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 759/759 places, 1889/1889 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 1889/1889 transitions.
Applied a total of 0 rules in 23 ms. Remains 759 /759 variables (removed 0) and now considering 1889/1889 (removed 0) transitions.
[2023-03-11 03:27:02] [INFO ] Invariant cache hit.
[2023-03-11 03:27:03] [INFO ] Implicit Places using invariants in 487 ms returned []
[2023-03-11 03:27:03] [INFO ] Invariant cache hit.
[2023-03-11 03:27:05] [INFO ] Implicit Places using invariants and state equation in 2241 ms returned []
Implicit Place search using SMT with State Equation took 2746 ms to find 0 implicit places.
[2023-03-11 03:27:05] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-11 03:27:05] [INFO ] Invariant cache hit.
[2023-03-11 03:27:06] [INFO ] Dead Transitions using invariants and state equation in 702 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3517 ms. Remains : 759/759 places, 1889/1889 transitions.
Ending property specific reduction for ASLink-PT-10a-UpperBounds-11 in 16065 ms.
Starting property specific reduction for ASLink-PT-10a-UpperBounds-12
// Phase 1: matrix 1891 rows 761 cols
[2023-03-11 03:27:06] [INFO ] Computed 69 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 175 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-11 03:27:06] [INFO ] Invariant cache hit.
[2023-03-11 03:27:06] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-11 03:27:06] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 24 ms returned sat
[2023-03-11 03:27:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:27:06] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2023-03-11 03:27:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:27:06] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-11 03:27:07] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 44 ms returned sat
[2023-03-11 03:27:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:27:07] [INFO ] [Nat]Absence check using state equation in 812 ms returned sat
[2023-03-11 03:27:08] [INFO ] Computed and/alt/rep : 438/1826/438 causal constraints (skipped 1407 transitions) in 140 ms.
[2023-03-11 03:27:10] [INFO ] Deduced a trap composed of 54 places in 288 ms of which 1 ms to minimize.
[2023-03-11 03:27:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 414 ms
[2023-03-11 03:27:10] [INFO ] Added : 75 causal constraints over 15 iterations in 2588 ms. Result :sat
Minimization took 278 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 1891/1891 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 761 transition count 1890
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 760 transition count 1890
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 760 transition count 1889
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 759 transition count 1889
Applied a total of 4 rules in 32 ms. Remains 759 /761 variables (removed 2) and now considering 1889/1891 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 759/761 places, 1889/1891 transitions.
// Phase 1: matrix 1889 rows 759 cols
[2023-03-11 03:27:11] [INFO ] Computed 69 place invariants in 30 ms
Incomplete random walk after 1000000 steps, including 16177 resets, run finished after 2677 ms. (steps per millisecond=373 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2209 resets, run finished after 929 ms. (steps per millisecond=1076 ) properties (out of 1) seen :0
[2023-03-11 03:27:14] [INFO ] Invariant cache hit.
[2023-03-11 03:27:14] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-11 03:27:14] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 46 ms returned sat
[2023-03-11 03:27:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:27:15] [INFO ] [Real]Absence check using state equation in 593 ms returned sat
[2023-03-11 03:27:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:27:15] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2023-03-11 03:27:15] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 33 ms returned sat
[2023-03-11 03:27:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:27:16] [INFO ] [Nat]Absence check using state equation in 952 ms returned sat
[2023-03-11 03:27:16] [INFO ] Computed and/alt/rep : 436/1824/436 causal constraints (skipped 1407 transitions) in 101 ms.
[2023-03-11 03:27:17] [INFO ] Added : 41 causal constraints over 9 iterations in 1108 ms. Result :sat
Minimization took 227 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 1889/1889 transitions.
Applied a total of 0 rules in 23 ms. Remains 759 /759 variables (removed 0) and now considering 1889/1889 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 759/759 places, 1889/1889 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 1889/1889 transitions.
Applied a total of 0 rules in 22 ms. Remains 759 /759 variables (removed 0) and now considering 1889/1889 (removed 0) transitions.
[2023-03-11 03:27:18] [INFO ] Invariant cache hit.
[2023-03-11 03:27:18] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-03-11 03:27:18] [INFO ] Invariant cache hit.
[2023-03-11 03:27:20] [INFO ] Implicit Places using invariants and state equation in 2006 ms returned []
Implicit Place search using SMT with State Equation took 2459 ms to find 0 implicit places.
[2023-03-11 03:27:21] [INFO ] Redundant transitions in 90 ms returned []
[2023-03-11 03:27:21] [INFO ] Invariant cache hit.
[2023-03-11 03:27:21] [INFO ] Dead Transitions using invariants and state equation in 660 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3242 ms. Remains : 759/759 places, 1889/1889 transitions.
Ending property specific reduction for ASLink-PT-10a-UpperBounds-12 in 15704 ms.
[2023-03-11 03:27:22] [INFO ] Flatten gal took : 208 ms
[2023-03-11 03:27:22] [INFO ] Applying decomposition
[2023-03-11 03:27:22] [INFO ] Flatten gal took : 139 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18044630819911132882.txt' '-o' '/tmp/graph18044630819911132882.bin' '-w' '/tmp/graph18044630819911132882.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18044630819911132882.bin' '-l' '-1' '-v' '-w' '/tmp/graph18044630819911132882.weights' '-q' '0' '-e' '0.001'
[2023-03-11 03:27:22] [INFO ] Decomposing Gal with order
[2023-03-11 03:27:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 03:27:22] [INFO ] Removed a total of 3786 redundant transitions.
[2023-03-11 03:27:23] [INFO ] Flatten gal took : 216 ms
[2023-03-11 03:27:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 141 labels/synchronizations in 41 ms.
[2023-03-11 03:27:23] [INFO ] Time to serialize gal into /tmp/UpperBounds8828439230713458927.gal : 26 ms
[2023-03-11 03:27:23] [INFO ] Time to serialize properties into /tmp/UpperBounds7441505189590810535.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8828439230713458927.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7441505189590810535.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds7441505189590810535.prop.
Detected timeout of ITS tools.
[2023-03-11 03:50:20] [INFO ] Applying decomposition
[2023-03-11 03:50:21] [INFO ] Flatten gal took : 997 ms
[2023-03-11 03:50:22] [INFO ] Decomposing Gal with order
[2023-03-11 03:50:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 03:50:23] [INFO ] Removed a total of 3580 redundant transitions.
[2023-03-11 03:50:24] [INFO ] Flatten gal took : 1363 ms
[2023-03-11 03:50:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 690 labels/synchronizations in 161 ms.
[2023-03-11 03:50:24] [INFO ] Time to serialize gal into /tmp/UpperBounds15092110218980689662.gal : 34 ms
[2023-03-11 03:50:24] [INFO ] Time to serialize properties into /tmp/UpperBounds15423035502777571276.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds15092110218980689662.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15423035502777571276.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds15423035502777571276.prop.
Detected timeout of ITS tools.
[2023-03-11 04:13:16] [INFO ] Flatten gal took : 446 ms
[2023-03-11 04:13:21] [INFO ] Input system was already deterministic with 1891 transitions.
[2023-03-11 04:13:21] [INFO ] Transformed 761 places.
[2023-03-11 04:13:21] [INFO ] Transformed 1891 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-11 04:13:22] [INFO ] Time to serialize gal into /tmp/UpperBounds2039272294620811252.gal : 29 ms
[2023-03-11 04:13:22] [INFO ] Time to serialize properties into /tmp/UpperBounds11671848371845618641.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2039272294620811252.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11671848371845618641.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds11671848371845618641.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 9968928 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16199600 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-10a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ASLink-PT-10a, 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 r005-oct2-167813592700157"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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