fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r005-oct2-167813592600077
Last Updated
May 14, 2023

About the Execution of ITS-Tools for ASLink-PT-05a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16194.876 3600000.00 3725634.00 1453.40 1 1 1 ? ? 1 1 1 1 1 1 ? 1 1 1 1 normal

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-167813592600077.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-05a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813592600077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.8K Feb 26 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 13:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 13:05 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:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 190K Feb 26 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 13:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 13:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 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 516K 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-05a-UpperBounds-00
FORMULA_NAME ASLink-PT-05a-UpperBounds-01
FORMULA_NAME ASLink-PT-05a-UpperBounds-02
FORMULA_NAME ASLink-PT-05a-UpperBounds-03
FORMULA_NAME ASLink-PT-05a-UpperBounds-04
FORMULA_NAME ASLink-PT-05a-UpperBounds-05
FORMULA_NAME ASLink-PT-05a-UpperBounds-06
FORMULA_NAME ASLink-PT-05a-UpperBounds-07
FORMULA_NAME ASLink-PT-05a-UpperBounds-08
FORMULA_NAME ASLink-PT-05a-UpperBounds-09
FORMULA_NAME ASLink-PT-05a-UpperBounds-10
FORMULA_NAME ASLink-PT-05a-UpperBounds-11
FORMULA_NAME ASLink-PT-05a-UpperBounds-12
FORMULA_NAME ASLink-PT-05a-UpperBounds-13
FORMULA_NAME ASLink-PT-05a-UpperBounds-14
FORMULA_NAME ASLink-PT-05a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678491471359

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-05a
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-10 23:37:54] [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-10 23:37:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 23:37:54] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2023-03-10 23:37:54] [INFO ] Transformed 1211 places.
[2023-03-10 23:37:54] [INFO ] Transformed 1827 transitions.
[2023-03-10 23:37:54] [INFO ] Found NUPN structural information;
[2023-03-10 23:37:54] [INFO ] Parsed PT model containing 1211 places and 1827 transitions and 6877 arcs in 260 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Ensure Unique test removed 19 transitions
Reduce redundant transitions removed 19 transitions.
// Phase 1: matrix 1808 rows 1211 cols
[2023-03-10 23:37:54] [INFO ] Computed 232 place invariants in 87 ms
Incomplete random walk after 10000 steps, including 60 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 16) seen :7
FORMULA ASLink-PT-05a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
[2023-03-10 23:37:55] [INFO ] Invariant cache hit.
[2023-03-10 23:37:55] [INFO ] [Real]Absence check using 56 positive place invariants in 28 ms returned sat
[2023-03-10 23:37:55] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 46 ms returned sat
[2023-03-10 23:37:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:37:56] [INFO ] [Real]Absence check using state equation in 843 ms returned sat
[2023-03-10 23:37:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:37:57] [INFO ] [Nat]Absence check using 56 positive place invariants in 26 ms returned sat
[2023-03-10 23:37:57] [INFO ] [Nat]Absence check using 56 positive and 176 generalized place invariants in 69 ms returned sat
[2023-03-10 23:37:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:38:01] [INFO ] [Nat]Absence check using state equation in 4594 ms returned unknown
[2023-03-10 23:38:02] [INFO ] [Real]Absence check using 56 positive place invariants in 49 ms returned sat
[2023-03-10 23:38:02] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 86 ms returned sat
[2023-03-10 23:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:38:02] [INFO ] [Real]Absence check using state equation in 770 ms returned sat
[2023-03-10 23:38:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:38:03] [INFO ] [Nat]Absence check using 56 positive place invariants in 23 ms returned sat
[2023-03-10 23:38:03] [INFO ] [Nat]Absence check using 56 positive and 176 generalized place invariants in 93 ms returned sat
[2023-03-10 23:38:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:38:08] [INFO ] [Nat]Absence check using state equation in 4655 ms returned unknown
[2023-03-10 23:38:08] [INFO ] [Real]Absence check using 56 positive place invariants in 21 ms returned sat
[2023-03-10 23:38:08] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 88 ms returned sat
[2023-03-10 23:38:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:38:09] [INFO ] [Real]Absence check using state equation in 871 ms returned sat
[2023-03-10 23:38:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:38:09] [INFO ] [Nat]Absence check using 56 positive place invariants in 24 ms returned sat
[2023-03-10 23:38:09] [INFO ] [Nat]Absence check using 56 positive and 176 generalized place invariants in 85 ms returned sat
[2023-03-10 23:38:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:38:11] [INFO ] [Nat]Absence check using state equation in 1438 ms returned sat
[2023-03-10 23:38:11] [INFO ] Computed and/alt/rep : 734/2638/734 causal constraints (skipped 1073 transitions) in 195 ms.
[2023-03-10 23:38:14] [INFO ] Added : 40 causal constraints over 8 iterations in 3031 ms. Result :unknown
[2023-03-10 23:38:14] [INFO ] [Real]Absence check using 56 positive place invariants in 72 ms returned sat
[2023-03-10 23:38:14] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 99 ms returned sat
[2023-03-10 23:38:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:38:15] [INFO ] [Real]Absence check using state equation in 846 ms returned sat
[2023-03-10 23:38:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:38:16] [INFO ] [Nat]Absence check using 56 positive place invariants in 75 ms returned sat
[2023-03-10 23:38:16] [INFO ] [Nat]Absence check using 56 positive and 176 generalized place invariants in 70 ms returned sat
[2023-03-10 23:38:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:38:20] [INFO ] [Nat]Absence check using state equation in 4591 ms returned unknown
[2023-03-10 23:38:21] [INFO ] [Real]Absence check using 56 positive place invariants in 21 ms returned sat
[2023-03-10 23:38:21] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 119 ms returned sat
[2023-03-10 23:38:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:38:22] [INFO ] [Real]Absence check using state equation in 1001 ms returned sat
[2023-03-10 23:38:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:38:22] [INFO ] [Nat]Absence check using 56 positive place invariants in 41 ms returned sat
[2023-03-10 23:38:22] [INFO ] [Nat]Absence check using 56 positive and 176 generalized place invariants in 41 ms returned sat
[2023-03-10 23:38:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:38:27] [INFO ] [Nat]Absence check using state equation in 4766 ms returned unknown
[2023-03-10 23:38:27] [INFO ] [Real]Absence check using 56 positive place invariants in 36 ms returned sat
[2023-03-10 23:38:28] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 54 ms returned sat
[2023-03-10 23:38:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:38:29] [INFO ] [Real]Absence check using state equation in 1143 ms returned sat
[2023-03-10 23:38:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:38:29] [INFO ] [Nat]Absence check using 56 positive place invariants in 36 ms returned sat
[2023-03-10 23:38:29] [INFO ] [Nat]Absence check using 56 positive and 176 generalized place invariants in 84 ms returned sat
[2023-03-10 23:38:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:38:32] [INFO ] [Nat]Absence check using state equation in 2874 ms returned sat
[2023-03-10 23:38:33] [INFO ] Deduced a trap composed of 26 places in 388 ms of which 9 ms to minimize.
[2023-03-10 23:38:33] [INFO ] Deduced a trap composed of 68 places in 273 ms of which 1 ms to minimize.
[2023-03-10 23:38:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 902 ms
[2023-03-10 23:38:33] [INFO ] Computed and/alt/rep : 734/2638/734 causal constraints (skipped 1073 transitions) in 156 ms.
[2023-03-10 23:38:34] [INFO ] Added : 5 causal constraints over 1 iterations in 855 ms. Result :unknown
[2023-03-10 23:38:34] [INFO ] [Real]Absence check using 56 positive place invariants in 68 ms returned sat
[2023-03-10 23:38:34] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 179 ms returned sat
[2023-03-10 23:38:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:38:35] [INFO ] [Real]Absence check using state equation in 974 ms returned sat
[2023-03-10 23:38:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:38:36] [INFO ] [Nat]Absence check using 56 positive place invariants in 25 ms returned sat
[2023-03-10 23:38:36] [INFO ] [Nat]Absence check using 56 positive and 176 generalized place invariants in 93 ms returned sat
[2023-03-10 23:38:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:38:41] [INFO ] [Nat]Absence check using state equation in 4616 ms returned unknown
[2023-03-10 23:38:41] [INFO ] [Real]Absence check using 56 positive place invariants in 126 ms returned sat
[2023-03-10 23:38:41] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 76 ms returned sat
[2023-03-10 23:38:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:38:42] [INFO ] [Real]Absence check using state equation in 679 ms returned sat
[2023-03-10 23:38:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:38:42] [INFO ] [Nat]Absence check using 56 positive place invariants in 24 ms returned sat
[2023-03-10 23:38:42] [INFO ] [Nat]Absence check using 56 positive and 176 generalized place invariants in 56 ms returned sat
[2023-03-10 23:38:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:38:43] [INFO ] [Nat]Absence check using state equation in 770 ms returned sat
[2023-03-10 23:38:43] [INFO ] Computed and/alt/rep : 734/2638/734 causal constraints (skipped 1073 transitions) in 161 ms.
[2023-03-10 23:38:47] [INFO ] Added : 5 causal constraints over 1 iterations in 3853 ms. Result :unknown
[2023-03-10 23:38:47] [INFO ] [Real]Absence check using 56 positive place invariants in 23 ms returned sat
[2023-03-10 23:38:47] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 53 ms returned sat
[2023-03-10 23:38:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:38:48] [INFO ] [Real]Absence check using state equation in 821 ms returned sat
[2023-03-10 23:38:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:38:48] [INFO ] [Nat]Absence check using 56 positive place invariants in 24 ms returned sat
[2023-03-10 23:38:48] [INFO ] [Nat]Absence check using 56 positive and 176 generalized place invariants in 68 ms returned sat
[2023-03-10 23:38:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:38:49] [INFO ] [Nat]Absence check using state equation in 824 ms returned sat
[2023-03-10 23:38:50] [INFO ] Deduced a trap composed of 51 places in 248 ms of which 2 ms to minimize.
[2023-03-10 23:38:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2968 ms
[2023-03-10 23:38:52] [INFO ] Computed and/alt/rep : 734/2638/734 causal constraints (skipped 1073 transitions) in 159 ms.
[2023-03-10 23:38:53] [INFO ] Added : 25 causal constraints over 5 iterations in 869 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA ASLink-PT-05a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 8 out of 1211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1211/1211 places, 1808/1808 transitions.
Ensure Unique test removed 20 places
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 1181 transition count 1702
Reduce places removed 106 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 107 rules applied. Total rules applied 243 place count 1075 transition count 1701
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 244 place count 1074 transition count 1701
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 244 place count 1074 transition count 1593
Deduced a syphon composed of 108 places in 4 ms
Ensure Unique test removed 41 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 257 rules applied. Total rules applied 501 place count 925 transition count 1593
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 502 place count 925 transition count 1592
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 503 place count 924 transition count 1592
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 511 place count 916 transition count 1551
Ensure Unique test removed 1 places
Iterating global reduction 5 with 9 rules applied. Total rules applied 520 place count 915 transition count 1551
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 526 place count 914 transition count 1546
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 529 place count 911 transition count 1546
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 530 place count 910 transition count 1538
Iterating global reduction 7 with 1 rules applied. Total rules applied 531 place count 910 transition count 1538
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 532 place count 909 transition count 1530
Iterating global reduction 7 with 1 rules applied. Total rules applied 533 place count 909 transition count 1530
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 534 place count 908 transition count 1522
Iterating global reduction 7 with 1 rules applied. Total rules applied 535 place count 908 transition count 1522
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 536 place count 907 transition count 1514
Iterating global reduction 7 with 1 rules applied. Total rules applied 537 place count 907 transition count 1514
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 538 place count 906 transition count 1506
Iterating global reduction 7 with 1 rules applied. Total rules applied 539 place count 906 transition count 1506
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 540 place count 905 transition count 1498
Iterating global reduction 7 with 1 rules applied. Total rules applied 541 place count 905 transition count 1498
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 542 place count 904 transition count 1490
Iterating global reduction 7 with 1 rules applied. Total rules applied 543 place count 904 transition count 1490
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 544 place count 903 transition count 1482
Iterating global reduction 7 with 1 rules applied. Total rules applied 545 place count 903 transition count 1482
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 546 place count 902 transition count 1474
Iterating global reduction 7 with 1 rules applied. Total rules applied 547 place count 902 transition count 1474
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 548 place count 901 transition count 1466
Iterating global reduction 7 with 1 rules applied. Total rules applied 549 place count 901 transition count 1466
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 550 place count 900 transition count 1458
Iterating global reduction 7 with 1 rules applied. Total rules applied 551 place count 900 transition count 1458
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 552 place count 899 transition count 1450
Iterating global reduction 7 with 1 rules applied. Total rules applied 553 place count 899 transition count 1450
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 554 place count 898 transition count 1442
Iterating global reduction 7 with 1 rules applied. Total rules applied 555 place count 898 transition count 1442
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 556 place count 897 transition count 1434
Iterating global reduction 7 with 1 rules applied. Total rules applied 557 place count 897 transition count 1434
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 558 place count 896 transition count 1426
Iterating global reduction 7 with 1 rules applied. Total rules applied 559 place count 896 transition count 1426
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 560 place count 895 transition count 1418
Iterating global reduction 7 with 1 rules applied. Total rules applied 561 place count 895 transition count 1418
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 70 rules applied. Total rules applied 631 place count 860 transition count 1383
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 635 place count 860 transition count 1379
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 639 place count 856 transition count 1379
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 645 place count 856 transition count 1379
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 646 place count 855 transition count 1378
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 656 place count 845 transition count 1378
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 20 Pre rules applied. Total rules applied 656 place count 845 transition count 1358
Deduced a syphon composed of 20 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 9 with 41 rules applied. Total rules applied 697 place count 824 transition count 1358
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 9 with 6 rules applied. Total rules applied 703 place count 818 transition count 1358
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 703 place count 818 transition count 1357
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 705 place count 817 transition count 1357
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 10 with 12 rules applied. Total rules applied 717 place count 811 transition count 1351
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 722 place count 806 transition count 1346
Iterating global reduction 10 with 5 rules applied. Total rules applied 727 place count 806 transition count 1346
Free-agglomeration rule applied 5 times.
Iterating global reduction 10 with 5 rules applied. Total rules applied 732 place count 806 transition count 1341
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 737 place count 801 transition count 1341
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 742 place count 801 transition count 1341
Applied a total of 742 rules in 1301 ms. Remains 801 /1211 variables (removed 410) and now considering 1341/1808 (removed 467) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1301 ms. Remains : 801/1211 places, 1341/1808 transitions.
// Phase 1: matrix 1341 rows 801 cols
[2023-03-10 23:38:57] [INFO ] Computed 142 place invariants in 49 ms
Incomplete random walk after 1000000 steps, including 11749 resets, run finished after 2838 ms. (steps per millisecond=352 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2313 resets, run finished after 1279 ms. (steps per millisecond=781 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2332 resets, run finished after 1344 ms. (steps per millisecond=744 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2312 resets, run finished after 1372 ms. (steps per millisecond=728 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2288 resets, run finished after 1207 ms. (steps per millisecond=828 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2342 resets, run finished after 1118 ms. (steps per millisecond=894 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2298 resets, run finished after 1322 ms. (steps per millisecond=756 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2297 resets, run finished after 1314 ms. (steps per millisecond=761 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2329 resets, run finished after 1347 ms. (steps per millisecond=742 ) properties (out of 8) seen :0
[2023-03-10 23:39:11] [INFO ] Invariant cache hit.
[2023-03-10 23:39:11] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2023-03-10 23:39:11] [INFO ] [Real]Absence check using 36 positive and 106 generalized place invariants in 29 ms returned sat
[2023-03-10 23:39:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:39:11] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2023-03-10 23:39:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:39:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 11 ms returned sat
[2023-03-10 23:39:12] [INFO ] [Nat]Absence check using 36 positive and 106 generalized place invariants in 66 ms returned sat
[2023-03-10 23:39:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:39:12] [INFO ] [Nat]Absence check using state equation in 677 ms returned sat
[2023-03-10 23:39:12] [INFO ] Computed and/alt/rep : 525/2013/525 causal constraints (skipped 787 transitions) in 147 ms.
[2023-03-10 23:39:21] [INFO ] Deduced a trap composed of 103 places in 483 ms of which 4 ms to minimize.
[2023-03-10 23:39:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 675 ms
[2023-03-10 23:39:21] [INFO ] Added : 342 causal constraints over 69 iterations in 9089 ms. Result :sat
Minimization took 451 ms.
[2023-03-10 23:39:22] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2023-03-10 23:39:22] [INFO ] [Real]Absence check using 36 positive and 106 generalized place invariants in 50 ms returned sat
[2023-03-10 23:39:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:39:23] [INFO ] [Real]Absence check using state equation in 452 ms returned sat
[2023-03-10 23:39:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:39:23] [INFO ] [Nat]Absence check using 36 positive place invariants in 11 ms returned sat
[2023-03-10 23:39:23] [INFO ] [Nat]Absence check using 36 positive and 106 generalized place invariants in 24 ms returned sat
[2023-03-10 23:39:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:39:24] [INFO ] [Nat]Absence check using state equation in 914 ms returned sat
[2023-03-10 23:39:24] [INFO ] Computed and/alt/rep : 525/2013/525 causal constraints (skipped 787 transitions) in 117 ms.
[2023-03-10 23:39:32] [INFO ] Added : 348 causal constraints over 70 iterations in 8107 ms. Result :sat
Minimization took 656 ms.
[2023-03-10 23:39:33] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2023-03-10 23:39:33] [INFO ] [Real]Absence check using 36 positive and 106 generalized place invariants in 56 ms returned sat
[2023-03-10 23:39:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:39:34] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2023-03-10 23:39:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:39:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2023-03-10 23:39:34] [INFO ] [Nat]Absence check using 36 positive and 106 generalized place invariants in 33 ms returned sat
[2023-03-10 23:39:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:39:35] [INFO ] [Nat]Absence check using state equation in 678 ms returned sat
[2023-03-10 23:39:35] [INFO ] Computed and/alt/rep : 525/2013/525 causal constraints (skipped 787 transitions) in 91 ms.
[2023-03-10 23:39:44] [INFO ] Deduced a trap composed of 84 places in 409 ms of which 4 ms to minimize.
[2023-03-10 23:39:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 544 ms
[2023-03-10 23:39:44] [INFO ] Added : 389 causal constraints over 78 iterations in 9573 ms. Result :sat
Minimization took 447 ms.
[2023-03-10 23:39:45] [INFO ] [Real]Absence check using 36 positive place invariants in 21 ms returned sat
[2023-03-10 23:39:45] [INFO ] [Real]Absence check using 36 positive and 106 generalized place invariants in 75 ms returned sat
[2023-03-10 23:39:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:39:45] [INFO ] [Real]Absence check using state equation in 565 ms returned sat
[2023-03-10 23:39:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:39:46] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2023-03-10 23:39:46] [INFO ] [Nat]Absence check using 36 positive and 106 generalized place invariants in 126 ms returned sat
[2023-03-10 23:39:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:39:47] [INFO ] [Nat]Absence check using state equation in 728 ms returned sat
[2023-03-10 23:39:47] [INFO ] Computed and/alt/rep : 525/2013/525 causal constraints (skipped 787 transitions) in 124 ms.
[2023-03-10 23:39:56] [INFO ] Added : 394 causal constraints over 79 iterations in 9205 ms. Result :sat
Minimization took 532 ms.
[2023-03-10 23:39:57] [INFO ] [Real]Absence check using 36 positive place invariants in 43 ms returned sat
[2023-03-10 23:39:57] [INFO ] [Real]Absence check using 36 positive and 106 generalized place invariants in 79 ms returned sat
[2023-03-10 23:39:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:39:57] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2023-03-10 23:39:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:39:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 27 ms returned sat
[2023-03-10 23:39:58] [INFO ] [Nat]Absence check using 36 positive and 106 generalized place invariants in 51 ms returned sat
[2023-03-10 23:39:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:39:58] [INFO ] [Nat]Absence check using state equation in 531 ms returned sat
[2023-03-10 23:39:58] [INFO ] Computed and/alt/rep : 525/2013/525 causal constraints (skipped 787 transitions) in 114 ms.
[2023-03-10 23:40:06] [INFO ] Added : 334 causal constraints over 67 iterations in 8091 ms. Result :sat
Minimization took 384 ms.
[2023-03-10 23:40:07] [INFO ] [Real]Absence check using 36 positive place invariants in 26 ms returned sat
[2023-03-10 23:40:07] [INFO ] [Real]Absence check using 36 positive and 106 generalized place invariants in 38 ms returned sat
[2023-03-10 23:40:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:40:08] [INFO ] [Real]Absence check using state equation in 488 ms returned sat
[2023-03-10 23:40:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:40:08] [INFO ] [Nat]Absence check using 36 positive place invariants in 25 ms returned sat
[2023-03-10 23:40:08] [INFO ] [Nat]Absence check using 36 positive and 106 generalized place invariants in 31 ms returned sat
[2023-03-10 23:40:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:40:09] [INFO ] [Nat]Absence check using state equation in 768 ms returned sat
[2023-03-10 23:40:09] [INFO ] Computed and/alt/rep : 525/2013/525 causal constraints (skipped 787 transitions) in 126 ms.
[2023-03-10 23:40:15] [INFO ] Added : 10 causal constraints over 2 iterations in 6407 ms. Result :unknown
[2023-03-10 23:40:15] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2023-03-10 23:40:15] [INFO ] [Real]Absence check using 36 positive and 106 generalized place invariants in 39 ms returned sat
[2023-03-10 23:40:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:40:16] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2023-03-10 23:40:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:40:16] [INFO ] [Nat]Absence check using 36 positive place invariants in 49 ms returned sat
[2023-03-10 23:40:16] [INFO ] [Nat]Absence check using 36 positive and 106 generalized place invariants in 69 ms returned sat
[2023-03-10 23:40:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:40:17] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2023-03-10 23:40:17] [INFO ] Computed and/alt/rep : 525/2013/525 causal constraints (skipped 787 transitions) in 126 ms.
[2023-03-10 23:40:27] [INFO ] Added : 388 causal constraints over 78 iterations in 9982 ms. Result :sat
Minimization took 384 ms.
[2023-03-10 23:40:27] [INFO ] [Real]Absence check using 36 positive place invariants in 60 ms returned sat
[2023-03-10 23:40:27] [INFO ] [Real]Absence check using 36 positive and 106 generalized place invariants in 114 ms returned sat
[2023-03-10 23:40:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:40:28] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2023-03-10 23:40:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:40:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 23 ms returned sat
[2023-03-10 23:40:28] [INFO ] [Nat]Absence check using 36 positive and 106 generalized place invariants in 45 ms returned sat
[2023-03-10 23:40:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:40:29] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2023-03-10 23:40:30] [INFO ] Deduced a trap composed of 158 places in 1509 ms of which 21 ms to minimize.
[2023-03-10 23:40:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1620 ms
[2023-03-10 23:40:31] [INFO ] Computed and/alt/rep : 525/2013/525 causal constraints (skipped 787 transitions) in 97 ms.
[2023-03-10 23:40:34] [INFO ] Added : 157 causal constraints over 32 iterations in 3792 ms. Result :sat
Minimization took 637 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Support contains 8 out of 801 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 801/801 places, 1341/1341 transitions.
Applied a total of 0 rules in 27 ms. Remains 801 /801 variables (removed 0) and now considering 1341/1341 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 801/801 places, 1341/1341 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 801/801 places, 1341/1341 transitions.
Applied a total of 0 rules in 39 ms. Remains 801 /801 variables (removed 0) and now considering 1341/1341 (removed 0) transitions.
[2023-03-10 23:40:39] [INFO ] Invariant cache hit.
[2023-03-10 23:40:39] [INFO ] Implicit Places using invariants in 676 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 148, 149, 150, 168, 186, 223, 257, 261, 262, 273, 274, 275, 293, 311, 346, 382, 386, 387, 398, 399, 400, 418, 436, 505, 509, 510, 521, 522, 523, 541, 559, 628, 632, 633, 636, 647, 648, 649, 667, 669, 672, 690, 691, 692, 693, 705, 711, 717, 723, 729, 735, 741, 747, 753, 759, 765]
Discarding 64 places :
Implicit Place search using SMT only with invariants took 681 ms to find 64 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 737/801 places, 1341/1341 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 737 transition count 1245
Reduce places removed 96 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 105 rules applied. Total rules applied 201 place count 641 transition count 1236
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 210 place count 632 transition count 1236
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 210 place count 632 transition count 1210
Deduced a syphon composed of 26 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 53 rules applied. Total rules applied 263 place count 605 transition count 1210
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 275 place count 601 transition count 1202
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 283 place count 593 transition count 1202
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 298 place count 578 transition count 1187
Iterating global reduction 5 with 15 rules applied. Total rules applied 313 place count 578 transition count 1187
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 316 place count 578 transition count 1184
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 316 place count 578 transition count 1183
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 318 place count 577 transition count 1183
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 321 place count 574 transition count 1180
Iterating global reduction 6 with 3 rules applied. Total rules applied 324 place count 574 transition count 1180
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 325 place count 573 transition count 1179
Iterating global reduction 6 with 1 rules applied. Total rules applied 326 place count 573 transition count 1179
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 327 place count 572 transition count 1178
Iterating global reduction 6 with 1 rules applied. Total rules applied 328 place count 572 transition count 1178
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 6 with 92 rules applied. Total rules applied 420 place count 526 transition count 1132
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 425 place count 526 transition count 1127
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 430 place count 521 transition count 1122
Iterating global reduction 7 with 5 rules applied. Total rules applied 435 place count 521 transition count 1122
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 440 place count 521 transition count 1117
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 8 with 10 rules applied. Total rules applied 450 place count 521 transition count 1107
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 461 place count 510 transition count 1107
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 9 with 16 rules applied. Total rules applied 477 place count 510 transition count 1107
Applied a total of 477 rules in 275 ms. Remains 510 /737 variables (removed 227) and now considering 1107/1341 (removed 234) transitions.
// Phase 1: matrix 1107 rows 510 cols
[2023-03-10 23:40:40] [INFO ] Computed 72 place invariants in 34 ms
[2023-03-10 23:40:40] [INFO ] Implicit Places using invariants in 580 ms returned [72, 89, 95, 98, 100, 103, 104, 156, 176, 182, 185, 187, 192, 193, 245, 264, 270, 273, 275, 280, 281, 333, 350, 356, 359, 361, 366, 367, 419, 436, 442, 445, 447]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 583 ms to find 33 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 477/801 places, 1107/1341 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 462 transition count 1092
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 462 transition count 1092
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 457 transition count 1087
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 457 transition count 1087
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 58 place count 448 transition count 1078
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 73 place count 448 transition count 1063
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 88 place count 433 transition count 1063
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 92 place count 433 transition count 1059
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 96 place count 429 transition count 1059
Applied a total of 96 rules in 80 ms. Remains 429 /477 variables (removed 48) and now considering 1059/1107 (removed 48) transitions.
// Phase 1: matrix 1059 rows 429 cols
[2023-03-10 23:40:40] [INFO ] Computed 39 place invariants in 17 ms
[2023-03-10 23:40:41] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-10 23:40:41] [INFO ] Invariant cache hit.
[2023-03-10 23:40:42] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1160 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 429/801 places, 1059/1341 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2818 ms. Remains : 429/801 places, 1059/1341 transitions.
Successfully produced net in file /tmp/petri1000_3446962056104635397.dot
Successfully produced net in file /tmp/petri1001_13115681642314921344.dot
Successfully produced net in file /tmp/petri1002_1904803832862763593.dot
Successfully produced net in file /tmp/petri1003_13634777432480554355.dot
Successfully produced net in file /tmp/petri1004_16971255484791437511.dot
Drop transitions removed 5 transitions
Dominated transitions for bounds rules discarded 5 transitions
// Phase 1: matrix 1054 rows 429 cols
[2023-03-10 23:40:42] [INFO ] Computed 39 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 18300 resets, run finished after 2246 ms. (steps per millisecond=445 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4710 resets, run finished after 791 ms. (steps per millisecond=1264 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4762 resets, run finished after 867 ms. (steps per millisecond=1153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4747 resets, run finished after 846 ms. (steps per millisecond=1182 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4784 resets, run finished after 827 ms. (steps per millisecond=1209 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4852 resets, run finished after 889 ms. (steps per millisecond=1124 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4779 resets, run finished after 833 ms. (steps per millisecond=1200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4763 resets, run finished after 816 ms. (steps per millisecond=1225 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4767 resets, run finished after 805 ms. (steps per millisecond=1242 ) properties (out of 8) seen :0
[2023-03-10 23:40:51] [INFO ] Invariant cache hit.
[2023-03-10 23:40:51] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-10 23:40:51] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 11 ms returned sat
[2023-03-10 23:40:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:40:51] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2023-03-10 23:40:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:40:51] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-10 23:40:51] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 10 ms returned sat
[2023-03-10 23:40:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:40:52] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2023-03-10 23:40:52] [INFO ] Computed and/alt/rep : 233/1081/233 causal constraints (skipped 795 transitions) in 94 ms.
[2023-03-10 23:40:53] [INFO ] Added : 31 causal constraints over 7 iterations in 872 ms. Result :sat
Minimization took 217 ms.
[2023-03-10 23:40:53] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-10 23:40:53] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 17 ms returned sat
[2023-03-10 23:40:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:40:53] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2023-03-10 23:40:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:40:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-10 23:40:54] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-10 23:40:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:40:54] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2023-03-10 23:40:54] [INFO ] Computed and/alt/rep : 233/1081/233 causal constraints (skipped 795 transitions) in 93 ms.
[2023-03-10 23:40:56] [INFO ] Added : 61 causal constraints over 13 iterations in 2246 ms. Result :sat
Minimization took 228 ms.
[2023-03-10 23:40:57] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-10 23:40:57] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 35 ms returned sat
[2023-03-10 23:40:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:40:57] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2023-03-10 23:40:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:40:57] [INFO ] [Nat]Absence check using 12 positive place invariants in 34 ms returned sat
[2023-03-10 23:40:57] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 10 ms returned sat
[2023-03-10 23:40:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:40:58] [INFO ] [Nat]Absence check using state equation in 680 ms returned sat
[2023-03-10 23:40:58] [INFO ] Computed and/alt/rep : 233/1081/233 causal constraints (skipped 795 transitions) in 155 ms.
[2023-03-10 23:40:59] [INFO ] Added : 40 causal constraints over 10 iterations in 993 ms. Result :sat
Minimization took 198 ms.
[2023-03-10 23:40:59] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-10 23:40:59] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 12 ms returned sat
[2023-03-10 23:40:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:00] [INFO ] [Real]Absence check using state equation in 564 ms returned sat
[2023-03-10 23:41:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:41:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-10 23:41:00] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 19 ms returned sat
[2023-03-10 23:41:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:01] [INFO ] [Nat]Absence check using state equation in 546 ms returned sat
[2023-03-10 23:41:01] [INFO ] Computed and/alt/rep : 233/1081/233 causal constraints (skipped 795 transitions) in 89 ms.
[2023-03-10 23:41:02] [INFO ] Added : 45 causal constraints over 10 iterations in 1028 ms. Result :sat
Minimization took 204 ms.
[2023-03-10 23:41:02] [INFO ] [Real]Absence check using 12 positive place invariants in 63 ms returned sat
[2023-03-10 23:41:02] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 17 ms returned sat
[2023-03-10 23:41:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:03] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2023-03-10 23:41:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:41:03] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-03-10 23:41:03] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 10 ms returned sat
[2023-03-10 23:41:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:03] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2023-03-10 23:41:03] [INFO ] Computed and/alt/rep : 233/1081/233 causal constraints (skipped 795 transitions) in 71 ms.
[2023-03-10 23:41:04] [INFO ] Added : 29 causal constraints over 6 iterations in 743 ms. Result :sat
Minimization took 253 ms.
[2023-03-10 23:41:04] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-10 23:41:04] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 10 ms returned sat
[2023-03-10 23:41:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:05] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2023-03-10 23:41:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:41:05] [INFO ] [Nat]Absence check using 12 positive place invariants in 68 ms returned sat
[2023-03-10 23:41:05] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 23 ms returned sat
[2023-03-10 23:41:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:06] [INFO ] [Nat]Absence check using state equation in 760 ms returned sat
[2023-03-10 23:41:06] [INFO ] Computed and/alt/rep : 233/1081/233 causal constraints (skipped 795 transitions) in 87 ms.
[2023-03-10 23:41:08] [INFO ] Added : 75 causal constraints over 15 iterations in 1839 ms. Result :sat
Minimization took 303 ms.
[2023-03-10 23:41:08] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-10 23:41:08] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 10 ms returned sat
[2023-03-10 23:41:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:09] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2023-03-10 23:41:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:41:09] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-10 23:41:09] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 27 ms returned sat
[2023-03-10 23:41:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:09] [INFO ] [Nat]Absence check using state equation in 604 ms returned sat
[2023-03-10 23:41:09] [INFO ] Computed and/alt/rep : 233/1081/233 causal constraints (skipped 795 transitions) in 95 ms.
[2023-03-10 23:41:11] [INFO ] Added : 73 causal constraints over 15 iterations in 1695 ms. Result :sat
Minimization took 211 ms.
[2023-03-10 23:41:11] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-10 23:41:12] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 28 ms returned sat
[2023-03-10 23:41:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:12] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2023-03-10 23:41:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:41:12] [INFO ] [Nat]Absence check using 12 positive place invariants in 91 ms returned sat
[2023-03-10 23:41:12] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2023-03-10 23:41:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:13] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2023-03-10 23:41:13] [INFO ] Computed and/alt/rep : 233/1081/233 causal constraints (skipped 795 transitions) in 76 ms.
[2023-03-10 23:41:13] [INFO ] Added : 23 causal constraints over 5 iterations in 514 ms. Result :sat
Minimization took 221 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
FORMULA ASLink-PT-05a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 7 out of 429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 1054/1054 transitions.
Graph (complete) has 2597 edges and 429 vertex of which 424 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.15 ms
Discarding 5 places :
Also discarding 0 output transitions
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 424 transition count 1053
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 423 transition count 1053
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 8 place count 423 transition count 1053
Applied a total of 8 rules in 85 ms. Remains 423 /429 variables (removed 6) and now considering 1053/1054 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 423/429 places, 1053/1054 transitions.
// Phase 1: matrix 1053 rows 423 cols
[2023-03-10 23:41:15] [INFO ] Computed 39 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 18409 resets, run finished after 2053 ms. (steps per millisecond=487 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4773 resets, run finished after 833 ms. (steps per millisecond=1200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4770 resets, run finished after 849 ms. (steps per millisecond=1177 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4784 resets, run finished after 818 ms. (steps per millisecond=1222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4736 resets, run finished after 792 ms. (steps per millisecond=1262 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4696 resets, run finished after 898 ms. (steps per millisecond=1113 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4778 resets, run finished after 853 ms. (steps per millisecond=1172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4758 resets, run finished after 823 ms. (steps per millisecond=1215 ) properties (out of 7) seen :0
[2023-03-10 23:41:23] [INFO ] Invariant cache hit.
[2023-03-10 23:41:24] [INFO ] [Real]Absence check using 10 positive place invariants in 79 ms returned sat
[2023-03-10 23:41:24] [INFO ] [Real]Absence check using 10 positive and 29 generalized place invariants in 74 ms returned sat
[2023-03-10 23:41:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:24] [INFO ] [Real]Absence check using state equation in 560 ms returned sat
[2023-03-10 23:41:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:41:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-10 23:41:24] [INFO ] [Nat]Absence check using 10 positive and 29 generalized place invariants in 14 ms returned sat
[2023-03-10 23:41:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:25] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2023-03-10 23:41:25] [INFO ] Computed and/alt/rep : 225/1015/225 causal constraints (skipped 802 transitions) in 126 ms.
[2023-03-10 23:41:26] [INFO ] Added : 49 causal constraints over 10 iterations in 1063 ms. Result :sat
Minimization took 204 ms.
[2023-03-10 23:41:26] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-10 23:41:26] [INFO ] [Real]Absence check using 10 positive and 29 generalized place invariants in 20 ms returned sat
[2023-03-10 23:41:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:27] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2023-03-10 23:41:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:41:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-10 23:41:27] [INFO ] [Nat]Absence check using 10 positive and 29 generalized place invariants in 9 ms returned sat
[2023-03-10 23:41:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:28] [INFO ] [Nat]Absence check using state equation in 616 ms returned sat
[2023-03-10 23:41:28] [INFO ] Computed and/alt/rep : 225/1015/225 causal constraints (skipped 802 transitions) in 84 ms.
[2023-03-10 23:41:28] [INFO ] Added : 19 causal constraints over 4 iterations in 690 ms. Result :sat
Minimization took 278 ms.
[2023-03-10 23:41:29] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-10 23:41:29] [INFO ] [Real]Absence check using 10 positive and 29 generalized place invariants in 10 ms returned sat
[2023-03-10 23:41:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:29] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2023-03-10 23:41:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:41:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-10 23:41:29] [INFO ] [Nat]Absence check using 10 positive and 29 generalized place invariants in 8 ms returned sat
[2023-03-10 23:41:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:30] [INFO ] [Nat]Absence check using state equation in 740 ms returned sat
[2023-03-10 23:41:30] [INFO ] Computed and/alt/rep : 225/1015/225 causal constraints (skipped 802 transitions) in 115 ms.
[2023-03-10 23:41:30] [INFO ] Added : 18 causal constraints over 4 iterations in 487 ms. Result :sat
Minimization took 176 ms.
[2023-03-10 23:41:31] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-10 23:41:31] [INFO ] [Real]Absence check using 10 positive and 29 generalized place invariants in 46 ms returned sat
[2023-03-10 23:41:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:31] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2023-03-10 23:41:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:41:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-10 23:41:31] [INFO ] [Nat]Absence check using 10 positive and 29 generalized place invariants in 14 ms returned sat
[2023-03-10 23:41:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:32] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2023-03-10 23:41:32] [INFO ] Computed and/alt/rep : 225/1015/225 causal constraints (skipped 802 transitions) in 79 ms.
[2023-03-10 23:41:33] [INFO ] Added : 31 causal constraints over 7 iterations in 914 ms. Result :sat
Minimization took 328 ms.
[2023-03-10 23:41:33] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-10 23:41:33] [INFO ] [Real]Absence check using 10 positive and 29 generalized place invariants in 69 ms returned sat
[2023-03-10 23:41:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:34] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2023-03-10 23:41:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:41:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 25 ms returned sat
[2023-03-10 23:41:34] [INFO ] [Nat]Absence check using 10 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-10 23:41:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:35] [INFO ] [Nat]Absence check using state equation in 576 ms returned sat
[2023-03-10 23:41:35] [INFO ] Computed and/alt/rep : 225/1015/225 causal constraints (skipped 802 transitions) in 104 ms.
[2023-03-10 23:41:35] [INFO ] Added : 16 causal constraints over 4 iterations in 505 ms. Result :sat
Minimization took 232 ms.
[2023-03-10 23:41:35] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-10 23:41:36] [INFO ] [Real]Absence check using 10 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-10 23:41:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:36] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2023-03-10 23:41:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:41:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-10 23:41:36] [INFO ] [Nat]Absence check using 10 positive and 29 generalized place invariants in 18 ms returned sat
[2023-03-10 23:41:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:37] [INFO ] [Nat]Absence check using state equation in 497 ms returned sat
[2023-03-10 23:41:37] [INFO ] Computed and/alt/rep : 225/1015/225 causal constraints (skipped 802 transitions) in 93 ms.
[2023-03-10 23:41:38] [INFO ] Added : 30 causal constraints over 9 iterations in 1334 ms. Result :sat
Minimization took 355 ms.
[2023-03-10 23:41:38] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-10 23:41:39] [INFO ] [Real]Absence check using 10 positive and 29 generalized place invariants in 13 ms returned sat
[2023-03-10 23:41:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:39] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2023-03-10 23:41:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:41:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-10 23:41:39] [INFO ] [Nat]Absence check using 10 positive and 29 generalized place invariants in 114 ms returned sat
[2023-03-10 23:41:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:40] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2023-03-10 23:41:41] [INFO ] Deduced a trap composed of 53 places in 1480 ms of which 2 ms to minimize.
[2023-03-10 23:41:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1589 ms
[2023-03-10 23:41:41] [INFO ] Computed and/alt/rep : 225/1015/225 causal constraints (skipped 802 transitions) in 87 ms.
[2023-03-10 23:41:42] [INFO ] Added : 19 causal constraints over 4 iterations in 498 ms. Result :sat
Minimization took 149 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA ASLink-PT-05a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-05a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-05a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-05a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1053/1053 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 422 transition count 1052
Applied a total of 2 rules in 22 ms. Remains 422 /423 variables (removed 1) and now considering 1052/1053 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 422/423 places, 1052/1053 transitions.
// Phase 1: matrix 1052 rows 422 cols
[2023-03-10 23:41:43] [INFO ] Computed 39 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 18350 resets, run finished after 2000 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4738 resets, run finished after 823 ms. (steps per millisecond=1215 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4751 resets, run finished after 781 ms. (steps per millisecond=1280 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4713 resets, run finished after 840 ms. (steps per millisecond=1190 ) properties (out of 3) seen :0
[2023-03-10 23:41:48] [INFO ] Invariant cache hit.
[2023-03-10 23:41:48] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-10 23:41:48] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 18 ms returned sat
[2023-03-10 23:41:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:48] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2023-03-10 23:41:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:41:48] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-10 23:41:48] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 19 ms returned sat
[2023-03-10 23:41:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:49] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2023-03-10 23:41:49] [INFO ] Computed and/alt/rep : 224/1007/224 causal constraints (skipped 802 transitions) in 94 ms.
[2023-03-10 23:41:50] [INFO ] Added : 44 causal constraints over 9 iterations in 929 ms. Result :sat
Minimization took 207 ms.
[2023-03-10 23:41:50] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2023-03-10 23:41:50] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 28 ms returned sat
[2023-03-10 23:41:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:51] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2023-03-10 23:41:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:41:51] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-10 23:41:51] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2023-03-10 23:41:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:51] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2023-03-10 23:41:51] [INFO ] Computed and/alt/rep : 224/1007/224 causal constraints (skipped 802 transitions) in 71 ms.
[2023-03-10 23:41:52] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 1 ms to minimize.
[2023-03-10 23:41:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2023-03-10 23:41:52] [INFO ] Added : 45 causal constraints over 9 iterations in 1185 ms. Result :sat
Minimization took 157 ms.
[2023-03-10 23:41:53] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-10 23:41:53] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 49 ms returned sat
[2023-03-10 23:41:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:53] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2023-03-10 23:41:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:41:53] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-10 23:41:53] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 11 ms returned sat
[2023-03-10 23:41:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:54] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2023-03-10 23:41:54] [INFO ] Computed and/alt/rep : 224/1007/224 causal constraints (skipped 802 transitions) in 72 ms.
[2023-03-10 23:41:55] [INFO ] Added : 44 causal constraints over 9 iterations in 1003 ms. Result :sat
Minimization took 168 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1052/1052 transitions.
Applied a total of 0 rules in 15 ms. Remains 422 /422 variables (removed 0) and now considering 1052/1052 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 422/422 places, 1052/1052 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1052/1052 transitions.
Applied a total of 0 rules in 13 ms. Remains 422 /422 variables (removed 0) and now considering 1052/1052 (removed 0) transitions.
[2023-03-10 23:41:55] [INFO ] Invariant cache hit.
[2023-03-10 23:41:56] [INFO ] Implicit Places using invariants in 348 ms returned []
[2023-03-10 23:41:56] [INFO ] Invariant cache hit.
[2023-03-10 23:41:57] [INFO ] Implicit Places using invariants and state equation in 1468 ms returned []
Implicit Place search using SMT with State Equation took 1844 ms to find 0 implicit places.
[2023-03-10 23:41:57] [INFO ] Redundant transitions in 80 ms returned []
[2023-03-10 23:41:57] [INFO ] Invariant cache hit.
[2023-03-10 23:41:58] [INFO ] Dead Transitions using invariants and state equation in 508 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2455 ms. Remains : 422/422 places, 1052/1052 transitions.
Starting property specific reduction for ASLink-PT-05a-UpperBounds-03
[2023-03-10 23:41:58] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 174 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-10 23:41:58] [INFO ] Invariant cache hit.
[2023-03-10 23:41:58] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-10 23:41:58] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-10 23:41:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:58] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2023-03-10 23:41:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:41:58] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-10 23:41:58] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2023-03-10 23:41:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:41:59] [INFO ] [Nat]Absence check using state equation in 324 ms returned sat
[2023-03-10 23:41:59] [INFO ] Computed and/alt/rep : 224/1007/224 causal constraints (skipped 802 transitions) in 108 ms.
[2023-03-10 23:42:00] [INFO ] Added : 44 causal constraints over 9 iterations in 947 ms. Result :sat
Minimization took 189 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1052/1052 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 422 transition count 1050
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 420 transition count 1050
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 420 transition count 1049
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 419 transition count 1049
Applied a total of 6 rules in 17 ms. Remains 419 /422 variables (removed 3) and now considering 1049/1052 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 419/422 places, 1049/1052 transitions.
// Phase 1: matrix 1049 rows 419 cols
[2023-03-10 23:42:00] [INFO ] Computed 39 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 18458 resets, run finished after 1931 ms. (steps per millisecond=517 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4765 resets, run finished after 854 ms. (steps per millisecond=1170 ) properties (out of 1) seen :0
[2023-03-10 23:42:03] [INFO ] Invariant cache hit.
[2023-03-10 23:42:03] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-10 23:42:03] [INFO ] [Real]Absence check using 10 positive and 29 generalized place invariants in 23 ms returned sat
[2023-03-10 23:42:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:42:04] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2023-03-10 23:42:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:42:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-10 23:42:04] [INFO ] [Nat]Absence check using 10 positive and 29 generalized place invariants in 8 ms returned sat
[2023-03-10 23:42:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:42:04] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2023-03-10 23:42:04] [INFO ] Computed and/alt/rep : 221/1004/221 causal constraints (skipped 802 transitions) in 76 ms.
[2023-03-10 23:42:05] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 1 ms to minimize.
[2023-03-10 23:42:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 349 ms
[2023-03-10 23:42:05] [INFO ] Added : 34 causal constraints over 9 iterations in 1163 ms. Result :sat
Minimization took 170 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1049/1049 transitions.
Applied a total of 0 rules in 14 ms. Remains 419 /419 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 419/419 places, 1049/1049 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1049/1049 transitions.
Applied a total of 0 rules in 13 ms. Remains 419 /419 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
[2023-03-10 23:42:06] [INFO ] Invariant cache hit.
[2023-03-10 23:42:06] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-10 23:42:06] [INFO ] Invariant cache hit.
[2023-03-10 23:42:07] [INFO ] Implicit Places using invariants and state equation in 1130 ms returned []
Implicit Place search using SMT with State Equation took 1466 ms to find 0 implicit places.
[2023-03-10 23:42:07] [INFO ] Redundant transitions in 85 ms returned []
[2023-03-10 23:42:07] [INFO ] Invariant cache hit.
[2023-03-10 23:42:08] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2116 ms. Remains : 419/419 places, 1049/1049 transitions.
Ending property specific reduction for ASLink-PT-05a-UpperBounds-03 in 9848 ms.
Starting property specific reduction for ASLink-PT-05a-UpperBounds-04
// Phase 1: matrix 1052 rows 422 cols
[2023-03-10 23:42:08] [INFO ] Computed 39 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 196 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-10 23:42:08] [INFO ] Invariant cache hit.
[2023-03-10 23:42:08] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-10 23:42:08] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-10 23:42:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:42:08] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2023-03-10 23:42:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:42:08] [INFO ] [Nat]Absence check using 12 positive place invariants in 26 ms returned sat
[2023-03-10 23:42:08] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 32 ms returned sat
[2023-03-10 23:42:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:42:09] [INFO ] [Nat]Absence check using state equation in 543 ms returned sat
[2023-03-10 23:42:09] [INFO ] Computed and/alt/rep : 224/1007/224 causal constraints (skipped 802 transitions) in 85 ms.
[2023-03-10 23:42:10] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 1 ms to minimize.
[2023-03-10 23:42:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2023-03-10 23:42:10] [INFO ] Added : 45 causal constraints over 9 iterations in 1199 ms. Result :sat
Minimization took 123 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1052/1052 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 422 transition count 1050
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 420 transition count 1050
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 420 transition count 1049
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 419 transition count 1049
Applied a total of 6 rules in 21 ms. Remains 419 /422 variables (removed 3) and now considering 1049/1052 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 419/422 places, 1049/1052 transitions.
// Phase 1: matrix 1049 rows 419 cols
[2023-03-10 23:42:11] [INFO ] Computed 39 place invariants in 28 ms
Incomplete random walk after 1000000 steps, including 18371 resets, run finished after 2033 ms. (steps per millisecond=491 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4767 resets, run finished after 804 ms. (steps per millisecond=1243 ) properties (out of 1) seen :0
[2023-03-10 23:42:14] [INFO ] Invariant cache hit.
[2023-03-10 23:42:14] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-10 23:42:14] [INFO ] [Real]Absence check using 10 positive and 29 generalized place invariants in 133 ms returned sat
[2023-03-10 23:42:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:42:14] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2023-03-10 23:42:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:42:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-10 23:42:14] [INFO ] [Nat]Absence check using 10 positive and 29 generalized place invariants in 21 ms returned sat
[2023-03-10 23:42:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:42:15] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2023-03-10 23:42:15] [INFO ] Computed and/alt/rep : 221/1004/221 causal constraints (skipped 802 transitions) in 72 ms.
[2023-03-10 23:42:16] [INFO ] Deduced a trap composed of 64 places in 282 ms of which 1 ms to minimize.
[2023-03-10 23:42:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 367 ms
[2023-03-10 23:42:16] [INFO ] Added : 40 causal constraints over 8 iterations in 1181 ms. Result :sat
Minimization took 133 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1049/1049 transitions.
Applied a total of 0 rules in 11 ms. Remains 419 /419 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 419/419 places, 1049/1049 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1049/1049 transitions.
Applied a total of 0 rules in 11 ms. Remains 419 /419 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
[2023-03-10 23:42:16] [INFO ] Invariant cache hit.
[2023-03-10 23:42:17] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-10 23:42:17] [INFO ] Invariant cache hit.
[2023-03-10 23:42:18] [INFO ] Implicit Places using invariants and state equation in 1326 ms returned []
Implicit Place search using SMT with State Equation took 1711 ms to find 0 implicit places.
[2023-03-10 23:42:18] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-10 23:42:18] [INFO ] Invariant cache hit.
[2023-03-10 23:42:19] [INFO ] Dead Transitions using invariants and state equation in 635 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2397 ms. Remains : 419/419 places, 1049/1049 transitions.
Ending property specific reduction for ASLink-PT-05a-UpperBounds-04 in 10849 ms.
Starting property specific reduction for ASLink-PT-05a-UpperBounds-11
// Phase 1: matrix 1052 rows 422 cols
[2023-03-10 23:42:19] [INFO ] Computed 39 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 175 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-10 23:42:19] [INFO ] Invariant cache hit.
[2023-03-10 23:42:19] [INFO ] [Real]Absence check using 12 positive place invariants in 17 ms returned sat
[2023-03-10 23:42:19] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 112 ms returned sat
[2023-03-10 23:42:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:42:19] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2023-03-10 23:42:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:42:20] [INFO ] [Nat]Absence check using 12 positive place invariants in 10 ms returned sat
[2023-03-10 23:42:20] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 29 ms returned sat
[2023-03-10 23:42:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:42:20] [INFO ] [Nat]Absence check using state equation in 583 ms returned sat
[2023-03-10 23:42:20] [INFO ] Computed and/alt/rep : 224/1007/224 causal constraints (skipped 802 transitions) in 75 ms.
[2023-03-10 23:42:21] [INFO ] Added : 44 causal constraints over 9 iterations in 915 ms. Result :sat
Minimization took 184 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1052/1052 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 422 transition count 1050
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 420 transition count 1050
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 420 transition count 1048
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 418 transition count 1048
Applied a total of 8 rules in 19 ms. Remains 418 /422 variables (removed 4) and now considering 1048/1052 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 418/422 places, 1048/1052 transitions.
// Phase 1: matrix 1048 rows 418 cols
[2023-03-10 23:42:22] [INFO ] Computed 39 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 18635 resets, run finished after 1978 ms. (steps per millisecond=505 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4791 resets, run finished after 829 ms. (steps per millisecond=1206 ) properties (out of 1) seen :0
[2023-03-10 23:42:24] [INFO ] Invariant cache hit.
[2023-03-10 23:42:24] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-10 23:42:24] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 17 ms returned sat
[2023-03-10 23:42:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:42:25] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2023-03-10 23:42:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:42:25] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-10 23:42:25] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 12 ms returned sat
[2023-03-10 23:42:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:42:25] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2023-03-10 23:42:26] [INFO ] Computed and/alt/rep : 220/1003/220 causal constraints (skipped 802 transitions) in 83 ms.
[2023-03-10 23:42:27] [INFO ] Added : 53 causal constraints over 12 iterations in 1240 ms. Result :sat
Minimization took 194 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 1048/1048 transitions.
Applied a total of 0 rules in 11 ms. Remains 418 /418 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 418/418 places, 1048/1048 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 1048/1048 transitions.
Applied a total of 0 rules in 11 ms. Remains 418 /418 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
[2023-03-10 23:42:27] [INFO ] Invariant cache hit.
[2023-03-10 23:42:28] [INFO ] Implicit Places using invariants in 478 ms returned []
[2023-03-10 23:42:28] [INFO ] Invariant cache hit.
[2023-03-10 23:42:29] [INFO ] Implicit Places using invariants and state equation in 1196 ms returned []
Implicit Place search using SMT with State Equation took 1701 ms to find 0 implicit places.
[2023-03-10 23:42:29] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-10 23:42:29] [INFO ] Invariant cache hit.
[2023-03-10 23:42:30] [INFO ] Dead Transitions using invariants and state equation in 1116 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2880 ms. Remains : 418/418 places, 1048/1048 transitions.
Ending property specific reduction for ASLink-PT-05a-UpperBounds-11 in 11534 ms.
[2023-03-10 23:42:30] [INFO ] Flatten gal took : 129 ms
[2023-03-10 23:42:31] [INFO ] Applying decomposition
[2023-03-10 23:42:31] [INFO ] Flatten gal took : 72 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/graph5173398400259894738.txt' '-o' '/tmp/graph5173398400259894738.bin' '-w' '/tmp/graph5173398400259894738.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5173398400259894738.bin' '-l' '-1' '-v' '-w' '/tmp/graph5173398400259894738.weights' '-q' '0' '-e' '0.001'
[2023-03-10 23:42:31] [INFO ] Decomposing Gal with order
[2023-03-10 23:42:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 23:42:31] [INFO ] Removed a total of 2169 redundant transitions.
[2023-03-10 23:42:31] [INFO ] Flatten gal took : 138 ms
[2023-03-10 23:42:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 22 ms.
[2023-03-10 23:42:31] [INFO ] Time to serialize gal into /tmp/UpperBounds15997489883793268349.gal : 12 ms
[2023-03-10 23:42:31] [INFO ] Time to serialize properties into /tmp/UpperBounds1776856224863746887.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/UpperBounds15997489883793268349.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1776856224863746887.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 ...284
Loading property file /tmp/UpperBounds1776856224863746887.prop.
Detected timeout of ITS tools.
[2023-03-11 00:04:05] [INFO ] Applying decomposition
[2023-03-11 00:04:05] [INFO ] Flatten gal took : 223 ms
[2023-03-11 00:04:05] [INFO ] Decomposing Gal with order
[2023-03-11 00:04:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 00:04:06] [INFO ] Removed a total of 1961 redundant transitions.
[2023-03-11 00:04:06] [INFO ] Flatten gal took : 149 ms
[2023-03-11 00:04:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 379 labels/synchronizations in 35 ms.
[2023-03-11 00:04:06] [INFO ] Time to serialize gal into /tmp/UpperBounds4595724166220556341.gal : 24 ms
[2023-03-11 00:04:06] [INFO ] Time to serialize properties into /tmp/UpperBounds6591370138645026343.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/UpperBounds4595724166220556341.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6591370138645026343.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/UpperBounds6591370138645026343.prop.
Detected timeout of ITS tools.
[2023-03-11 00:25:38] [INFO ] Flatten gal took : 71 ms
[2023-03-11 00:25:39] [INFO ] Input system was already deterministic with 1052 transitions.
[2023-03-11 00:25:39] [INFO ] Transformed 422 places.
[2023-03-11 00:25:39] [INFO ] Transformed 1052 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 00:25:39] [INFO ] Time to serialize gal into /tmp/UpperBounds2929831863938741673.gal : 18 ms
[2023-03-11 00:25:39] [INFO ] Time to serialize properties into /tmp/UpperBounds10882069339356176565.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/UpperBounds2929831863938741673.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10882069339356176565.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/UpperBounds10882069339356176565.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 541524 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16177920 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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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-05a"
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-05a, 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-167813592600077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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