fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r011-tall-162038005900075
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for ASLink-PT-09b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4304.352 3600000.00 787489.00 1735.80 FFFTTTFTTTFFTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r011-tall-162038005900075.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is ASLink-PT-09b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-tall-162038005900075
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 142K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 109K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 01:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 01:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 09:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 09:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.3M May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620414771079

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-07 19:12:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-07 19:12:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 19:12:52] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2021-05-07 19:12:52] [INFO ] Transformed 4014 places.
[2021-05-07 19:12:52] [INFO ] Transformed 4932 transitions.
[2021-05-07 19:12:52] [INFO ] Found NUPN structural information;
[2021-05-07 19:12:52] [INFO ] Parsed PT model containing 4014 places and 4932 transitions in 327 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 144 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-09b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 14 resets, run finished after 111 ms. (steps per millisecond=90 ) properties seen :[0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1]
FORMULA ASLink-PT-09b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 4932 rows 4014 cols
[2021-05-07 19:12:53] [INFO ] Computed 394 place invariants in 346 ms
[2021-05-07 19:12:54] [INFO ] [Real]Absence check using 93 positive place invariants in 269 ms returned sat
[2021-05-07 19:12:55] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 777 ms returned sat
[2021-05-07 19:12:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:12:58] [INFO ] [Real]Absence check using state equation in 3396 ms returned (error "Solver has unexpectedly terminated")
[2021-05-07 19:12:59] [INFO ] [Real]Absence check using 93 positive place invariants in 324 ms returned sat
[2021-05-07 19:13:00] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 810 ms returned sat
[2021-05-07 19:13:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:13:03] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 19:13:03] [INFO ] [Real]Absence check using state equation in 3303 ms returned (error "Failed to check-sat")
[2021-05-07 19:13:04] [INFO ] [Real]Absence check using 93 positive place invariants in 266 ms returned sat
[2021-05-07 19:13:05] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 838 ms returned sat
[2021-05-07 19:13:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:13:08] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 19:13:08] [INFO ] [Real]Absence check using state equation in 3390 ms returned (error "Failed to check-sat")
[2021-05-07 19:13:09] [INFO ] [Real]Absence check using 93 positive place invariants in 261 ms returned sat
[2021-05-07 19:13:10] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 732 ms returned sat
[2021-05-07 19:13:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:13:13] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 19:13:13] [INFO ] [Real]Absence check using state equation in 3416 ms returned (error "Failed to check-sat")
[2021-05-07 19:13:14] [INFO ] [Real]Absence check using 93 positive place invariants in 260 ms returned sat
[2021-05-07 19:13:15] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 731 ms returned sat
[2021-05-07 19:13:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:13:18] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 19:13:18] [INFO ] [Real]Absence check using state equation in 3518 ms returned (error "Failed to check-sat")
Support contains 21 out of 4014 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4014/4014 places, 4932/4932 transitions.
Performed 931 Post agglomeration using F-continuation condition.Transition count delta: 931
Iterating post reduction 0 with 931 rules applied. Total rules applied 931 place count 4014 transition count 4001
Reduce places removed 931 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 973 rules applied. Total rules applied 1904 place count 3083 transition count 3959
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1915 place count 3072 transition count 3959
Performed 926 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 926 Pre rules applied. Total rules applied 1915 place count 3072 transition count 3033
Deduced a syphon composed of 926 places in 8 ms
Ensure Unique test removed 90 places
Reduce places removed 1016 places and 0 transitions.
Iterating global reduction 3 with 1942 rules applied. Total rules applied 3857 place count 2056 transition count 3033
Discarding 11 places :
Implicit places reduction removed 11 places
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Iterating post reduction 3 with 67 rules applied. Total rules applied 3924 place count 2045 transition count 2977
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 3980 place count 1989 transition count 2977
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 35 Pre rules applied. Total rules applied 3980 place count 1989 transition count 2942
Deduced a syphon composed of 35 places in 8 ms
Ensure Unique test removed 35 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 105 rules applied. Total rules applied 4085 place count 1919 transition count 2942
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 35 Pre rules applied. Total rules applied 4085 place count 1919 transition count 2907
Deduced a syphon composed of 35 places in 24 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 4155 place count 1884 transition count 2907
Symmetric choice reduction at 5 with 127 rule applications. Total rules 4282 place count 1884 transition count 2907
Deduced a syphon composed of 127 places in 7 ms
Reduce places removed 127 places and 127 transitions.
Iterating global reduction 5 with 254 rules applied. Total rules applied 4536 place count 1757 transition count 2780
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4537 place count 1757 transition count 2779
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 40 Pre rules applied. Total rules applied 4537 place count 1757 transition count 2739
Deduced a syphon composed of 40 places in 10 ms
Ensure Unique test removed 1 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 81 rules applied. Total rules applied 4618 place count 1716 transition count 2739
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 4618 place count 1716 transition count 2738
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4620 place count 1715 transition count 2738
Symmetric choice reduction at 6 with 10 rule applications. Total rules 4630 place count 1715 transition count 2738
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 63 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 4650 place count 1705 transition count 2675
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 4650 place count 1705 transition count 2666
Deduced a syphon composed of 9 places in 6 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 4668 place count 1696 transition count 2666
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4669 place count 1696 transition count 2666
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4671 place count 1695 transition count 2658
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4672 place count 1695 transition count 2658
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4674 place count 1694 transition count 2650
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4675 place count 1694 transition count 2650
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4677 place count 1693 transition count 2642
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4678 place count 1693 transition count 2642
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4680 place count 1692 transition count 2634
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4681 place count 1692 transition count 2634
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4683 place count 1691 transition count 2626
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4684 place count 1691 transition count 2626
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4686 place count 1690 transition count 2618
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4687 place count 1690 transition count 2618
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4689 place count 1689 transition count 2610
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4690 place count 1689 transition count 2610
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4692 place count 1688 transition count 2602
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4693 place count 1688 transition count 2602
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4695 place count 1687 transition count 2594
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4696 place count 1687 transition count 2594
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4698 place count 1686 transition count 2586
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4699 place count 1686 transition count 2586
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4701 place count 1685 transition count 2578
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4702 place count 1685 transition count 2578
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4704 place count 1684 transition count 2570
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4705 place count 1684 transition count 2570
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4707 place count 1683 transition count 2562
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4708 place count 1683 transition count 2562
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4710 place count 1682 transition count 2554
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4711 place count 1682 transition count 2554
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4713 place count 1681 transition count 2546
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4714 place count 1681 transition count 2546
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4716 place count 1680 transition count 2538
Performed 232 Post agglomeration using F-continuation condition.Transition count delta: 232
Deduced a syphon composed of 232 places in 4 ms
Reduce places removed 232 places and 0 transitions.
Iterating global reduction 6 with 464 rules applied. Total rules applied 5180 place count 1448 transition count 2306
Symmetric choice reduction at 6 with 1 rule applications. Total rules 5181 place count 1448 transition count 2306
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 5183 place count 1447 transition count 2305
Ensure Unique test removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 5184 place count 1446 transition count 2305
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5185 place count 1446 transition count 2305
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 5187 place count 1445 transition count 2304
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 5189 place count 1445 transition count 2302
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 5190 place count 1444 transition count 2302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 5192 place count 1443 transition count 2311
Free-agglomeration rule applied 10 times.
Iterating global reduction 9 with 10 rules applied. Total rules applied 5202 place count 1443 transition count 2301
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 5212 place count 1433 transition count 2301
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 10 with 10 rules applied. Total rules applied 5222 place count 1433 transition count 2291
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 5232 place count 1423 transition count 2291
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 5233 place count 1422 transition count 2290
Reduce places removed 16 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 11 with 23 rules applied. Total rules applied 5256 place count 1406 transition count 2283
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 5263 place count 1399 transition count 2283
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 24 Pre rules applied. Total rules applied 5263 place count 1399 transition count 2259
Deduced a syphon composed of 24 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 13 with 49 rules applied. Total rules applied 5312 place count 1374 transition count 2259
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 13 with 9 rules applied. Total rules applied 5321 place count 1365 transition count 2259
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 5321 place count 1365 transition count 2258
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 5323 place count 1364 transition count 2258
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 4 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 14 with 36 rules applied. Total rules applied 5359 place count 1346 transition count 2240
Symmetric choice reduction at 14 with 8 rule applications. Total rules 5367 place count 1346 transition count 2240
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 14 with 16 rules applied. Total rules applied 5383 place count 1338 transition count 2232
Free-agglomeration rule applied 8 times.
Iterating global reduction 14 with 8 rules applied. Total rules applied 5391 place count 1338 transition count 2224
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 5399 place count 1330 transition count 2224
Applied a total of 5399 rules in 2839 ms. Remains 1330 /4014 variables (removed 2684) and now considering 2224/4932 (removed 2708) transitions.
Finished structural reductions, in 1 iterations. Remains : 1330/4014 places, 2224/4932 transitions.
Incomplete random walk after 1000000 steps, including 8656 resets, run finished after 5347 ms. (steps per millisecond=187 ) properties seen :[0, 0, 0, 1, 0]
FORMULA ASLink-PT-09b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 935 resets, run finished after 1923 ms. (steps per millisecond=520 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 892 resets, run finished after 2026 ms. (steps per millisecond=493 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 1073 resets, run finished after 1943 ms. (steps per millisecond=514 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 919 resets, run finished after 1838 ms. (steps per millisecond=544 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 2224 rows 1330 cols
[2021-05-07 19:13:34] [INFO ] Computed 230 place invariants in 53 ms
[2021-05-07 19:13:34] [INFO ] [Real]Absence check using 56 positive place invariants in 72 ms returned sat
[2021-05-07 19:13:35] [INFO ] [Real]Absence check using 56 positive and 174 generalized place invariants in 147 ms returned sat
[2021-05-07 19:13:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:13:41] [INFO ] [Real]Absence check using state equation in 6318 ms returned sat
[2021-05-07 19:13:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:13:41] [INFO ] [Nat]Absence check using 56 positive place invariants in 67 ms returned sat
[2021-05-07 19:13:41] [INFO ] [Nat]Absence check using 56 positive and 174 generalized place invariants in 139 ms returned sat
[2021-05-07 19:13:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:13:47] [INFO ] [Nat]Absence check using state equation in 5901 ms returned sat
[2021-05-07 19:13:48] [INFO ] Computed and/alt/rep : 2179/23144/2179 causal constraints in 148 ms.
[2021-05-07 19:13:56] [INFO ] Added : 90 causal constraints over 18 iterations in 8925 ms. Result :unknown
[2021-05-07 19:13:57] [INFO ] [Real]Absence check using 56 positive place invariants in 67 ms returned sat
[2021-05-07 19:13:57] [INFO ] [Real]Absence check using 56 positive and 174 generalized place invariants in 148 ms returned sat
[2021-05-07 19:13:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:14:03] [INFO ] [Real]Absence check using state equation in 6446 ms returned sat
[2021-05-07 19:14:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:14:03] [INFO ] [Nat]Absence check using 56 positive place invariants in 61 ms returned sat
[2021-05-07 19:14:04] [INFO ] [Nat]Absence check using 56 positive and 174 generalized place invariants in 148 ms returned sat
[2021-05-07 19:14:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:14:09] [INFO ] [Nat]Absence check using state equation in 5872 ms returned sat
[2021-05-07 19:14:10] [INFO ] Deduced a trap composed of 20 places in 193 ms
[2021-05-07 19:14:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 298 ms
[2021-05-07 19:14:10] [INFO ] Computed and/alt/rep : 2179/23144/2179 causal constraints in 154 ms.
[2021-05-07 19:14:30] [INFO ] Added : 475 causal constraints over 95 iterations in 20292 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 104 ms.
[2021-05-07 19:14:31] [INFO ] [Real]Absence check using 56 positive place invariants in 117 ms returned sat
[2021-05-07 19:14:31] [INFO ] [Real]Absence check using 56 positive and 174 generalized place invariants in 148 ms returned sat
[2021-05-07 19:14:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:14:37] [INFO ] [Real]Absence check using state equation in 6021 ms returned sat
[2021-05-07 19:14:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:14:37] [INFO ] [Nat]Absence check using 56 positive place invariants in 64 ms returned sat
[2021-05-07 19:14:37] [INFO ] [Nat]Absence check using 56 positive and 174 generalized place invariants in 148 ms returned sat
[2021-05-07 19:14:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:14:44] [INFO ] [Nat]Absence check using state equation in 6439 ms returned sat
[2021-05-07 19:14:44] [INFO ] Deduced a trap composed of 87 places in 258 ms
[2021-05-07 19:14:44] [INFO ] Deduced a trap composed of 84 places in 174 ms
[2021-05-07 19:14:44] [INFO ] Deduced a trap composed of 44 places in 68 ms
[2021-05-07 19:14:45] [INFO ] Deduced a trap composed of 44 places in 123 ms
[2021-05-07 19:14:45] [INFO ] Deduced a trap composed of 55 places in 120 ms
[2021-05-07 19:14:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1132 ms
[2021-05-07 19:14:45] [INFO ] Computed and/alt/rep : 2179/23144/2179 causal constraints in 137 ms.
[2021-05-07 19:15:05] [INFO ] Added : 490 causal constraints over 98 iterations in 20117 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 108 ms.
[2021-05-07 19:15:05] [INFO ] [Real]Absence check using 56 positive place invariants in 64 ms returned sat
[2021-05-07 19:15:06] [INFO ] [Real]Absence check using 56 positive and 174 generalized place invariants in 141 ms returned sat
[2021-05-07 19:15:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:15:12] [INFO ] [Real]Absence check using state equation in 5886 ms returned sat
[2021-05-07 19:15:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:15:12] [INFO ] [Nat]Absence check using 56 positive place invariants in 62 ms returned sat
[2021-05-07 19:15:12] [INFO ] [Nat]Absence check using 56 positive and 174 generalized place invariants in 138 ms returned sat
[2021-05-07 19:15:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:15:18] [INFO ] [Nat]Absence check using state equation in 6022 ms returned sat
[2021-05-07 19:15:18] [INFO ] Computed and/alt/rep : 2179/23144/2179 causal constraints in 116 ms.
[2021-05-07 19:15:39] [INFO ] Added : 510 causal constraints over 102 iterations in 21228 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 110 ms.
Incomplete Parikh walk after 775500 steps, including 8094 resets, run finished after 4653 ms. (steps per millisecond=166 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 575100 steps, including 6138 resets, run finished after 3444 ms. (steps per millisecond=166 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1538000 steps, including 15486 resets, run finished after 9070 ms. (steps per millisecond=169 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 351300 steps, including 4075 resets, run finished after 2069 ms. (steps per millisecond=169 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 15 out of 1330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1330/1330 places, 2224/2224 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1330 transition count 2222
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 1327 transition count 2222
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 5 place count 1327 transition count 2218
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 13 place count 1323 transition count 2218
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 19 place count 1320 transition count 2215
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 1320 transition count 2214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 1319 transition count 2214
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 1318 transition count 2213
Applied a total of 22 rules in 250 ms. Remains 1318 /1330 variables (removed 12) and now considering 2213/2224 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 1318/1330 places, 2213/2224 transitions.
Incomplete random walk after 1000000 steps, including 8988 resets, run finished after 5229 ms. (steps per millisecond=191 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1002 resets, run finished after 1900 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 978 resets, run finished after 2017 ms. (steps per millisecond=495 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1177 resets, run finished after 1951 ms. (steps per millisecond=512 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1011 resets, run finished after 1826 ms. (steps per millisecond=547 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 2437255 steps, run timeout after 30001 ms. (steps per millisecond=81 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 2437255 steps, saw 415794 distinct states, run finished after 30001 ms. (steps per millisecond=81 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 2213 rows 1318 cols
[2021-05-07 19:16:42] [INFO ] Computed 229 place invariants in 131 ms
[2021-05-07 19:16:42] [INFO ] [Real]Absence check using 56 positive place invariants in 64 ms returned sat
[2021-05-07 19:16:42] [INFO ] [Real]Absence check using 56 positive and 173 generalized place invariants in 139 ms returned sat
[2021-05-07 19:16:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:16:48] [INFO ] [Real]Absence check using state equation in 5835 ms returned sat
[2021-05-07 19:16:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:16:48] [INFO ] [Nat]Absence check using 56 positive place invariants in 60 ms returned sat
[2021-05-07 19:16:49] [INFO ] [Nat]Absence check using 56 positive and 173 generalized place invariants in 140 ms returned sat
[2021-05-07 19:16:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:16:56] [INFO ] [Nat]Absence check using state equation in 7794 ms returned sat
[2021-05-07 19:16:57] [INFO ] Computed and/alt/rep : 2170/23050/2170 causal constraints in 113 ms.
[2021-05-07 19:17:17] [INFO ] Added : 535 causal constraints over 107 iterations in 20360 ms.(timeout) Result :sat
[2021-05-07 19:17:17] [INFO ] Deduced a trap composed of 94 places in 148 ms
[2021-05-07 19:17:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 407 ms
Attempting to minimize the solution found.
Minimization took 105 ms.
[2021-05-07 19:17:18] [INFO ] [Real]Absence check using 56 positive place invariants in 63 ms returned sat
[2021-05-07 19:17:18] [INFO ] [Real]Absence check using 56 positive and 173 generalized place invariants in 159 ms returned sat
[2021-05-07 19:17:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:17:24] [INFO ] [Real]Absence check using state equation in 5730 ms returned sat
[2021-05-07 19:17:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:17:24] [INFO ] [Nat]Absence check using 56 positive place invariants in 59 ms returned sat
[2021-05-07 19:17:24] [INFO ] [Nat]Absence check using 56 positive and 173 generalized place invariants in 150 ms returned sat
[2021-05-07 19:17:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:17:30] [INFO ] [Nat]Absence check using state equation in 6293 ms returned sat
[2021-05-07 19:17:30] [INFO ] Computed and/alt/rep : 2170/23050/2170 causal constraints in 111 ms.
[2021-05-07 19:17:41] [INFO ] Added : 300 causal constraints over 60 iterations in 10860 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 67 ms.
[2021-05-07 19:17:42] [INFO ] [Real]Absence check using 56 positive place invariants in 66 ms returned sat
[2021-05-07 19:17:42] [INFO ] [Real]Absence check using 56 positive and 173 generalized place invariants in 146 ms returned sat
[2021-05-07 19:17:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:17:47] [INFO ] [Real]Absence check using state equation in 5055 ms returned sat
[2021-05-07 19:17:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:17:47] [INFO ] [Nat]Absence check using 56 positive place invariants in 62 ms returned sat
[2021-05-07 19:17:47] [INFO ] [Nat]Absence check using 56 positive and 173 generalized place invariants in 146 ms returned sat
[2021-05-07 19:17:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:17:52] [INFO ] [Nat]Absence check using state equation in 5293 ms returned sat
[2021-05-07 19:17:53] [INFO ] Computed and/alt/rep : 2170/23050/2170 causal constraints in 116 ms.
[2021-05-07 19:18:13] [INFO ] Added : 520 causal constraints over 104 iterations in 20173 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 105 ms.
[2021-05-07 19:18:13] [INFO ] [Real]Absence check using 56 positive place invariants in 67 ms returned sat
[2021-05-07 19:18:13] [INFO ] [Real]Absence check using 56 positive and 173 generalized place invariants in 141 ms returned sat
[2021-05-07 19:18:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:18:19] [INFO ] [Real]Absence check using state equation in 5492 ms returned sat
[2021-05-07 19:18:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:18:19] [INFO ] [Nat]Absence check using 56 positive place invariants in 60 ms returned sat
[2021-05-07 19:18:19] [INFO ] [Nat]Absence check using 56 positive and 173 generalized place invariants in 137 ms returned sat
[2021-05-07 19:18:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:18:25] [INFO ] [Nat]Absence check using state equation in 5765 ms returned sat
[2021-05-07 19:18:25] [INFO ] Computed and/alt/rep : 2170/23050/2170 causal constraints in 112 ms.
[2021-05-07 19:18:45] [INFO ] Added : 430 causal constraints over 86 iterations in 20399 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 96 ms.
Incomplete Parikh walk after 480200 steps, including 5733 resets, run finished after 2852 ms. (steps per millisecond=168 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 540700 steps, including 6276 resets, run finished after 3196 ms. (steps per millisecond=169 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 717200 steps, including 8171 resets, run finished after 4223 ms. (steps per millisecond=169 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 650500 steps, including 7425 resets, run finished after 3847 ms. (steps per millisecond=169 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 15 out of 1318 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1318/1318 places, 2213/2213 transitions.
Applied a total of 0 rules in 37 ms. Remains 1318 /1318 variables (removed 0) and now considering 2213/2213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1318/1318 places, 2213/2213 transitions.
Starting structural reductions, iteration 0 : 1318/1318 places, 2213/2213 transitions.
Applied a total of 0 rules in 36 ms. Remains 1318 /1318 variables (removed 0) and now considering 2213/2213 (removed 0) transitions.
// Phase 1: matrix 2213 rows 1318 cols
[2021-05-07 19:19:00] [INFO ] Computed 229 place invariants in 41 ms
[2021-05-07 19:19:05] [INFO ] Implicit Places using invariants in 4830 ms returned [1, 18, 19, 31, 48, 67, 138, 142, 151, 152, 153, 171, 189, 258, 262, 263, 274, 275, 277, 294, 312, 383, 387, 388, 399, 400, 402, 422, 440, 510, 514, 515, 526, 527, 529, 565, 634, 638, 639, 650, 651, 653, 670, 688, 757, 761, 762, 773, 774, 776, 793, 811, 880, 884, 885, 896, 897, 899, 916, 934, 1010, 1014, 1015, 1026, 1028, 1029, 1031, 1048, 1066, 1127, 1130, 1140, 1144, 1145, 1148, 1159, 1160, 1161, 1179, 1181, 1185, 1203, 1204, 1205, 1206, 1218, 1225, 1231, 1237, 1243, 1249, 1255, 1261, 1267, 1273, 1279, 1315]
Discarding 97 places :
Implicit Place search using SMT only with invariants took 4834 ms to find 97 implicit places.
[2021-05-07 19:19:05] [INFO ] Redundant transitions in 155 ms returned []
// Phase 1: matrix 2213 rows 1221 cols
[2021-05-07 19:19:05] [INFO ] Computed 132 place invariants in 28 ms
[2021-05-07 19:19:12] [INFO ] Dead Transitions using invariants and state equation in 7365 ms returned []
Starting structural reductions, iteration 1 : 1221/1318 places, 2213/2213 transitions.
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Iterating post reduction 0 with 172 rules applied. Total rules applied 172 place count 1221 transition count 2041
Reduce places removed 172 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 180 rules applied. Total rules applied 352 place count 1049 transition count 2033
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 352 place count 1049 transition count 1989
Deduced a syphon composed of 44 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 89 rules applied. Total rules applied 441 place count 1004 transition count 1989
Discarding 5 places :
Implicit places reduction removed 5 places
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 13 rules applied. Total rules applied 454 place count 999 transition count 1981
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 462 place count 991 transition count 1981
Symmetric choice reduction at 4 with 14 rule applications. Total rules 476 place count 991 transition count 1981
Deduced a syphon composed of 14 places in 4 ms
Reduce places removed 14 places and 14 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 504 place count 977 transition count 1967
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 507 place count 977 transition count 1964
Symmetric choice reduction at 5 with 3 rule applications. Total rules 510 place count 977 transition count 1964
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 6 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 516 place count 974 transition count 1958
Symmetric choice reduction at 5 with 1 rule applications. Total rules 517 place count 974 transition count 1958
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 519 place count 973 transition count 1957
Symmetric choice reduction at 5 with 1 rule applications. Total rules 520 place count 973 transition count 1957
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 522 place count 972 transition count 1955
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 3 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 5 with 124 rules applied. Total rules applied 646 place count 910 transition count 1893
Symmetric choice reduction at 5 with 9 rule applications. Total rules 655 place count 910 transition count 1893
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 673 place count 901 transition count 1884
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 682 place count 901 transition count 1875
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 686 place count 899 transition count 1876
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 687 place count 899 transition count 1875
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 688 place count 898 transition count 1875
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 7 with 20 rules applied. Total rules applied 708 place count 898 transition count 1855
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 729 place count 877 transition count 1855
Partial Free-agglomeration rule applied 23 times.
Drop transitions removed 23 transitions
Iterating global reduction 8 with 23 rules applied. Total rules applied 752 place count 877 transition count 1855
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 753 place count 877 transition count 1854
Applied a total of 753 rules in 480 ms. Remains 877 /1221 variables (removed 344) and now considering 1854/2213 (removed 359) transitions.
// Phase 1: matrix 1854 rows 877 cols
[2021-05-07 19:19:13] [INFO ] Computed 125 place invariants in 23 ms
[2021-05-07 19:19:15] [INFO ] Implicit Places using invariants in 2137 ms returned [74, 92, 98, 101, 103, 106, 107, 159, 176, 182, 185, 187, 192, 193, 247, 264, 270, 273, 275, 280, 281, 336, 354, 360, 363, 365, 370, 371, 425, 446, 454, 460, 465, 466, 518, 535, 541, 544, 546, 551, 552, 604, 621, 627, 630, 632, 637, 638, 691, 708, 714, 717, 719, 724, 725, 778, 795, 807, 809]
Discarding 59 places :
Implicit Place search using SMT only with invariants took 2144 ms to find 59 implicit places.
Starting structural reductions, iteration 2 : 818/1318 places, 1854/2213 transitions.
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 818 transition count 1854
Deduced a syphon composed of 24 places in 3 ms
Reduce places removed 24 places and 24 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 72 place count 794 transition count 1830
Symmetric choice reduction at 0 with 9 rule applications. Total rules 81 place count 794 transition count 1830
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 99 place count 785 transition count 1821
Symmetric choice reduction at 0 with 2 rule applications. Total rules 101 place count 785 transition count 1821
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 105 place count 783 transition count 1819
Symmetric choice reduction at 0 with 1 rule applications. Total rules 106 place count 783 transition count 1819
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 108 place count 782 transition count 1818
Symmetric choice reduction at 0 with 1 rule applications. Total rules 109 place count 782 transition count 1818
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 111 place count 781 transition count 1817
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 147 place count 763 transition count 1799
Free-agglomeration rule applied 25 times.
Iterating global reduction 0 with 25 rules applied. Total rules applied 172 place count 763 transition count 1774
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 197 place count 738 transition count 1774
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 206 place count 738 transition count 1765
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 215 place count 729 transition count 1765
Partial Post-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 223 place count 729 transition count 1765
Applied a total of 223 rules in 183 ms. Remains 729 /818 variables (removed 89) and now considering 1765/1854 (removed 89) transitions.
// Phase 1: matrix 1765 rows 729 cols
[2021-05-07 19:19:15] [INFO ] Computed 66 place invariants in 19 ms
[2021-05-07 19:19:17] [INFO ] Implicit Places using invariants in 1659 ms returned []
// Phase 1: matrix 1765 rows 729 cols
[2021-05-07 19:19:17] [INFO ] Computed 66 place invariants in 19 ms
[2021-05-07 19:19:29] [INFO ] Implicit Places using invariants and state equation in 11960 ms returned []
Implicit Place search using SMT with State Equation took 13620 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 729/1318 places, 1765/2213 transitions.
Incomplete random walk after 1000000 steps, including 15272 resets, run finished after 4027 ms. (steps per millisecond=248 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2173 resets, run finished after 1111 ms. (steps per millisecond=900 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 1864 resets, run finished after 1168 ms. (steps per millisecond=856 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2522 resets, run finished after 1126 ms. (steps per millisecond=888 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2180 resets, run finished after 1045 ms. (steps per millisecond=956 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 3161743 steps, run timeout after 30001 ms. (steps per millisecond=105 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 3161743 steps, saw 702494 distinct states, run finished after 30001 ms. (steps per millisecond=105 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 1765 rows 729 cols
[2021-05-07 19:20:07] [INFO ] Computed 66 place invariants in 26 ms
[2021-05-07 19:20:07] [INFO ] [Real]Absence check using 16 positive place invariants in 25 ms returned sat
[2021-05-07 19:20:07] [INFO ] [Real]Absence check using 16 positive and 50 generalized place invariants in 28 ms returned sat
[2021-05-07 19:20:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:20:10] [INFO ] [Real]Absence check using state equation in 2224 ms returned sat
[2021-05-07 19:20:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:20:10] [INFO ] [Nat]Absence check using 16 positive place invariants in 25 ms returned sat
[2021-05-07 19:20:10] [INFO ] [Nat]Absence check using 16 positive and 50 generalized place invariants in 27 ms returned sat
[2021-05-07 19:20:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:20:12] [INFO ] [Nat]Absence check using state equation in 1998 ms returned sat
[2021-05-07 19:20:12] [INFO ] Deduced a trap composed of 62 places in 89 ms
[2021-05-07 19:20:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2021-05-07 19:20:12] [INFO ] Computed and/alt/rep : 1720/22010/1720 causal constraints in 92 ms.
[2021-05-07 19:20:18] [INFO ] Added : 130 causal constraints over 26 iterations in 6005 ms. Result :sat
[2021-05-07 19:20:18] [INFO ] Deduced a trap composed of 14 places in 59 ms
[2021-05-07 19:20:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
Attempting to minimize the solution found.
Minimization took 30 ms.
[2021-05-07 19:20:18] [INFO ] [Real]Absence check using 16 positive place invariants in 24 ms returned sat
[2021-05-07 19:20:18] [INFO ] [Real]Absence check using 16 positive and 50 generalized place invariants in 35 ms returned sat
[2021-05-07 19:20:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:20:20] [INFO ] [Real]Absence check using state equation in 2102 ms returned sat
[2021-05-07 19:20:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:20:21] [INFO ] [Nat]Absence check using 16 positive place invariants in 24 ms returned sat
[2021-05-07 19:20:21] [INFO ] [Nat]Absence check using 16 positive and 50 generalized place invariants in 33 ms returned sat
[2021-05-07 19:20:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:20:23] [INFO ] [Nat]Absence check using state equation in 2611 ms returned sat
[2021-05-07 19:20:23] [INFO ] Computed and/alt/rep : 1720/22010/1720 causal constraints in 95 ms.
[2021-05-07 19:20:43] [INFO ] Added : 460 causal constraints over 92 iterations in 20109 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 99 ms.
[2021-05-07 19:20:44] [INFO ] [Real]Absence check using 16 positive place invariants in 25 ms returned sat
[2021-05-07 19:20:44] [INFO ] [Real]Absence check using 16 positive and 50 generalized place invariants in 33 ms returned sat
[2021-05-07 19:20:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:20:46] [INFO ] [Real]Absence check using state equation in 2179 ms returned sat
[2021-05-07 19:20:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:20:46] [INFO ] [Nat]Absence check using 16 positive place invariants in 26 ms returned sat
[2021-05-07 19:20:46] [INFO ] [Nat]Absence check using 16 positive and 50 generalized place invariants in 33 ms returned sat
[2021-05-07 19:20:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:20:48] [INFO ] [Nat]Absence check using state equation in 2056 ms returned sat
[2021-05-07 19:20:48] [INFO ] Computed and/alt/rep : 1720/22010/1720 causal constraints in 96 ms.
[2021-05-07 19:21:06] [INFO ] Added : 390 causal constraints over 78 iterations in 17868 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 99 ms.
[2021-05-07 19:21:06] [INFO ] [Real]Absence check using 16 positive place invariants in 25 ms returned sat
[2021-05-07 19:21:06] [INFO ] [Real]Absence check using 16 positive and 50 generalized place invariants in 28 ms returned sat
[2021-05-07 19:21:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:21:08] [INFO ] [Real]Absence check using state equation in 2203 ms returned sat
[2021-05-07 19:21:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:21:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 25 ms returned sat
[2021-05-07 19:21:09] [INFO ] [Nat]Absence check using 16 positive and 50 generalized place invariants in 27 ms returned sat
[2021-05-07 19:21:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:21:12] [INFO ] [Nat]Absence check using state equation in 2902 ms returned sat
[2021-05-07 19:21:12] [INFO ] Computed and/alt/rep : 1720/22010/1720 causal constraints in 88 ms.
[2021-05-07 19:21:23] [INFO ] Added : 235 causal constraints over 47 iterations in 11477 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 56 ms.
Incomplete Parikh walk after 612600 steps, including 13839 resets, run finished after 3058 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 196800 steps, including 4917 resets, run finished after 976 ms. (steps per millisecond=201 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 332900 steps, including 7844 resets, run finished after 1619 ms. (steps per millisecond=205 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 299900 steps, including 7055 resets, run finished after 1417 ms. (steps per millisecond=211 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 15 out of 729 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 729/729 places, 1765/1765 transitions.
Applied a total of 0 rules in 20 ms. Remains 729 /729 variables (removed 0) and now considering 1765/1765 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 729/729 places, 1765/1765 transitions.
Starting structural reductions, iteration 0 : 729/729 places, 1765/1765 transitions.
Applied a total of 0 rules in 20 ms. Remains 729 /729 variables (removed 0) and now considering 1765/1765 (removed 0) transitions.
// Phase 1: matrix 1765 rows 729 cols
[2021-05-07 19:21:30] [INFO ] Computed 66 place invariants in 19 ms
[2021-05-07 19:21:32] [INFO ] Implicit Places using invariants in 1589 ms returned []
// Phase 1: matrix 1765 rows 729 cols
[2021-05-07 19:21:32] [INFO ] Computed 66 place invariants in 18 ms
[2021-05-07 19:21:43] [INFO ] Implicit Places using invariants and state equation in 10987 ms returned []
Implicit Place search using SMT with State Equation took 12576 ms to find 0 implicit places.
[2021-05-07 19:21:43] [INFO ] Redundant transitions in 74 ms returned []
// Phase 1: matrix 1765 rows 729 cols
[2021-05-07 19:21:43] [INFO ] Computed 66 place invariants in 18 ms
[2021-05-07 19:21:46] [INFO ] Dead Transitions using invariants and state equation in 3453 ms returned []
Finished structural reductions, in 1 iterations. Remains : 729/729 places, 1765/1765 transitions.
Incomplete random walk after 100000 steps, including 1552 resets, run finished after 408 ms. (steps per millisecond=245 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 1765 rows 729 cols
[2021-05-07 19:21:47] [INFO ] Computed 66 place invariants in 19 ms
[2021-05-07 19:21:47] [INFO ] [Real]Absence check using 16 positive place invariants in 25 ms returned sat
[2021-05-07 19:21:47] [INFO ] [Real]Absence check using 16 positive and 50 generalized place invariants in 28 ms returned sat
[2021-05-07 19:21:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:21:49] [INFO ] [Real]Absence check using state equation in 2212 ms returned sat
[2021-05-07 19:21:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:21:49] [INFO ] [Nat]Absence check using 16 positive place invariants in 25 ms returned sat
[2021-05-07 19:21:49] [INFO ] [Nat]Absence check using 16 positive and 50 generalized place invariants in 27 ms returned sat
[2021-05-07 19:21:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:21:51] [INFO ] [Nat]Absence check using state equation in 1986 ms returned sat
[2021-05-07 19:21:52] [INFO ] Deduced a trap composed of 62 places in 78 ms
[2021-05-07 19:21:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2021-05-07 19:21:52] [INFO ] Computed and/alt/rep : 1720/22010/1720 causal constraints in 88 ms.
[2021-05-07 19:21:58] [INFO ] Added : 130 causal constraints over 26 iterations in 6022 ms. Result :sat
[2021-05-07 19:21:58] [INFO ] Deduced a trap composed of 14 places in 57 ms
[2021-05-07 19:21:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2021-05-07 19:21:58] [INFO ] [Real]Absence check using 16 positive place invariants in 25 ms returned sat
[2021-05-07 19:21:58] [INFO ] [Real]Absence check using 16 positive and 50 generalized place invariants in 35 ms returned sat
[2021-05-07 19:21:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:22:00] [INFO ] [Real]Absence check using state equation in 2118 ms returned sat
[2021-05-07 19:22:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:22:00] [INFO ] [Nat]Absence check using 16 positive place invariants in 24 ms returned sat
[2021-05-07 19:22:00] [INFO ] [Nat]Absence check using 16 positive and 50 generalized place invariants in 34 ms returned sat
[2021-05-07 19:22:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:22:03] [INFO ] [Nat]Absence check using state equation in 2600 ms returned sat
[2021-05-07 19:22:03] [INFO ] Computed and/alt/rep : 1720/22010/1720 causal constraints in 89 ms.
[2021-05-07 19:22:20] [INFO ] Added : 425 causal constraints over 85 iterations in 17231 ms. Result :unknown
[2021-05-07 19:22:20] [INFO ] [Real]Absence check using 16 positive place invariants in 26 ms returned sat
[2021-05-07 19:22:20] [INFO ] [Real]Absence check using 16 positive and 50 generalized place invariants in 33 ms returned sat
[2021-05-07 19:22:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:22:22] [INFO ] [Real]Absence check using state equation in 2188 ms returned sat
[2021-05-07 19:22:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:22:23] [INFO ] [Nat]Absence check using 16 positive place invariants in 26 ms returned sat
[2021-05-07 19:22:23] [INFO ] [Nat]Absence check using 16 positive and 50 generalized place invariants in 32 ms returned sat
[2021-05-07 19:22:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:22:25] [INFO ] [Nat]Absence check using state equation in 2046 ms returned sat
[2021-05-07 19:22:25] [INFO ] Computed and/alt/rep : 1720/22010/1720 causal constraints in 87 ms.
[2021-05-07 19:22:42] [INFO ] Added : 390 causal constraints over 78 iterations in 16894 ms. Result :sat
[2021-05-07 19:22:42] [INFO ] [Real]Absence check using 16 positive place invariants in 25 ms returned sat
[2021-05-07 19:22:42] [INFO ] [Real]Absence check using 16 positive and 50 generalized place invariants in 27 ms returned sat
[2021-05-07 19:22:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:22:44] [INFO ] [Real]Absence check using state equation in 2195 ms returned sat
[2021-05-07 19:22:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:22:44] [INFO ] [Nat]Absence check using 16 positive place invariants in 26 ms returned sat
[2021-05-07 19:22:44] [INFO ] [Nat]Absence check using 16 positive and 50 generalized place invariants in 27 ms returned sat
[2021-05-07 19:22:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:22:47] [INFO ] [Nat]Absence check using state equation in 2879 ms returned sat
[2021-05-07 19:22:47] [INFO ] Computed and/alt/rep : 1720/22010/1720 causal constraints in 90 ms.
[2021-05-07 19:22:59] [INFO ] Added : 235 causal constraints over 47 iterations in 11617 ms. Result :sat
Applied a total of 0 rules in 20 ms. Remains 729 /729 variables (removed 0) and now considering 1765/1765 (removed 0) transitions.
// Phase 1: matrix 1765 rows 729 cols
[2021-05-07 19:22:59] [INFO ] Computed 66 place invariants in 19 ms
[2021-05-07 19:22:59] [INFO ] [Real]Absence check using 16 positive place invariants in 25 ms returned sat
[2021-05-07 19:22:59] [INFO ] [Real]Absence check using 16 positive and 50 generalized place invariants in 29 ms returned sat
[2021-05-07 19:22:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:23:01] [INFO ] [Real]Absence check using state equation in 2341 ms returned sat
[2021-05-07 19:23:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:23:01] [INFO ] [Nat]Absence check using 16 positive place invariants in 26 ms returned sat
[2021-05-07 19:23:01] [INFO ] [Nat]Absence check using 16 positive and 50 generalized place invariants in 28 ms returned sat
[2021-05-07 19:23:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:23:03] [INFO ] [Nat]Absence check using state equation in 2050 ms returned sat
[2021-05-07 19:23:04] [INFO ] Computed and/alt/rep : 1720/22010/1720 causal constraints in 88 ms.
[2021-05-07 19:23:29] [INFO ] Added : 465 causal constraints over 93 iterations in 25548 ms.(timeout) Result :unknown
[2021-05-07 19:23:29] [INFO ] [Real]Absence check using 16 positive place invariants in 24 ms returned sat
[2021-05-07 19:23:29] [INFO ] [Real]Absence check using 16 positive and 50 generalized place invariants in 35 ms returned sat
[2021-05-07 19:23:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:23:31] [INFO ] [Real]Absence check using state equation in 2151 ms returned sat
[2021-05-07 19:23:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:23:31] [INFO ] [Nat]Absence check using 16 positive place invariants in 24 ms returned sat
[2021-05-07 19:23:32] [INFO ] [Nat]Absence check using 16 positive and 50 generalized place invariants in 34 ms returned sat
[2021-05-07 19:23:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:23:34] [INFO ] [Nat]Absence check using state equation in 2651 ms returned sat
[2021-05-07 19:23:34] [INFO ] Computed and/alt/rep : 1720/22010/1720 causal constraints in 85 ms.
[2021-05-07 19:23:54] [INFO ] Added : 445 causal constraints over 89 iterations in 20303 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 101 ms.
[2021-05-07 19:23:55] [INFO ] [Real]Absence check using 16 positive place invariants in 25 ms returned sat
[2021-05-07 19:23:55] [INFO ] [Real]Absence check using 16 positive and 50 generalized place invariants in 33 ms returned sat
[2021-05-07 19:23:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:23:57] [INFO ] [Real]Absence check using state equation in 2233 ms returned sat
[2021-05-07 19:23:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:23:57] [INFO ] [Nat]Absence check using 16 positive place invariants in 26 ms returned sat
[2021-05-07 19:23:57] [INFO ] [Nat]Absence check using 16 positive and 50 generalized place invariants in 33 ms returned sat
[2021-05-07 19:23:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:23:59] [INFO ] [Nat]Absence check using state equation in 2087 ms returned sat
[2021-05-07 19:23:59] [INFO ] Computed and/alt/rep : 1720/22010/1720 causal constraints in 77 ms.
[2021-05-07 19:24:17] [INFO ] Added : 390 causal constraints over 78 iterations in 17760 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 107 ms.
[2021-05-07 19:24:17] [INFO ] [Real]Absence check using 16 positive place invariants in 25 ms returned sat
[2021-05-07 19:24:17] [INFO ] [Real]Absence check using 16 positive and 50 generalized place invariants in 27 ms returned sat
[2021-05-07 19:24:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:24:20] [INFO ] [Real]Absence check using state equation in 2291 ms returned sat
[2021-05-07 19:24:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:24:20] [INFO ] [Nat]Absence check using 16 positive place invariants in 51 ms returned sat
[2021-05-07 19:24:20] [INFO ] [Nat]Absence check using 16 positive and 50 generalized place invariants in 28 ms returned sat
[2021-05-07 19:24:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:24:23] [INFO ] [Nat]Absence check using state equation in 3026 ms returned sat
[2021-05-07 19:24:23] [INFO ] Computed and/alt/rep : 1720/22010/1720 causal constraints in 89 ms.
[2021-05-07 19:24:34] [INFO ] Added : 235 causal constraints over 47 iterations in 11291 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 56 ms.
[2021-05-07 19:24:34] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2021-05-07 19:24:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 12 ms.
[2021-05-07 19:24:35] [INFO ] Flatten gal took : 229 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ ASLink-PT-09b @ 3570 seconds
check_solution: Constraint R1 = 6.90051246639e-310 is above its equality of -1
check_solution: Constraint R19 = 4.90181027827e-312 is above its equality of -1
check_solution: Constraint R52 = 1.48115306226e-311 is above its equality of -1
check_solution: Constraint R70 = 9.84606047237e-312 is above its equality of -1
check_solution: Constraint R72 = 9.84606047237e-312 is above its equality of -1
check_solution: Constraint R123 = 7.78772455465e-312 is above its equality of -1
check_solution: Constraint R143 = 7.91504430214e-312 is above its equality of -1
check_solution: Constraint R195 = 1.27531947066e-311 is above its equality of -1
check_solution: Constraint R216 = 1.2668314875e-311 is above its equality of -1
check_solution: Constraint R233 = 1.08433984944e-311 is above its equality of -1

Seriously low accuracy found ||*|| = 1 (rel. error 1)

FORMULA ASLink-PT-09b-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ASLink-PT-09b-ReachabilityCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ASLink-PT-09b-ReachabilityCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ASLink-PT-09b-ReachabilityCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3530
rslt: Output for ReachabilityCardinality @ ASLink-PT-09b

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 7 19:24:36 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 882
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((p290 <= 1) AND (1 <= p290))))",
"processed_size": 37,
"rewrites": 1
},
"result":
{
"edges": 403,
"markings": 404,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1176
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G ((((p244 <= 0)) OR ((p84 <= 1) AND (1 <= p84)) OR (p716 <= 0))))",
"processed_size": 71,
"rewrites": 2
},
"result":
{
"edges": 148,
"markings": 149,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1765
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p588) AND (1 <= p728) AND (((p323 <= 0)) OR ((1 <= p251))))))",
"processed_size": 75,
"rewrites": 1
},
"result":
{
"edges": 55,
"markings": 56,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3530
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 6,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p206)) AND ((2 <= p211) OR (p211 <= 0)) AND ((((1 <= p562)) AND ((2 <= p660) OR (p660 <= 0))) OR ((1 <= p71) AND (((p41 <= 0)) OR ((1 <= p654))))))))",
"processed_size": 167,
"rewrites": 1
},
"result":
{
"edges": 123,
"markings": 124,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 32,
"problems": 8
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 45304,
"runtime": 40.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(**)) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 7176,
"conflict_clusters": 74,
"places": 729,
"places_significant": 663,
"singleton_clusters": 0,
"transitions": 1765
},
"result":
{
"preliminary_value": "no yes yes yes ",
"value": "no yes yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2494/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 729
lola: finding significant places
lola: 729 places, 1765 transitions, 663 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityCardinality.xml
lola: LP says that atomic proposition is always true: (p716 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p654 <= 1)
lola: LP says that atomic proposition is always true: (p588 <= 1)
lola: LP says that atomic proposition is always true: (p728 <= 1)
lola: LP says that atomic proposition is always true: (p251 <= 1)
lola: A (G ((((p244 <= 0)) OR ((p84 <= 1) AND (1 <= p84)) OR (p716 <= 0)))) : E (F ((((1 <= p206)) AND ((2 <= p211) OR (p211 <= 0)) AND ((((1 <= p562)) AND ((2 <= p660) OR (p660 <= 0))) OR ((1 <= p71) AND (((p41 <= 0)) OR ((1 <= p654)))))))) : E (F (((1 <= p588) AND (1 <= p728) AND (((p323 <= 0)) OR ((1 <= p251)))))) : E (F (((p290 <= 1) AND (1 <= p290))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 882 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p290 <= 1) AND (1 <= p290))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p290 <= 1) AND (1 <= p290))))
lola: processed formula length: 37
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p290 <= 1) AND (1 <= p290))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 404 markings, 403 edges
lola: ========================================
lola: subprocess 1 will run for 1176 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p244 <= 0)) OR ((p84 <= 1) AND (1 <= p84)) OR (p716 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p244 <= 0)) OR ((p84 <= 1) AND (1 <= p84)) OR (p716 <= 0))))
lola: processed formula length: 71
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p244)) AND ((2 <= p84) OR (p84 <= 0)) AND (1 <= p716))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 149 markings, 148 edges
lola: ========================================
lola: subprocess 2 will run for 1765 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p588) AND (1 <= p728) AND (((p323 <= 0)) OR ((1 <= p251))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p588) AND (1 <= p728) AND (((p323 <= 0)) OR ((1 <= p251))))))
lola: processed formula length: 75
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p588) AND (1 <= p728) AND (((p323 <= 0)) OR ((1 <= p251))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 56 markings, 55 edges
lola: ========================================
lola: subprocess 3 will run for 3530 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p206)) AND ((2 <= p211) OR (p211 <= 0)) AND ((((1 <= p562)) AND ((2 <= p660) OR (p660 <= 0))) OR ((1 <= p71) AND (((p41 <= 0)) OR ((1 <= p654))))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p206)) AND ((2 <= p211) OR (p211 <= 0)) AND ((((1 <= p562)) AND ((2 <= p660) OR (p660 <= 0))) OR ((1 <= p71) AND (((p41 <= 0)) OR ((1 <= p654))))))))
lola: processed formula length: 167
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p206)) AND ((2 <= p211) OR (p211 <= 0)) AND ((((1 <= p562)) AND ((2 <= p660) OR (p660 <= 0))) OR ((1 <= p71) AND (((p41 <= 0)) OR ((1 <= p654))))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 32 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 124 markings, 123 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes
lola:
preliminary result: no yes yes yes
lola: memory consumption: 45304 KB
lola: time consumption: 40 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

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

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-09b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2020"
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-4028"
echo " Executing tool gold2020"
echo " Input is ASLink-PT-09b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r011-tall-162038005900075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-09b.tgz
mv ASLink-PT-09b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;