Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110600653.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FamilyReunion-COL-L00200M0020C010P010G005, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110600653
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 6.7K Apr 30 13:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 30 13:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 30 10:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 10:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 9 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 24 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 146K May 10 09:33 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652707866820

Running Version 202205111006
[2022-05-16 13:31:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 13:31:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 13:31:08] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-16 13:31:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 13:31:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 768 ms
[2022-05-16 13:31:08] [INFO ] Detected 5 constant HL places corresponding to 56 PT places.
[2022-05-16 13:31:08] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 144109 PT places and 134480.0 transition bindings in 58 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2022-05-16 13:31:08] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 12 ms.
[2022-05-16 13:31:08] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 5 places and 0 transitions.
// Phase 1: matrix 66 rows 99 cols
[2022-05-16 13:31:08] [INFO ] Computed 33 place invariants in 12 ms
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-00 11 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 66 rows 99 cols
[2022-05-16 13:31:09] [INFO ] Computed 33 place invariants in 9 ms
[2022-05-16 13:31:09] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2022-05-16 13:31:09] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 14 ms returned sat
[2022-05-16 13:31:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:09] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2022-05-16 13:31:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:31:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:31:09] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 13:31:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:09] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-05-16 13:31:09] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 13:31:09] [INFO ] Added : 38 causal constraints over 8 iterations in 66 ms. Result :sat
Minimization took 14 ms.
[2022-05-16 13:31:09] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:31:09] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 13:31:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:09] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-05-16 13:31:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:31:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-05-16 13:31:09] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 13:31:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:09] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-05-16 13:31:09] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 13:31:09] [INFO ] Added : 58 causal constraints over 12 iterations in 88 ms. Result :sat
Minimization took 15 ms.
[2022-05-16 13:31:09] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2022-05-16 13:31:09] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 13:31:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:09] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-16 13:31:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:31:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 13:31:09] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2022-05-16 13:31:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:09] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-16 13:31:09] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 13:31:09] [INFO ] Added : 65 causal constraints over 13 iterations in 97 ms. Result :sat
Minimization took 20 ms.
[2022-05-16 13:31:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 13:31:10] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2022-05-16 13:31:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:10] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-05-16 13:31:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:31:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 13:31:10] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2022-05-16 13:31:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:10] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-05-16 13:31:10] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 13:31:10] [INFO ] Added : 41 causal constraints over 9 iterations in 65 ms. Result :sat
Minimization took 13 ms.
[2022-05-16 13:31:10] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:31:10] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 13:31:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:10] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-16 13:31:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:31:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 13:31:10] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2022-05-16 13:31:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:10] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-16 13:31:10] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 13:31:10] [INFO ] Added : 43 causal constraints over 9 iterations in 59 ms. Result :sat
Minimization took 12 ms.
[2022-05-16 13:31:10] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:31:10] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 13:31:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:10] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2022-05-16 13:31:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:31:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:31:10] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2022-05-16 13:31:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:10] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-16 13:31:10] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 13:31:10] [INFO ] Added : 44 causal constraints over 9 iterations in 60 ms. Result :sat
Minimization took 13 ms.
[2022-05-16 13:31:10] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:31:10] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2022-05-16 13:31:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:10] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 13:31:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:31:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:31:10] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2022-05-16 13:31:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:10] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-16 13:31:10] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 13:31:10] [INFO ] Added : 44 causal constraints over 9 iterations in 63 ms. Result :sat
Minimization took 14 ms.
[2022-05-16 13:31:10] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:31:10] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 13:31:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:10] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-16 13:31:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:31:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 13:31:10] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2022-05-16 13:31:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:10] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-16 13:31:10] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 13:31:11] [INFO ] Added : 53 causal constraints over 11 iterations in 64 ms. Result :sat
Minimization took 13 ms.
[2022-05-16 13:31:11] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:31:11] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 9 ms returned sat
[2022-05-16 13:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:11] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-16 13:31:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:31:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:31:11] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2022-05-16 13:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:11] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-16 13:31:11] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 13:31:11] [INFO ] Added : 13 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 8 ms.
[2022-05-16 13:31:11] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:31:11] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 13:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:11] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-16 13:31:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:31:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:31:11] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 13:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:11] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-16 13:31:11] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 13:31:11] [INFO ] Added : 10 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 12 ms.
[2022-05-16 13:31:11] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:31:11] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 13:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:11] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 13:31:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:31:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:31:11] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2022-05-16 13:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:11] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-16 13:31:11] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 13:31:11] [INFO ] Added : 14 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 10 ms.
[2022-05-16 13:31:11] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:31:11] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2022-05-16 13:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:11] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-16 13:31:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:31:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:31:11] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 11 ms returned sat
[2022-05-16 13:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:11] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-16 13:31:11] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 13:31:11] [INFO ] Added : 32 causal constraints over 7 iterations in 47 ms. Result :sat
Minimization took 11 ms.
[2022-05-16 13:31:11] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 13:31:11] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2022-05-16 13:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:11] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-16 13:31:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:31:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:31:11] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2022-05-16 13:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:11] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-16 13:31:11] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 13:31:11] [INFO ] Added : 31 causal constraints over 7 iterations in 42 ms. Result :sat
Minimization took 12 ms.
[2022-05-16 13:31:11] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:31:11] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2022-05-16 13:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:11] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 13:31:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:31:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:31:11] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 13:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:11] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-16 13:31:12] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 13:31:12] [INFO ] Added : 44 causal constraints over 9 iterations in 75 ms. Result :sat
Minimization took 12 ms.
[2022-05-16 13:31:12] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:31:12] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 13:31:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:12] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 13:31:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:31:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 13:31:12] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2022-05-16 13:31:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:31:12] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-16 13:31:12] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 13:31:12] [INFO ] Added : 13 causal constraints over 3 iterations in 26 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [201, 18, 12, 201, 201, 402, 402, 456, 201, 1206, 804, 402, 1608, 201, 201]
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 11
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 6
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
[2022-05-16 13:31:12] [INFO ] Unfolded HLPN to a Petri net with 128969 places and 110159 transitions 316597 arcs in 518 ms.
[2022-05-16 13:31:12] [INFO ] Unfolded 15 HLPN properties in 2 ms.
Deduced a syphon composed of 201 places in 324 ms
Reduce places removed 237 places and 0 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5229 ms. (steps per millisecond=1 ) properties (out of 15) seen :163
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 659 ms. (steps per millisecond=15 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 660 ms. (steps per millisecond=15 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 678 ms. (steps per millisecond=14 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 794 ms. (steps per millisecond=12 ) properties (out of 15) seen :0
// Phase 1: matrix 110159 rows 128732 cols
[2022-05-16 13:33:23] [WARNING] Invariant computation timed out after 120 seconds.
[2022-05-16 13:33:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 13:33:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 13:33:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 13:33:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 13:33:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 13:33:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 13:33:54] [INFO ] Computed 30573 place invariants in 150537 ms
[2022-05-16 13:33:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 13:34:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 13:34:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 13:34:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 13:34:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 13:34:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 13:34:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 12
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 13:34:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 13
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 13:34:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 14
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [201, 18, 12, 201, 201, 402, 402, 456, 201, 1206, 804, 402, 1608, 201, 201] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 72, 33, 28, 0, 1, 0, 29]
Support contains 20915 out of 128732 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 128732/128732 places, 110159/110159 transitions.
Graph (complete) has 198208 edges and 128732 vertex of which 128072 are kept as prefixes of interest. Removing 660 places using SCC suffix rule.132 ms
Discarding 660 places :
Also discarding 212 output transitions
Drop transitions removed 212 transitions
Discarding 21909 places :
Implicit places reduction removed 21909 places
Drop transitions removed 42210 transitions
Trivial Post-agglo rules discarded 42210 transitions
Performed 42210 trivial Post agglomeration. Transition count delta: 42210
Iterating post reduction 0 with 64119 rules applied. Total rules applied 64120 place count 106163 transition count 67737
Reduce places removed 42210 places and 0 transitions.
Performed 2613 Post agglomeration using F-continuation condition.Transition count delta: 2613
Iterating post reduction 1 with 44823 rules applied. Total rules applied 108943 place count 63953 transition count 65124
Reduce places removed 2613 places and 0 transitions.
Iterating post reduction 2 with 2613 rules applied. Total rules applied 111556 place count 61340 transition count 65124
Performed 3216 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3216 Pre rules applied. Total rules applied 111556 place count 61340 transition count 61908
Deduced a syphon composed of 3216 places in 77 ms
Reduce places removed 3216 places and 0 transitions.
Iterating global reduction 3 with 6432 rules applied. Total rules applied 117988 place count 58124 transition count 61908
Discarding 2211 places :
Implicit places reduction removed 2211 places
Iterating post reduction 3 with 2211 rules applied. Total rules applied 120199 place count 55913 transition count 61908
Performed 1005 Post agglomeration using F-continuation condition.Transition count delta: 1005
Deduced a syphon composed of 1005 places in 40 ms
Reduce places removed 1005 places and 0 transitions.
Iterating global reduction 4 with 2010 rules applied. Total rules applied 122209 place count 54908 transition count 60903
Free-agglomeration rule (complex) applied 9648 times.
Iterating global reduction 4 with 9648 rules applied. Total rules applied 131857 place count 54908 transition count 91455
Ensure Unique test removed 402 places
Reduce places removed 10050 places and 0 transitions.
Ensure Unique test removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Iterating post reduction 4 with 10251 rules applied. Total rules applied 142108 place count 44858 transition count 91254
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 142128 place count 44838 transition count 47034
Iterating global reduction 5 with 20 rules applied. Total rules applied 142148 place count 44838 transition count 47034
Applied a total of 142148 rules in 46095 ms. Remains 44838 /128732 variables (removed 83894) and now considering 47034/110159 (removed 63125) transitions.
Finished structural reductions, in 1 iterations. Remains : 44838/128732 places, 47034/110159 transitions.
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 13:35:32] [INFO ] Computed 5834 place invariants in 7394 ms
Finished random walk after 65134 steps, including 15 resets, run visited all 15 properties in 30001 ms. (steps per millisecond=2 )
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4480 ms. (steps per millisecond=223 ) properties (out of 15) seen :3
Interrupted Best-First random walk after 751361 steps, including 2 resets, run timeout after 5006 ms. (steps per millisecond=150 ) properties seen 3
Interrupted Best-First random walk after 611192 steps, including 1 resets, run timeout after 5004 ms. (steps per millisecond=122 ) properties seen 2
Interrupted Best-First random walk after 749080 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=149 ) properties seen 3
Interrupted Best-First random walk after 647522 steps, including 1 resets, run timeout after 5004 ms. (steps per millisecond=129 ) properties seen 2
Interrupted Best-First random walk after 648520 steps, including 1 resets, run timeout after 5005 ms. (steps per millisecond=129 ) properties seen 2
Interrupted Best-First random walk after 645120 steps, including 1 resets, run timeout after 5004 ms. (steps per millisecond=128 ) properties seen 1
Interrupted Best-First random walk after 659811 steps, including 1 resets, run timeout after 5002 ms. (steps per millisecond=131 ) properties seen 3
Interrupted Best-First random walk after 65152 steps, including 0 resets, run timeout after 5008 ms. (steps per millisecond=13 ) properties seen 0
Interrupted Best-First random walk after 77377 steps, including 0 resets, run timeout after 5032 ms. (steps per millisecond=15 ) properties seen 9
Interrupted Best-First random walk after 57288 steps, including 0 resets, run timeout after 5067 ms. (steps per millisecond=11 ) properties seen 0
Interrupted Best-First random walk after 104273 steps, including 0 resets, run timeout after 5035 ms. (steps per millisecond=20 ) properties seen 0
Interrupted Best-First random walk after 598082 steps, including 1 resets, run timeout after 5007 ms. (steps per millisecond=119 ) properties seen 1
Interrupted Best-First random walk after 599562 steps, including 1 resets, run timeout after 5005 ms. (steps per millisecond=119 ) properties seen 2
Interrupted Best-First random walk after 57288 steps, including 0 resets, run timeout after 5051 ms. (steps per millisecond=11 ) properties seen 0
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 13:37:24] [INFO ] Computed 5834 place invariants in 7492 ms
Current structural bounds on expressions (after SMT) : [201, 18, 12, 201, 201, 402, 402, 456, 201, 1206, 804, 402, 1608, 201, 201] Max seen :[46, 6, 6, 39, 34, 35, 58, 32, 129, 97, 48, 48, 125, 59, 59]
Support contains 20915 out of 44838 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 44838/44838 places, 47034/47034 transitions.
Applied a total of 0 rules in 444 ms. Remains 44838 /44838 variables (removed 0) and now considering 47034/47034 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 44838/44838 places, 47034/47034 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 44838/44838 places, 47034/47034 transitions.
Applied a total of 0 rules in 413 ms. Remains 44838 /44838 variables (removed 0) and now considering 47034/47034 (removed 0) transitions.
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 13:39:19] [INFO ] Computed 5834 place invariants in 7620 ms
[2022-05-16 13:39:23] [INFO ] Implicit Places using invariants in 11004 ms returned []
Implicit Place search using SMT only with invariants took 11005 ms to find 0 implicit places.
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 13:39:30] [INFO ] Computed 5834 place invariants in 7354 ms
[2022-05-16 13:39:34] [INFO ] Dead Transitions using invariants and state equation in 10722 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 44838/44838 places, 47034/47034 transitions.
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 13:39:41] [INFO ] Computed 5834 place invariants in 7686 ms
Finished random walk after 63931 steps, including 15 resets, run visited all 15 properties in 30001 ms. (steps per millisecond=2 )
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4503 ms. (steps per millisecond=222 ) properties (out of 15) seen :3
Interrupted Best-First random walk after 594838 steps, including 1 resets, run timeout after 5008 ms. (steps per millisecond=118 ) properties seen 5
Interrupted Best-First random walk after 590856 steps, including 1 resets, run timeout after 5008 ms. (steps per millisecond=117 ) properties seen 2
Interrupted Best-First random walk after 593179 steps, including 1 resets, run timeout after 5004 ms. (steps per millisecond=118 ) properties seen 2
Interrupted Best-First random walk after 598984 steps, including 1 resets, run timeout after 5004 ms. (steps per millisecond=119 ) properties seen 0
Interrupted Best-First random walk after 596941 steps, including 1 resets, run timeout after 5003 ms. (steps per millisecond=119 ) properties seen 2
Interrupted Best-First random walk after 594100 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=118 ) properties seen 3
Interrupted Best-First random walk after 610410 steps, including 1 resets, run timeout after 5003 ms. (steps per millisecond=122 ) properties seen 2
Interrupted Best-First random walk after 56327 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=11 ) properties seen 0
Interrupted Best-First random walk after 57047 steps, including 0 resets, run timeout after 5012 ms. (steps per millisecond=11 ) properties seen 6
Interrupted Best-First random walk after 56327 steps, including 0 resets, run timeout after 5002 ms. (steps per millisecond=11 ) properties seen 0
Interrupted Best-First random walk after 104273 steps, including 0 resets, run timeout after 5040 ms. (steps per millisecond=20 ) properties seen 0
Interrupted Best-First random walk after 597922 steps, including 1 resets, run timeout after 5007 ms. (steps per millisecond=119 ) properties seen 2
Interrupted Best-First random walk after 597262 steps, including 1 resets, run timeout after 5007 ms. (steps per millisecond=119 ) properties seen 0
Interrupted Best-First random walk after 57288 steps, including 0 resets, run timeout after 5080 ms. (steps per millisecond=11 ) properties seen 0
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 13:41:33] [INFO ] Computed 5834 place invariants in 7341 ms
Current structural bounds on expressions (after SMT) : [201, 18, 12, 201, 201, 402, 402, 456, 201, 1206, 804, 402, 1608, 201, 201] Max seen :[46, 6, 6, 39, 37, 36, 58, 32, 129, 97, 49, 48, 127, 59, 59]
Support contains 20915 out of 44838 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 44838/44838 places, 47034/47034 transitions.
Applied a total of 0 rules in 407 ms. Remains 44838 /44838 variables (removed 0) and now considering 47034/47034 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 44838/44838 places, 47034/47034 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 44838/44838 places, 47034/47034 transitions.
Applied a total of 0 rules in 403 ms. Remains 44838 /44838 variables (removed 0) and now considering 47034/47034 (removed 0) transitions.
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 13:43:32] [INFO ] Computed 5834 place invariants in 7870 ms
[2022-05-16 13:43:35] [INFO ] Implicit Places using invariants in 11373 ms returned []
Implicit Place search using SMT only with invariants took 11375 ms to find 0 implicit places.
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 13:43:45] [INFO ] Computed 5834 place invariants in 9199 ms
[2022-05-16 13:43:48] [INFO ] Dead Transitions using invariants and state equation in 13056 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 44838/44838 places, 47034/47034 transitions.
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 13:43:59] [INFO ] Computed 5834 place invariants in 10539 ms
Finished random walk after 64108 steps, including 15 resets, run visited all 15 properties in 30001 ms. (steps per millisecond=2 )
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4557 ms. (steps per millisecond=219 ) properties (out of 15) seen :5
Interrupted Best-First random walk after 588775 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=117 ) properties seen 2
Interrupted Best-First random walk after 594178 steps, including 1 resets, run timeout after 5005 ms. (steps per millisecond=118 ) properties seen 1
Interrupted Best-First random walk after 594298 steps, including 1 resets, run timeout after 5002 ms. (steps per millisecond=118 ) properties seen 4
Interrupted Best-First random walk after 595720 steps, including 1 resets, run timeout after 5006 ms. (steps per millisecond=119 ) properties seen 1
Interrupted Best-First random walk after 596421 steps, including 1 resets, run timeout after 5006 ms. (steps per millisecond=119 ) properties seen 1
Interrupted Best-First random walk after 597080 steps, including 1 resets, run timeout after 5009 ms. (steps per millisecond=119 ) properties seen 1
Interrupted Best-First random walk after 597802 steps, including 1 resets, run timeout after 5008 ms. (steps per millisecond=119 ) properties seen 3
Interrupted Best-First random walk after 56327 steps, including 0 resets, run timeout after 5006 ms. (steps per millisecond=11 ) properties seen 0
Interrupted Best-First random walk after 57047 steps, including 0 resets, run timeout after 5017 ms. (steps per millisecond=11 ) properties seen 6
Interrupted Best-First random walk after 56327 steps, including 0 resets, run timeout after 5008 ms. (steps per millisecond=11 ) properties seen 0
Interrupted Best-First random walk after 103272 steps, including 0 resets, run timeout after 5014 ms. (steps per millisecond=20 ) properties seen 0
Interrupted Best-First random walk after 590858 steps, including 1 resets, run timeout after 5002 ms. (steps per millisecond=118 ) properties seen 1
Interrupted Best-First random walk after 592858 steps, including 1 resets, run timeout after 5009 ms. (steps per millisecond=118 ) properties seen 3
Interrupted Best-First random walk after 56327 steps, including 0 resets, run timeout after 5022 ms. (steps per millisecond=11 ) properties seen 0
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 13:45:51] [INFO ] Computed 5834 place invariants in 7506 ms
Current structural bounds on expressions (after SMT) : [201, 18, 12, 201, 201, 402, 402, 456, 201, 1206, 804, 402, 1608, 201, 201] Max seen :[46, 6, 6, 39, 37, 37, 58, 32, 129, 97, 52, 48, 127, 59, 59]
Support contains 20915 out of 44838 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 44838/44838 places, 47034/47034 transitions.
Applied a total of 0 rules in 415 ms. Remains 44838 /44838 variables (removed 0) and now considering 47034/47034 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 44838/44838 places, 47034/47034 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 44838/44838 places, 47034/47034 transitions.
Applied a total of 0 rules in 411 ms. Remains 44838 /44838 variables (removed 0) and now considering 47034/47034 (removed 0) transitions.
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 13:47:49] [INFO ] Computed 5834 place invariants in 7632 ms
[2022-05-16 13:47:52] [INFO ] Implicit Places using invariants in 11106 ms returned []
Implicit Place search using SMT only with invariants took 11118 ms to find 0 implicit places.
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 13:48:00] [INFO ] Computed 5834 place invariants in 7839 ms
[2022-05-16 13:48:04] [INFO ] Dead Transitions using invariants and state equation in 11326 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 44838/44838 places, 47034/47034 transitions.
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 13:48:12] [INFO ] Computed 5834 place invariants in 7879 ms
Finished random walk after 64024 steps, including 15 resets, run visited all 15 properties in 30001 ms. (steps per millisecond=2 )
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4542 ms. (steps per millisecond=220 ) properties (out of 15) seen :4
Interrupted Best-First random walk after 592398 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=118 ) properties seen 1
Interrupted Best-First random walk after 590497 steps, including 1 resets, run timeout after 5003 ms. (steps per millisecond=118 ) properties seen 1
Interrupted Best-First random walk after 591758 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=118 ) properties seen 0
Interrupted Best-First random walk after 594959 steps, including 1 resets, run timeout after 5002 ms. (steps per millisecond=118 ) properties seen 3
Interrupted Best-First random walk after 590397 steps, including 1 resets, run timeout after 5003 ms. (steps per millisecond=118 ) properties seen 1
Interrupted Best-First random walk after 594178 steps, including 1 resets, run timeout after 5008 ms. (steps per millisecond=118 ) properties seen 2
Interrupted Best-First random walk after 602364 steps, including 1 resets, run timeout after 5004 ms. (steps per millisecond=120 ) properties seen 2
Interrupted Best-First random walk after 56327 steps, including 0 resets, run timeout after 5010 ms. (steps per millisecond=11 ) properties seen 0
Interrupted Best-First random walk after 57047 steps, including 0 resets, run timeout after 5016 ms. (steps per millisecond=11 ) properties seen 6
Interrupted Best-First random walk after 56327 steps, including 0 resets, run timeout after 5007 ms. (steps per millisecond=11 ) properties seen 0
Interrupted Best-First random walk after 104273 steps, including 0 resets, run timeout after 5040 ms. (steps per millisecond=20 ) properties seen 0
Interrupted Best-First random walk after 593960 steps, including 1 resets, run timeout after 5002 ms. (steps per millisecond=118 ) properties seen 2
Interrupted Best-First random walk after 595600 steps, including 1 resets, run timeout after 5005 ms. (steps per millisecond=119 ) properties seen 2
Interrupted Best-First random walk after 56327 steps, including 0 resets, run timeout after 5003 ms. (steps per millisecond=11 ) properties seen 0
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 13:50:04] [INFO ] Computed 5834 place invariants in 8161 ms
Current structural bounds on expressions (after SMT) : [201, 18, 12, 201, 201, 402, 402, 456, 201, 1206, 804, 402, 1608, 201, 201] Max seen :[46, 6, 6, 39, 37, 38, 58, 34, 135, 97, 52, 48, 127, 59, 60]
Support contains 20915 out of 44838 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 44838/44838 places, 47034/47034 transitions.
Applied a total of 0 rules in 498 ms. Remains 44838 /44838 variables (removed 0) and now considering 47034/47034 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 44838/44838 places, 47034/47034 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 44838/44838 places, 47034/47034 transitions.
Applied a total of 0 rules in 508 ms. Remains 44838 /44838 variables (removed 0) and now considering 47034/47034 (removed 0) transitions.
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 13:52:07] [INFO ] Computed 5834 place invariants in 8962 ms
[2022-05-16 13:52:10] [INFO ] Implicit Places using invariants in 12744 ms returned []
Implicit Place search using SMT only with invariants took 12747 ms to find 0 implicit places.
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 13:52:25] [INFO ] Computed 5834 place invariants in 14257 ms
[2022-05-16 13:52:28] [INFO ] Dead Transitions using invariants and state equation in 17739 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 44838/44838 places, 47034/47034 transitions.
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 13:52:37] [INFO ] Computed 5834 place invariants in 8676 ms
Finished random walk after 64022 steps, including 15 resets, run visited all 15 properties in 30001 ms. (steps per millisecond=2 )
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4624 ms. (steps per millisecond=216 ) properties (out of 15) seen :3
Interrupted Best-First random walk after 580009 steps, including 1 resets, run timeout after 5005 ms. (steps per millisecond=115 ) properties seen 5
Interrupted Best-First random walk after 582271 steps, including 1 resets, run timeout after 5006 ms. (steps per millisecond=116 ) properties seen 1
Interrupted Best-First random walk after 587394 steps, including 1 resets, run timeout after 5005 ms. (steps per millisecond=117 ) properties seen 1
Interrupted Best-First random walk after 589156 steps, including 1 resets, run timeout after 5003 ms. (steps per millisecond=117 ) properties seen 1
Interrupted Best-First random walk after 587694 steps, including 1 resets, run timeout after 5004 ms. (steps per millisecond=117 ) properties seen 2
Interrupted Best-First random walk after 585914 steps, including 1 resets, run timeout after 5006 ms. (steps per millisecond=117 ) properties seen 1
Interrupted Best-First random walk after 594060 steps, including 1 resets, run timeout after 5009 ms. (steps per millisecond=118 ) properties seen 2
Interrupted Best-First random walk after 56327 steps, including 0 resets, run timeout after 5005 ms. (steps per millisecond=11 ) properties seen 0
Interrupted Best-First random walk after 57047 steps, including 0 resets, run timeout after 5035 ms. (steps per millisecond=11 ) properties seen 6
Interrupted Best-First random walk after 56327 steps, including 0 resets, run timeout after 5016 ms. (steps per millisecond=11 ) properties seen 0
Interrupted Best-First random walk after 104273 steps, including 0 resets, run timeout after 5045 ms. (steps per millisecond=20 ) properties seen 0
Interrupted Best-First random walk after 588856 steps, including 1 resets, run timeout after 5005 ms. (steps per millisecond=117 ) properties seen 1
Interrupted Best-First random walk after 583412 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=116 ) properties seen 1
Interrupted Best-First random walk after 56327 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=11 ) properties seen 0
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 13:54:29] [INFO ] Computed 5834 place invariants in 7457 ms
Current structural bounds on expressions (after SMT) : [201, 18, 12, 201, 201, 402, 402, 456, 201, 1206, 804, 402, 1608, 201, 201] Max seen :[46, 6, 6, 39, 37, 38, 58, 34, 135, 97, 52, 48, 127, 59, 60]
Support contains 20915 out of 44838 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 44838/44838 places, 47034/47034 transitions.
Applied a total of 0 rules in 394 ms. Remains 44838 /44838 variables (removed 0) and now considering 47034/47034 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 44838/44838 places, 47034/47034 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 44838/44838 places, 47034/47034 transitions.
Applied a total of 0 rules in 377 ms. Remains 44838 /44838 variables (removed 0) and now considering 47034/47034 (removed 0) transitions.
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 13:56:24] [INFO ] Computed 5834 place invariants in 7465 ms
[2022-05-16 13:56:27] [INFO ] Implicit Places using invariants in 10756 ms returned []
Implicit Place search using SMT only with invariants took 10758 ms to find 0 implicit places.
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 13:56:35] [INFO ] Computed 5834 place invariants in 8175 ms
[2022-05-16 13:56:39] [INFO ] Dead Transitions using invariants and state equation in 11523 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 44838/44838 places, 47034/47034 transitions.
Starting property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-01
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 13:56:46] [INFO ] Computed 5834 place invariants in 7539 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 599 ms. (steps per millisecond=16 ) properties (out of 1) seen :44
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 13:56:55] [INFO ] Computed 5834 place invariants in 7419 ms
Current structural bounds on expressions (after SMT) : [607332] Max seen :[44]
Support contains 11 out of 44838 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 44838/44838 places, 47034/47034 transitions.
Graph (complete) has 77386 edges and 44838 vertex of which 39408 are kept as prefixes of interest. Removing 5430 places using SCC suffix rule.25 ms
Discarding 5430 places :
Also discarding 4221 output transitions
Drop transitions removed 4221 transitions
Discarding 4221 places :
Implicit places reduction removed 4221 places
Drop transitions removed 19095 transitions
Trivial Post-agglo rules discarded 19095 transitions
Performed 19095 trivial Post agglomeration. Transition count delta: 19095
Iterating post reduction 0 with 23316 rules applied. Total rules applied 23317 place count 35187 transition count 23718
Reduce places removed 19095 places and 0 transitions.
Iterating post reduction 1 with 19095 rules applied. Total rules applied 42412 place count 16092 transition count 23718
Performed 2211 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2211 Pre rules applied. Total rules applied 42412 place count 16092 transition count 21507
Deduced a syphon composed of 2211 places in 8 ms
Reduce places removed 2211 places and 0 transitions.
Iterating global reduction 2 with 4422 rules applied. Total rules applied 46834 place count 13881 transition count 21507
Discarding 200 places :
Symmetric choice reduction at 2 with 200 rule applications. Total rules 47034 place count 13681 transition count 19307
Iterating global reduction 2 with 200 rules applied. Total rules applied 47234 place count 13681 transition count 19307
Performed 4221 Post agglomeration using F-continuation condition.Transition count delta: 4221
Deduced a syphon composed of 4221 places in 22 ms
Reduce places removed 4221 places and 0 transitions.
Iterating global reduction 2 with 8442 rules applied. Total rules applied 55676 place count 9460 transition count 15086
Discarding 6030 places :
Symmetric choice reduction at 2 with 6030 rule applications. Total rules 61706 place count 3430 transition count 9056
Ensure Unique test removed 201 places
Iterating global reduction 2 with 6231 rules applied. Total rules applied 67937 place count 3229 transition count 9056
Ensure Unique test removed 4020 transitions
Reduce isomorphic transitions removed 4020 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 2 with 4221 rules applied. Total rules applied 72158 place count 3229 transition count 4835
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 3 with 201 rules applied. Total rules applied 72359 place count 3028 transition count 4835
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 72361 place count 3027 transition count 6834
Reduce places removed 201 places and 201 transitions.
Iterating global reduction 4 with 201 rules applied. Total rules applied 72562 place count 2826 transition count 6633
Applied a total of 72562 rules in 5552 ms. Remains 2826 /44838 variables (removed 42012) and now considering 6633/47034 (removed 40401) transitions.
Finished structural reductions, in 1 iterations. Remains : 2826/44838 places, 6633/47034 transitions.
// Phase 1: matrix 6633 rows 2826 cols
[2022-05-16 13:57:05] [INFO ] Computed 203 place invariants in 86 ms
Finished random walk after 575499 steps, including 952 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=19 )
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4110 ms. (steps per millisecond=243 ) properties (out of 1) seen :76
// Phase 1: matrix 6633 rows 2826 cols
[2022-05-16 13:57:40] [INFO ] Computed 203 place invariants in 85 ms
[2022-05-16 13:57:40] [INFO ] [Real]Absence check using 0 positive and 203 generalized place invariants in 70 ms returned sat
[2022-05-16 13:57:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:57:42] [INFO ] [Real]Absence check using state equation in 1759 ms returned sat
[2022-05-16 13:57:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:57:42] [INFO ] [Nat]Absence check using 0 positive and 203 generalized place invariants in 68 ms returned sat
[2022-05-16 13:57:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:57:44] [INFO ] [Nat]Absence check using state equation in 1793 ms returned sat
[2022-05-16 13:57:45] [INFO ] Computed and/alt/rep : 2211/2211/2211 causal constraints (skipped 2211 transitions) in 623 ms.
[2022-05-16 13:57:55] [INFO ] Added : 200 causal constraints over 40 iterations in 10531 ms. Result :sat
Current structural bounds on expressions (after SMT) : [607332] Max seen :[76]
Support contains 11 out of 2826 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2826/2826 places, 6633/6633 transitions.
Applied a total of 0 rules in 295 ms. Remains 2826 /2826 variables (removed 0) and now considering 6633/6633 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2826/2826 places, 6633/6633 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2826/2826 places, 6633/6633 transitions.
Applied a total of 0 rules in 250 ms. Remains 2826 /2826 variables (removed 0) and now considering 6633/6633 (removed 0) transitions.
// Phase 1: matrix 6633 rows 2826 cols
[2022-05-16 13:57:57] [INFO ] Computed 203 place invariants in 86 ms
[2022-05-16 13:57:59] [INFO ] Implicit Places using invariants in 2459 ms returned [0, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402]
Discarding 202 places :
Implicit Place search using SMT only with invariants took 2470 ms to find 202 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 2624/2826 places, 6633/6633 transitions.
Discarding 200 places :
Symmetric choice reduction at 0 with 200 rule applications. Total rules 200 place count 2424 transition count 4433
Iterating global reduction 0 with 200 rules applied. Total rules applied 400 place count 2424 transition count 4433
Discarding 2200 places :
Symmetric choice reduction at 0 with 2200 rule applications. Total rules 2600 place count 224 transition count 2233
Iterating global reduction 0 with 2200 rules applied. Total rules applied 4800 place count 224 transition count 2233
Discarding 200 places :
Symmetric choice reduction at 0 with 200 rule applications. Total rules 5000 place count 24 transition count 33
Iterating global reduction 0 with 200 rules applied. Total rules applied 5200 place count 24 transition count 33
Free-agglomeration rule applied 11 times.
Iterating global reduction 0 with 11 rules applied. Total rules applied 5211 place count 24 transition count 22
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 5222 place count 13 transition count 22
Applied a total of 5222 rules in 272 ms. Remains 13 /2624 variables (removed 2611) and now considering 22/6633 (removed 6611) transitions.
// Phase 1: matrix 22 rows 13 cols
[2022-05-16 13:58:00] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 13:58:00] [INFO ] Implicit Places using invariants in 21 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 12/2826 places, 22/6633 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 12/2826 places, 22/6633 transitions.
// Phase 1: matrix 22 rows 12 cols
[2022-05-16 13:58:00] [INFO ] Computed 0 place invariants in 0 ms
Incomplete random walk after 1000147 steps, including 2469 resets, run finished after 99 ms. (steps per millisecond=10102 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 153 resets, run finished after 585 ms. (steps per millisecond=1709 ) properties (out of 1) seen :201
// Phase 1: matrix 22 rows 12 cols
[2022-05-16 13:58:00] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 13:58:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:58:00] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
Current structural bounds on expressions (after SMT) : [201] Max seen :[201]
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-01 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-01 in 81631 ms.
Starting property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-02
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 13:58:08] [INFO ] Computed 5834 place invariants in 7331 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 659 ms. (steps per millisecond=15 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 13:58:16] [INFO ] Computed 5834 place invariants in 7505 ms
Current structural bounds on expressions (after SMT) : [206] Max seen :[5]
Support contains 201 out of 44838 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 44838/44838 places, 47034/47034 transitions.
Graph (complete) has 77386 edges and 44838 vertex of which 44435 are kept as prefixes of interest. Removing 403 places using SCC suffix rule.21 ms
Discarding 403 places :
Also discarding 201 output transitions
Drop transitions removed 201 transitions
Discarding 4221 places :
Implicit places reduction removed 4221 places
Drop transitions removed 21306 transitions
Trivial Post-agglo rules discarded 21306 transitions
Performed 21306 trivial Post agglomeration. Transition count delta: 21306
Iterating post reduction 0 with 25527 rules applied. Total rules applied 25528 place count 40214 transition count 25527
Reduce places removed 21306 places and 0 transitions.
Iterating post reduction 1 with 21306 rules applied. Total rules applied 46834 place count 18908 transition count 25527
Performed 603 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 603 Pre rules applied. Total rules applied 46834 place count 18908 transition count 24924
Deduced a syphon composed of 603 places in 6 ms
Ensure Unique test removed 603 places
Reduce places removed 1206 places and 0 transitions.
Iterating global reduction 2 with 1809 rules applied. Total rules applied 48643 place count 17702 transition count 24924
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 2 with 201 rules applied. Total rules applied 48844 place count 17702 transition count 24723
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 3 with 201 rules applied. Total rules applied 49045 place count 17501 transition count 24723
Performed 6834 Post agglomeration using F-continuation condition.Transition count delta: 6834
Deduced a syphon composed of 6834 places in 7 ms
Reduce places removed 6834 places and 0 transitions.
Iterating global reduction 4 with 13668 rules applied. Total rules applied 62713 place count 10667 transition count 17889
Discarding 8040 places :
Symmetric choice reduction at 4 with 8040 rule applications. Total rules 70753 place count 2627 transition count 9849
Ensure Unique test removed 402 places
Iterating global reduction 4 with 8442 rules applied. Total rules applied 79195 place count 2225 transition count 9849
Ensure Unique test removed 4020 transitions
Reduce isomorphic transitions removed 4020 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 4 with 4221 rules applied. Total rules applied 83416 place count 2225 transition count 5628
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 5 with 201 rules applied. Total rules applied 83617 place count 2024 transition count 5628
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 83627 place count 2014 transition count 3618
Iterating global reduction 6 with 10 rules applied. Total rules applied 83637 place count 2014 transition count 3618
Ensure Unique test removed 2010 transitions
Reduce isomorphic transitions removed 2010 transitions.
Discarding 201 places :
Implicit places reduction removed 201 places
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 6 with 2412 rules applied. Total rules applied 86049 place count 1813 transition count 1407
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 7 with 201 rules applied. Total rules applied 86250 place count 1612 transition count 1407
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 201 Pre rules applied. Total rules applied 86250 place count 1612 transition count 1206
Deduced a syphon composed of 201 places in 0 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 8 with 402 rules applied. Total rules applied 86652 place count 1411 transition count 1206
Free-agglomeration rule (complex) applied 201 times.
Iterating global reduction 8 with 201 rules applied. Total rules applied 86853 place count 1411 transition count 1005
Ensure Unique test removed 201 places
Reduce places removed 402 places and 0 transitions.
Iterating post reduction 8 with 402 rules applied. Total rules applied 87255 place count 1009 transition count 1005
Reduce places removed 201 places and 201 transitions.
Iterating global reduction 9 with 201 rules applied. Total rules applied 87456 place count 808 transition count 804
Applied a total of 87456 rules in 4885 ms. Remains 808 /44838 variables (removed 44030) and now considering 804/47034 (removed 46230) transitions.
Finished structural reductions, in 1 iterations. Remains : 808/44838 places, 804/47034 transitions.
// Phase 1: matrix 804 rows 808 cols
[2022-05-16 13:58:26] [INFO ] Computed 4 place invariants in 14 ms
Finished random walk after 895871 steps, including 2158 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=29 )
Finished Best-First random walk after 824996 steps, including 15 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=164 )
// Phase 1: matrix 804 rows 808 cols
[2022-05-16 13:59:01] [INFO ] Computed 4 place invariants in 23 ms
[2022-05-16 13:59:01] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 8 ms returned sat
[2022-05-16 13:59:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:59:01] [INFO ] [Real]Absence check using state equation in 148 ms returned unsat
Current structural bounds on expressions (after SMT) : [6] Max seen :[6]
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-02 in 60841 ms.
Starting property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-03
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 13:59:10] [INFO ] Computed 5834 place invariants in 8298 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 650 ms. (steps per millisecond=15 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 13:59:18] [INFO ] Computed 5834 place invariants in 7720 ms
Current structural bounds on expressions (after SMT) : [206] Max seen :[6]
Support contains 201 out of 44838 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 44838/44838 places, 47034/47034 transitions.
Discarding 4221 places :
Implicit places reduction removed 4221 places
Drop transitions removed 21306 transitions
Trivial Post-agglo rules discarded 21306 transitions
Performed 21306 trivial Post agglomeration. Transition count delta: 21306
Iterating post reduction 0 with 25527 rules applied. Total rules applied 25527 place count 40617 transition count 25728
Reduce places removed 21306 places and 0 transitions.
Iterating post reduction 1 with 21306 rules applied. Total rules applied 46833 place count 19311 transition count 25728
Performed 804 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 804 Pre rules applied. Total rules applied 46833 place count 19311 transition count 24924
Deduced a syphon composed of 804 places in 7 ms
Ensure Unique test removed 603 places
Reduce places removed 1407 places and 0 transitions.
Iterating global reduction 2 with 2211 rules applied. Total rules applied 49044 place count 17904 transition count 24924
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 2 with 201 rules applied. Total rules applied 49245 place count 17904 transition count 24723
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 3 with 201 rules applied. Total rules applied 49446 place count 17703 transition count 24723
Performed 6834 Post agglomeration using F-continuation condition.Transition count delta: 6834
Deduced a syphon composed of 6834 places in 7 ms
Reduce places removed 6834 places and 0 transitions.
Iterating global reduction 4 with 13668 rules applied. Total rules applied 63114 place count 10869 transition count 17889
Discarding 8040 places :
Symmetric choice reduction at 4 with 8040 rule applications. Total rules 71154 place count 2829 transition count 9849
Ensure Unique test removed 402 places
Iterating global reduction 4 with 8442 rules applied. Total rules applied 79596 place count 2427 transition count 9849
Ensure Unique test removed 4020 transitions
Reduce isomorphic transitions removed 4020 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 4 with 4221 rules applied. Total rules applied 83817 place count 2427 transition count 5628
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 5 with 201 rules applied. Total rules applied 84018 place count 2226 transition count 5628
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 84028 place count 2216 transition count 3618
Iterating global reduction 6 with 10 rules applied. Total rules applied 84038 place count 2216 transition count 3618
Ensure Unique test removed 2010 transitions
Reduce isomorphic transitions removed 2010 transitions.
Discarding 201 places :
Implicit places reduction removed 201 places
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 6 with 2412 rules applied. Total rules applied 86450 place count 2015 transition count 1407
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 7 with 201 rules applied. Total rules applied 86651 place count 1814 transition count 1407
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 201 Pre rules applied. Total rules applied 86651 place count 1814 transition count 1206
Deduced a syphon composed of 201 places in 0 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 8 with 402 rules applied. Total rules applied 87053 place count 1613 transition count 1206
Free-agglomeration rule (complex) applied 201 times.
Iterating global reduction 8 with 201 rules applied. Total rules applied 87254 place count 1613 transition count 1005
Ensure Unique test removed 201 places
Reduce places removed 402 places and 0 transitions.
Iterating post reduction 8 with 402 rules applied. Total rules applied 87656 place count 1211 transition count 1005
Reduce places removed 201 places and 201 transitions.
Iterating global reduction 9 with 201 rules applied. Total rules applied 87857 place count 1010 transition count 804
Applied a total of 87857 rules in 5140 ms. Remains 1010 /44838 variables (removed 43828) and now considering 804/47034 (removed 46230) transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/44838 places, 804/47034 transitions.
// Phase 1: matrix 804 rows 1010 cols
[2022-05-16 13:59:28] [INFO ] Computed 206 place invariants in 25 ms
Finished random walk after 885905 steps, including 2134 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=29 )
Finished Best-First random walk after 824333 steps, including 15 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=164 )
// Phase 1: matrix 804 rows 1010 cols
[2022-05-16 14:00:03] [INFO ] Computed 206 place invariants in 26 ms
[2022-05-16 14:00:03] [INFO ] [Real]Absence check using 202 positive place invariants in 13 ms returned unsat
Current structural bounds on expressions (after SMT) : [6] Max seen :[6]
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-03 in 62152 ms.
Starting property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-04
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 14:00:11] [INFO ] Computed 5834 place invariants in 7888 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 654 ms. (steps per millisecond=15 ) properties (out of 1) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 14:00:20] [INFO ] Computed 5834 place invariants in 7784 ms
Current structural bounds on expressions (after SMT) : [4601] Max seen :[33]
Support contains 201 out of 44838 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 44838/44838 places, 47034/47034 transitions.
Graph (complete) has 77386 edges and 44838 vertex of which 42021 are kept as prefixes of interest. Removing 2817 places using SCC suffix rule.21 ms
Discarding 2817 places :
Also discarding 1809 output transitions
Drop transitions removed 1809 transitions
Discarding 4221 places :
Implicit places reduction removed 4221 places
Drop transitions removed 21306 transitions
Trivial Post-agglo rules discarded 21306 transitions
Performed 21306 trivial Post agglomeration. Transition count delta: 21306
Iterating post reduction 0 with 25527 rules applied. Total rules applied 25528 place count 37800 transition count 23919
Reduce places removed 21306 places and 0 transitions.
Iterating post reduction 1 with 21306 rules applied. Total rules applied 46834 place count 16494 transition count 23919
Performed 6432 Post agglomeration using F-continuation condition.Transition count delta: 6432
Deduced a syphon composed of 6432 places in 5 ms
Reduce places removed 6432 places and 0 transitions.
Iterating global reduction 2 with 12864 rules applied. Total rules applied 59698 place count 10062 transition count 17487
Discarding 8040 places :
Symmetric choice reduction at 2 with 8040 rule applications. Total rules 67738 place count 2022 transition count 9447
Ensure Unique test removed 402 places
Iterating global reduction 2 with 8442 rules applied. Total rules applied 76180 place count 1620 transition count 9447
Ensure Unique test removed 4020 transitions
Reduce isomorphic transitions removed 4020 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 2 with 4221 rules applied. Total rules applied 80401 place count 1620 transition count 5226
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 3 with 201 rules applied. Total rules applied 80602 place count 1419 transition count 5226
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 80612 place count 1409 transition count 3216
Iterating global reduction 4 with 10 rules applied. Total rules applied 80622 place count 1409 transition count 3216
Ensure Unique test removed 2010 transitions
Reduce isomorphic transitions removed 2010 transitions.
Discarding 201 places :
Implicit places reduction removed 201 places
Iterating post reduction 4 with 2211 rules applied. Total rules applied 82833 place count 1208 transition count 1206
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 201 Pre rules applied. Total rules applied 82833 place count 1208 transition count 1005
Deduced a syphon composed of 201 places in 1 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 5 with 402 rules applied. Total rules applied 83235 place count 1007 transition count 1005
Free-agglomeration rule (complex) applied 201 times.
Iterating global reduction 5 with 201 rules applied. Total rules applied 83436 place count 1007 transition count 804
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 5 with 201 rules applied. Total rules applied 83637 place count 806 transition count 804
Reduce places removed 201 places and 201 transitions.
Iterating global reduction 6 with 201 rules applied. Total rules applied 83838 place count 605 transition count 603
Applied a total of 83838 rules in 3993 ms. Remains 605 /44838 variables (removed 44233) and now considering 603/47034 (removed 46431) transitions.
Finished structural reductions, in 1 iterations. Remains : 605/44838 places, 603/47034 transitions.
// Phase 1: matrix 603 rows 605 cols
[2022-05-16 14:00:29] [INFO ] Computed 2 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 1655 resets, run finished after 21887 ms. (steps per millisecond=45 ) properties (out of 1) seen :80
Finished Best-First random walk after 826172 steps, including 8 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=165 )
// Phase 1: matrix 603 rows 605 cols
[2022-05-16 14:00:56] [INFO ] Computed 2 place invariants in 12 ms
[2022-05-16 14:00:56] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 5 ms returned sat
[2022-05-16 14:00:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:00:56] [INFO ] [Real]Absence check using state equation in 174 ms returned unsat
Current structural bounds on expressions (after SMT) : [201] Max seen :[201]
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-04 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-04 in 52623 ms.
Starting property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-05
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 14:01:04] [INFO ] Computed 5834 place invariants in 7506 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 700 ms. (steps per millisecond=14 ) properties (out of 1) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 14:01:13] [INFO ] Computed 5834 place invariants in 8256 ms
Current structural bounds on expressions (after SMT) : [4601] Max seen :[33]
Support contains 201 out of 44838 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 44838/44838 places, 47034/47034 transitions.
Graph (complete) has 77386 edges and 44838 vertex of which 42222 are kept as prefixes of interest. Removing 2616 places using SCC suffix rule.21 ms
Discarding 2616 places :
Also discarding 1608 output transitions
Drop transitions removed 1608 transitions
Discarding 4221 places :
Implicit places reduction removed 4221 places
Drop transitions removed 21306 transitions
Trivial Post-agglo rules discarded 21306 transitions
Performed 21306 trivial Post agglomeration. Transition count delta: 21306
Iterating post reduction 0 with 25527 rules applied. Total rules applied 25528 place count 38001 transition count 24120
Reduce places removed 21306 places and 0 transitions.
Iterating post reduction 1 with 21306 rules applied. Total rules applied 46834 place count 16695 transition count 24120
Performed 6432 Post agglomeration using F-continuation condition.Transition count delta: 6432
Deduced a syphon composed of 6432 places in 5 ms
Reduce places removed 6432 places and 0 transitions.
Iterating global reduction 2 with 12864 rules applied. Total rules applied 59698 place count 10263 transition count 17688
Discarding 8040 places :
Symmetric choice reduction at 2 with 8040 rule applications. Total rules 67738 place count 2223 transition count 9648
Ensure Unique test removed 402 places
Iterating global reduction 2 with 8442 rules applied. Total rules applied 76180 place count 1821 transition count 9648
Ensure Unique test removed 4020 transitions
Reduce isomorphic transitions removed 4020 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 2 with 4221 rules applied. Total rules applied 80401 place count 1821 transition count 5427
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 3 with 201 rules applied. Total rules applied 80602 place count 1620 transition count 5427
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 201 Pre rules applied. Total rules applied 80602 place count 1620 transition count 5226
Deduced a syphon composed of 201 places in 2 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 4 with 402 rules applied. Total rules applied 81004 place count 1419 transition count 5226
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 81014 place count 1409 transition count 3216
Iterating global reduction 4 with 10 rules applied. Total rules applied 81024 place count 1409 transition count 3216
Ensure Unique test removed 2010 transitions
Reduce isomorphic transitions removed 2010 transitions.
Discarding 201 places :
Implicit places reduction removed 201 places
Iterating post reduction 4 with 2211 rules applied. Total rules applied 83235 place count 1208 transition count 1206
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 201 Pre rules applied. Total rules applied 83235 place count 1208 transition count 1005
Deduced a syphon composed of 201 places in 0 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 5 with 402 rules applied. Total rules applied 83637 place count 1007 transition count 1005
Free-agglomeration rule (complex) applied 201 times.
Iterating global reduction 5 with 201 rules applied. Total rules applied 83838 place count 1007 transition count 804
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 5 with 201 rules applied. Total rules applied 84039 place count 806 transition count 804
Reduce places removed 201 places and 201 transitions.
Iterating global reduction 6 with 201 rules applied. Total rules applied 84240 place count 605 transition count 603
Applied a total of 84240 rules in 4010 ms. Remains 605 /44838 variables (removed 44233) and now considering 603/47034 (removed 46431) transitions.
Finished structural reductions, in 1 iterations. Remains : 605/44838 places, 603/47034 transitions.
// Phase 1: matrix 603 rows 605 cols
[2022-05-16 14:01:22] [INFO ] Computed 2 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 1655 resets, run finished after 21976 ms. (steps per millisecond=45 ) properties (out of 1) seen :79
Finished Best-First random walk after 797178 steps, including 7 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=159 )
// Phase 1: matrix 603 rows 605 cols
[2022-05-16 14:01:49] [INFO ] Computed 2 place invariants in 17 ms
[2022-05-16 14:01:49] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 6 ms returned sat
[2022-05-16 14:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:01:49] [INFO ] [Real]Absence check using state equation in 178 ms returned unsat
Current structural bounds on expressions (after SMT) : [201] Max seen :[201]
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-05 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-05 in 52889 ms.
Starting property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-06
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 14:01:58] [INFO ] Computed 5834 place invariants in 8744 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 660 ms. (steps per millisecond=15 ) properties (out of 1) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 14:02:07] [INFO ] Computed 5834 place invariants in 8006 ms
Current structural bounds on expressions (after SMT) : [9202] Max seen :[32]
Support contains 201 out of 44838 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 44838/44838 places, 47034/47034 transitions.
Graph (complete) has 77386 edges and 44838 vertex of which 42222 are kept as prefixes of interest. Removing 2616 places using SCC suffix rule.22 ms
Discarding 2616 places :
Also discarding 1608 output transitions
Drop transitions removed 1608 transitions
Discarding 4221 places :
Implicit places reduction removed 4221 places
Drop transitions removed 21306 transitions
Trivial Post-agglo rules discarded 21306 transitions
Performed 21306 trivial Post agglomeration. Transition count delta: 21306
Iterating post reduction 0 with 25527 rules applied. Total rules applied 25528 place count 38001 transition count 24120
Reduce places removed 21306 places and 0 transitions.
Iterating post reduction 1 with 21306 rules applied. Total rules applied 46834 place count 16695 transition count 24120
Performed 6432 Post agglomeration using F-continuation condition.Transition count delta: 6432
Deduced a syphon composed of 6432 places in 5 ms
Reduce places removed 6432 places and 0 transitions.
Iterating global reduction 2 with 12864 rules applied. Total rules applied 59698 place count 10263 transition count 17688
Discarding 8040 places :
Symmetric choice reduction at 2 with 8040 rule applications. Total rules 67738 place count 2223 transition count 9648
Ensure Unique test removed 402 places
Iterating global reduction 2 with 8442 rules applied. Total rules applied 76180 place count 1821 transition count 9648
Ensure Unique test removed 4020 transitions
Reduce isomorphic transitions removed 4020 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 2 with 4221 rules applied. Total rules applied 80401 place count 1821 transition count 5427
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 3 with 201 rules applied. Total rules applied 80602 place count 1620 transition count 5427
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 201 Pre rules applied. Total rules applied 80602 place count 1620 transition count 5226
Deduced a syphon composed of 201 places in 1 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 4 with 402 rules applied. Total rules applied 81004 place count 1419 transition count 5226
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 81014 place count 1409 transition count 3216
Iterating global reduction 4 with 10 rules applied. Total rules applied 81024 place count 1409 transition count 3216
Ensure Unique test removed 2010 transitions
Reduce isomorphic transitions removed 2010 transitions.
Discarding 201 places :
Implicit places reduction removed 201 places
Iterating post reduction 4 with 2211 rules applied. Total rules applied 83235 place count 1208 transition count 1206
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 201 Pre rules applied. Total rules applied 83235 place count 1208 transition count 1005
Deduced a syphon composed of 201 places in 0 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 5 with 402 rules applied. Total rules applied 83637 place count 1007 transition count 1005
Free-agglomeration rule (complex) applied 201 times.
Iterating global reduction 5 with 201 rules applied. Total rules applied 83838 place count 1007 transition count 804
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 5 with 201 rules applied. Total rules applied 84039 place count 806 transition count 804
Reduce places removed 201 places and 201 transitions.
Iterating global reduction 6 with 201 rules applied. Total rules applied 84240 place count 605 transition count 603
Applied a total of 84240 rules in 3928 ms. Remains 605 /44838 variables (removed 44233) and now considering 603/47034 (removed 46431) transitions.
Finished structural reductions, in 1 iterations. Remains : 605/44838 places, 603/47034 transitions.
// Phase 1: matrix 603 rows 605 cols
[2022-05-16 14:02:16] [INFO ] Computed 2 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 1655 resets, run finished after 21755 ms. (steps per millisecond=45 ) properties (out of 1) seen :77
Finished Best-First random walk after 820920 steps, including 8 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=164 )
// Phase 1: matrix 603 rows 605 cols
[2022-05-16 14:02:42] [INFO ] Computed 2 place invariants in 12 ms
[2022-05-16 14:02:42] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 5 ms returned sat
[2022-05-16 14:02:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:02:43] [INFO ] [Real]Absence check using state equation in 174 ms returned unsat
Current structural bounds on expressions (after SMT) : [201] Max seen :[201]
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-06 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-06 in 53526 ms.
Starting property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-07
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 14:02:51] [INFO ] Computed 5834 place invariants in 8133 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 670 ms. (steps per millisecond=14 ) properties (out of 1) seen :46
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 14:02:59] [INFO ] Computed 5834 place invariants in 7841 ms
Current structural bounds on expressions (after SMT) : [9202] Max seen :[46]
Support contains 201 out of 44838 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 44838/44838 places, 47034/47034 transitions.
Graph (complete) has 77386 edges and 44838 vertex of which 43428 are kept as prefixes of interest. Removing 1410 places using SCC suffix rule.21 ms
Discarding 1410 places :
Also discarding 1005 output transitions
Drop transitions removed 1005 transitions
Discarding 4221 places :
Implicit places reduction removed 4221 places
Drop transitions removed 21306 transitions
Trivial Post-agglo rules discarded 21306 transitions
Performed 21306 trivial Post agglomeration. Transition count delta: 21306
Iterating post reduction 0 with 25527 rules applied. Total rules applied 25528 place count 39207 transition count 24723
Reduce places removed 21306 places and 0 transitions.
Iterating post reduction 1 with 21306 rules applied. Total rules applied 46834 place count 17901 transition count 24723
Performed 402 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 402 Pre rules applied. Total rules applied 46834 place count 17901 transition count 24321
Deduced a syphon composed of 402 places in 6 ms
Ensure Unique test removed 402 places
Reduce places removed 804 places and 0 transitions.
Iterating global reduction 2 with 1206 rules applied. Total rules applied 48040 place count 17097 transition count 24321
Discarding 201 places :
Implicit places reduction removed 201 places
Iterating post reduction 2 with 201 rules applied. Total rules applied 48241 place count 16896 transition count 24321
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 48241 place count 16896 transition count 24120
Deduced a syphon composed of 201 places in 6 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 48643 place count 16695 transition count 24120
Performed 6432 Post agglomeration using F-continuation condition.Transition count delta: 6432
Deduced a syphon composed of 6432 places in 6 ms
Reduce places removed 6432 places and 0 transitions.
Iterating global reduction 3 with 12864 rules applied. Total rules applied 61507 place count 10263 transition count 17688
Discarding 8040 places :
Symmetric choice reduction at 3 with 8040 rule applications. Total rules 69547 place count 2223 transition count 9648
Ensure Unique test removed 402 places
Iterating global reduction 3 with 8442 rules applied. Total rules applied 77989 place count 1821 transition count 9648
Ensure Unique test removed 4020 transitions
Reduce isomorphic transitions removed 4020 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 3 with 4221 rules applied. Total rules applied 82210 place count 1821 transition count 5427
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 4 with 201 rules applied. Total rules applied 82411 place count 1620 transition count 5427
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 201 Pre rules applied. Total rules applied 82411 place count 1620 transition count 5226
Deduced a syphon composed of 201 places in 1 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 5 with 402 rules applied. Total rules applied 82813 place count 1419 transition count 5226
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 82823 place count 1409 transition count 3216
Iterating global reduction 5 with 10 rules applied. Total rules applied 82833 place count 1409 transition count 3216
Ensure Unique test removed 2010 transitions
Reduce isomorphic transitions removed 2010 transitions.
Discarding 201 places :
Implicit places reduction removed 201 places
Iterating post reduction 5 with 2211 rules applied. Total rules applied 85044 place count 1208 transition count 1206
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 201 Pre rules applied. Total rules applied 85044 place count 1208 transition count 1005
Deduced a syphon composed of 201 places in 0 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 6 with 402 rules applied. Total rules applied 85446 place count 1007 transition count 1005
Free-agglomeration rule (complex) applied 201 times.
Iterating global reduction 6 with 201 rules applied. Total rules applied 85647 place count 1007 transition count 804
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 6 with 201 rules applied. Total rules applied 85848 place count 806 transition count 804
Reduce places removed 201 places and 201 transitions.
Iterating global reduction 7 with 201 rules applied. Total rules applied 86049 place count 605 transition count 603
Applied a total of 86049 rules in 4453 ms. Remains 605 /44838 variables (removed 44233) and now considering 603/47034 (removed 46431) transitions.
Finished structural reductions, in 1 iterations. Remains : 605/44838 places, 603/47034 transitions.
// Phase 1: matrix 603 rows 605 cols
[2022-05-16 14:03:09] [INFO ] Computed 2 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 1655 resets, run finished after 21930 ms. (steps per millisecond=45 ) properties (out of 1) seen :78
Finished Best-First random walk after 819910 steps, including 8 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=163 )
// Phase 1: matrix 603 rows 605 cols
[2022-05-16 14:03:36] [INFO ] Computed 2 place invariants in 15 ms
[2022-05-16 14:03:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 6 ms returned sat
[2022-05-16 14:03:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:03:36] [INFO ] [Real]Absence check using state equation in 175 ms returned unsat
Current structural bounds on expressions (after SMT) : [201] Max seen :[201]
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-07 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-07 in 53465 ms.
Starting property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-08
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 14:03:44] [INFO ] Computed 5834 place invariants in 7652 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 665 ms. (steps per millisecond=15 ) properties (out of 1) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 14:03:52] [INFO ] Computed 5834 place invariants in 7674 ms
Current structural bounds on expressions (after SMT) : [4601] Max seen :[21]
Support contains 201 out of 44838 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 44838/44838 places, 47034/47034 transitions.
Graph (complete) has 77386 edges and 44838 vertex of which 43831 are kept as prefixes of interest. Removing 1007 places using SCC suffix rule.21 ms
Discarding 1007 places :
Also discarding 603 output transitions
Drop transitions removed 603 transitions
Discarding 4221 places :
Implicit places reduction removed 4221 places
Drop transitions removed 21306 transitions
Trivial Post-agglo rules discarded 21306 transitions
Performed 21306 trivial Post agglomeration. Transition count delta: 21306
Iterating post reduction 0 with 25527 rules applied. Total rules applied 25528 place count 39610 transition count 25125
Reduce places removed 21306 places and 0 transitions.
Iterating post reduction 1 with 21306 rules applied. Total rules applied 46834 place count 18304 transition count 25125
Performed 603 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 603 Pre rules applied. Total rules applied 46834 place count 18304 transition count 24522
Deduced a syphon composed of 603 places in 7 ms
Ensure Unique test removed 603 places
Reduce places removed 1206 places and 0 transitions.
Iterating global reduction 2 with 1809 rules applied. Total rules applied 48643 place count 17098 transition count 24522
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 2 with 201 rules applied. Total rules applied 48844 place count 17098 transition count 24321
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 3 with 201 rules applied. Total rules applied 49045 place count 16897 transition count 24321
Performed 6633 Post agglomeration using F-continuation condition.Transition count delta: 6633
Deduced a syphon composed of 6633 places in 6 ms
Reduce places removed 6633 places and 0 transitions.
Iterating global reduction 4 with 13266 rules applied. Total rules applied 62311 place count 10264 transition count 17688
Discarding 8040 places :
Symmetric choice reduction at 4 with 8040 rule applications. Total rules 70351 place count 2224 transition count 9648
Ensure Unique test removed 402 places
Iterating global reduction 4 with 8442 rules applied. Total rules applied 78793 place count 1822 transition count 9648
Ensure Unique test removed 4020 transitions
Reduce isomorphic transitions removed 4020 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 4 with 4221 rules applied. Total rules applied 83014 place count 1822 transition count 5427
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 5 with 201 rules applied. Total rules applied 83215 place count 1621 transition count 5427
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 83225 place count 1611 transition count 3417
Iterating global reduction 6 with 10 rules applied. Total rules applied 83235 place count 1611 transition count 3417
Ensure Unique test removed 2010 transitions
Reduce isomorphic transitions removed 2010 transitions.
Discarding 201 places :
Implicit places reduction removed 201 places
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 6 with 2412 rules applied. Total rules applied 85647 place count 1410 transition count 1206
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 7 with 201 rules applied. Total rules applied 85848 place count 1209 transition count 1206
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 201 Pre rules applied. Total rules applied 85848 place count 1209 transition count 1005
Deduced a syphon composed of 201 places in 0 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 8 with 402 rules applied. Total rules applied 86250 place count 1008 transition count 1005
Reduce places removed 201 places and 201 transitions.
Iterating global reduction 8 with 201 rules applied. Total rules applied 86451 place count 807 transition count 804
Applied a total of 86451 rules in 4497 ms. Remains 807 /44838 variables (removed 44031) and now considering 804/47034 (removed 46230) transitions.
Finished structural reductions, in 1 iterations. Remains : 807/44838 places, 804/47034 transitions.
// Phase 1: matrix 804 rows 807 cols
[2022-05-16 14:04:02] [INFO ] Computed 3 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 1242 resets, run finished after 25163 ms. (steps per millisecond=39 ) properties (out of 1) seen :67
Finished Best-First random walk after 794966 steps, including 5 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=158 )
// Phase 1: matrix 804 rows 807 cols
[2022-05-16 14:04:32] [INFO ] Computed 3 place invariants in 21 ms
[2022-05-16 14:04:32] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 8 ms returned sat
[2022-05-16 14:04:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:04:32] [INFO ] [Real]Absence check using state equation in 411 ms returned unsat
Current structural bounds on expressions (after SMT) : [201] Max seen :[201]
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-08 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-08 in 56361 ms.
Starting property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-09
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 14:04:41] [INFO ] Computed 5834 place invariants in 8756 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1431 ms. (steps per millisecond=6 ) properties (out of 1) seen :117
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 741 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 14:04:51] [INFO ] Computed 5834 place invariants in 7830 ms
Current structural bounds on expressions (after SMT) : [3978663] Max seen :[117]
Support contains 4221 out of 44838 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 44838/44838 places, 47034/47034 transitions.
Graph (complete) has 77386 edges and 44838 vertex of which 29949 are kept as prefixes of interest. Removing 14889 places using SCC suffix rule.19 ms
Discarding 14889 places :
Also discarding 17487 output transitions
Drop transitions removed 17487 transitions
Drop transitions removed 8442 transitions
Trivial Post-agglo rules discarded 8442 transitions
Performed 8442 trivial Post agglomeration. Transition count delta: 8442
Iterating post reduction 0 with 8442 rules applied. Total rules applied 8443 place count 29949 transition count 21105
Reduce places removed 8442 places and 0 transitions.
Iterating post reduction 1 with 8442 rules applied. Total rules applied 16885 place count 21507 transition count 21105
Performed 4221 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4221 Pre rules applied. Total rules applied 16885 place count 21507 transition count 16884
Deduced a syphon composed of 4221 places in 3 ms
Ensure Unique test removed 4221 places
Reduce places removed 8442 places and 0 transitions.
Iterating global reduction 2 with 12663 rules applied. Total rules applied 29548 place count 13065 transition count 16884
Free-agglomeration rule (complex) applied 4221 times.
Iterating global reduction 2 with 4221 rules applied. Total rules applied 33769 place count 13065 transition count 12663
Reduce places removed 4221 places and 0 transitions.
Iterating post reduction 2 with 4221 rules applied. Total rules applied 37990 place count 8844 transition count 12663
Applied a total of 37990 rules in 8589 ms. Remains 8844 /44838 variables (removed 35994) and now considering 12663/47034 (removed 34371) transitions.
Finished structural reductions, in 1 iterations. Remains : 8844/44838 places, 12663/47034 transitions.
// Phase 1: matrix 12663 rows 8844 cols
[2022-05-16 14:05:05] [INFO ] Computed 201 place invariants in 68 ms
Finished random walk after 236838 steps, including 392 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=7 )
Finished Best-First random walk after 69273 steps, including 0 resets, run visited all 1 properties in 5053 ms. (steps per millisecond=13 )
// Phase 1: matrix 12663 rows 8844 cols
[2022-05-16 14:05:40] [INFO ] Computed 201 place invariants in 65 ms
[2022-05-16 14:05:41] [INFO ] [Real]Absence check using 0 positive and 201 generalized place invariants in 166 ms returned sat
[2022-05-16 14:05:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:05:53] [INFO ] [Real]Absence check using state equation in 11876 ms returned unknown
Current structural bounds on expressions (after SMT) : [3978663] Max seen :[117]
Support contains 4221 out of 8844 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8844/8844 places, 12663/12663 transitions.
Applied a total of 0 rules in 612 ms. Remains 8844 /8844 variables (removed 0) and now considering 12663/12663 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8844/8844 places, 12663/12663 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8844/8844 places, 12663/12663 transitions.
Applied a total of 0 rules in 612 ms. Remains 8844 /8844 variables (removed 0) and now considering 12663/12663 (removed 0) transitions.
// Phase 1: matrix 12663 rows 8844 cols
[2022-05-16 14:05:54] [INFO ] Computed 201 place invariants in 63 ms
[2022-05-16 14:05:55] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 14:05:55] [INFO ] Implicit Places using invariants in 891 ms returned []
Implicit Place search using SMT only with invariants took 893 ms to find 0 implicit places.
// Phase 1: matrix 12663 rows 8844 cols
[2022-05-16 14:05:55] [INFO ] Computed 201 place invariants in 61 ms
[2022-05-16 14:05:56] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 14:05:56] [INFO ] Dead Transitions using invariants and state equation in 883 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8844/8844 places, 12663/12663 transitions.
Ending property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-09 in 83823 ms.
Starting property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-10
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 14:06:06] [INFO ] Computed 5834 place invariants in 9581 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1426 ms. (steps per millisecond=7 ) properties (out of 1) seen :89
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 741 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 14:06:17] [INFO ] Computed 5834 place invariants in 9341 ms
Current structural bounds on expressions (after SMT) : [96621] Max seen :[89]
Support contains 4221 out of 44838 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 44838/44838 places, 47034/47034 transitions.
Graph (complete) has 77386 edges and 44838 vertex of which 8844 are kept as prefixes of interest. Removing 35994 places using SCC suffix rule.16 ms
Discarding 35994 places :
Also discarding 34371 output transitions
Drop transitions removed 34371 transitions
Applied a total of 1 rules in 862 ms. Remains 8844 /44838 variables (removed 35994) and now considering 12663/47034 (removed 34371) transitions.
Finished structural reductions, in 1 iterations. Remains : 8844/44838 places, 12663/47034 transitions.
// Phase 1: matrix 12663 rows 8844 cols
[2022-05-16 14:06:23] [INFO ] Computed 201 place invariants in 66 ms
Finished random walk after 237708 steps, including 393 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=7 )
Finished Best-First random walk after 69273 steps, including 0 resets, run visited all 1 properties in 5029 ms. (steps per millisecond=13 )
// Phase 1: matrix 12663 rows 8844 cols
[2022-05-16 14:06:59] [INFO ] Computed 201 place invariants in 67 ms
[2022-05-16 14:07:00] [INFO ] [Real]Absence check using 0 positive and 201 generalized place invariants in 166 ms returned sat
[2022-05-16 14:07:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:07:12] [INFO ] [Real]Absence check using state equation in 12792 ms returned sat
[2022-05-16 14:07:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 14:07:14] [INFO ] [Nat]Absence check using 0 positive and 201 generalized place invariants in 174 ms returned sat
[2022-05-16 14:07:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 14:07:25] [INFO ] [Nat]Absence check using state equation in 11203 ms returned sat
[2022-05-16 14:07:26] [INFO ] Computed and/alt/rep : 4221/4221/4221 causal constraints (skipped 4221 transitions) in 595 ms.
[2022-05-16 14:07:37] [INFO ] Added : 84 causal constraints over 17 iterations in 11662 ms. Result :sat
Current structural bounds on expressions (after SMT) : [96621] Max seen :[98]
Support contains 4221 out of 8844 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8844/8844 places, 12663/12663 transitions.
Applied a total of 0 rules in 620 ms. Remains 8844 /8844 variables (removed 0) and now considering 12663/12663 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8844/8844 places, 12663/12663 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8844/8844 places, 12663/12663 transitions.
Applied a total of 0 rules in 627 ms. Remains 8844 /8844 variables (removed 0) and now considering 12663/12663 (removed 0) transitions.
// Phase 1: matrix 12663 rows 8844 cols
[2022-05-16 14:07:43] [INFO ] Computed 201 place invariants in 67 ms
[2022-05-16 14:07:44] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 14:07:44] [INFO ] Implicit Places using invariants in 895 ms returned []
Implicit Place search using SMT only with invariants took 896 ms to find 0 implicit places.
// Phase 1: matrix 12663 rows 8844 cols
[2022-05-16 14:07:44] [INFO ] Computed 201 place invariants in 61 ms
[2022-05-16 14:07:44] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 14:07:45] [INFO ] Dead Transitions using invariants and state equation in 895 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8844/8844 places, 12663/12663 transitions.
// Phase 1: matrix 12663 rows 8844 cols
[2022-05-16 14:07:45] [INFO ] Computed 201 place invariants in 65 ms
Finished random walk after 236971 steps, including 392 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=7 )
Finished Best-First random walk after 69273 steps, including 0 resets, run visited all 1 properties in 5004 ms. (steps per millisecond=13 )
// Phase 1: matrix 12663 rows 8844 cols
[2022-05-16 14:08:20] [INFO ] Computed 201 place invariants in 65 ms
[2022-05-16 14:08:21] [INFO ] [Real]Absence check using 0 positive and 201 generalized place invariants in 166 ms returned sat
[2022-05-16 14:08:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:08:34] [INFO ] [Real]Absence check using state equation in 13524 ms returned unknown
Current structural bounds on expressions (after SMT) : [96621] Max seen :[137]
Support contains 4221 out of 8844 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8844/8844 places, 12663/12663 transitions.
Applied a total of 0 rules in 633 ms. Remains 8844 /8844 variables (removed 0) and now considering 12663/12663 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8844/8844 places, 12663/12663 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8844/8844 places, 12663/12663 transitions.
Applied a total of 0 rules in 630 ms. Remains 8844 /8844 variables (removed 0) and now considering 12663/12663 (removed 0) transitions.
// Phase 1: matrix 12663 rows 8844 cols
[2022-05-16 14:08:36] [INFO ] Computed 201 place invariants in 64 ms
[2022-05-16 14:08:36] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 14:08:36] [INFO ] Implicit Places using invariants in 895 ms returned []
Implicit Place search using SMT only with invariants took 896 ms to find 0 implicit places.
// Phase 1: matrix 12663 rows 8844 cols
[2022-05-16 14:08:37] [INFO ] Computed 201 place invariants in 65 ms
[2022-05-16 14:08:37] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 14:08:37] [INFO ] Dead Transitions using invariants and state equation in 901 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8844/8844 places, 12663/12663 transitions.
Ending property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-10 in 161382 ms.
Starting property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-11
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 14:08:46] [INFO ] Computed 5834 place invariants in 8846 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1465 ms. (steps per millisecond=6 ) properties (out of 1) seen :46
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 764 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 14:08:59] [INFO ] Computed 5834 place invariants in 10370 ms
Current structural bounds on expressions (after SMT) : [85211461] Max seen :[46]
Support contains 4221 out of 44838 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 44838/44838 places, 47034/47034 transitions.
Graph (complete) has 77386 edges and 44838 vertex of which 29949 are kept as prefixes of interest. Removing 14889 places using SCC suffix rule.20 ms
Discarding 14889 places :
Also discarding 17487 output transitions
Drop transitions removed 17487 transitions
Discarding 4221 places :
Implicit places reduction removed 4221 places
Drop transitions removed 12663 transitions
Trivial Post-agglo rules discarded 12663 transitions
Performed 12663 trivial Post agglomeration. Transition count delta: 12663
Iterating post reduction 0 with 16884 rules applied. Total rules applied 16885 place count 25728 transition count 16884
Reduce places removed 12663 places and 0 transitions.
Iterating post reduction 1 with 12663 rules applied. Total rules applied 29548 place count 13065 transition count 16884
Free-agglomeration rule (complex) applied 4221 times.
Iterating global reduction 2 with 4221 rules applied. Total rules applied 33769 place count 13065 transition count 12663
Reduce places removed 4221 places and 0 transitions.
Iterating post reduction 2 with 4221 rules applied. Total rules applied 37990 place count 8844 transition count 12663
Applied a total of 37990 rules in 6674 ms. Remains 8844 /44838 variables (removed 35994) and now considering 12663/47034 (removed 34371) transitions.
Finished structural reductions, in 1 iterations. Remains : 8844/44838 places, 12663/47034 transitions.
// Phase 1: matrix 12663 rows 8844 cols
[2022-05-16 14:09:11] [INFO ] Computed 201 place invariants in 67 ms
Finished random walk after 233899 steps, including 387 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=7 )
Finished Best-First random walk after 69273 steps, including 0 resets, run visited all 1 properties in 5029 ms. (steps per millisecond=13 )
// Phase 1: matrix 12663 rows 8844 cols
[2022-05-16 14:09:46] [INFO ] Computed 201 place invariants in 72 ms
[2022-05-16 14:09:47] [INFO ] [Real]Absence check using 0 positive and 201 generalized place invariants in 172 ms returned sat
[2022-05-16 14:09:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:10:01] [INFO ] [Real]Absence check using state equation in 14280 ms returned sat
[2022-05-16 14:10:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 14:10:03] [INFO ] [Nat]Absence check using 0 positive and 201 generalized place invariants in 172 ms returned sat
[2022-05-16 14:10:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 14:10:17] [INFO ] [Nat]Absence check using state equation in 14604 ms returned sat
[2022-05-16 14:10:18] [INFO ] Computed and/alt/rep : 4221/4221/4221 causal constraints (skipped 4221 transitions) in 551 ms.
[2022-05-16 14:10:29] [INFO ] Added : 80 causal constraints over 16 iterations in 11014 ms. Result :sat
Current structural bounds on expressions (after SMT) : [85211461] Max seen :[100]
Support contains 4221 out of 8844 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8844/8844 places, 12663/12663 transitions.
Applied a total of 0 rules in 632 ms. Remains 8844 /8844 variables (removed 0) and now considering 12663/12663 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8844/8844 places, 12663/12663 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8844/8844 places, 12663/12663 transitions.
Applied a total of 0 rules in 626 ms. Remains 8844 /8844 variables (removed 0) and now considering 12663/12663 (removed 0) transitions.
// Phase 1: matrix 12663 rows 8844 cols
[2022-05-16 14:10:35] [INFO ] Computed 201 place invariants in 70 ms
[2022-05-16 14:10:36] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 14:10:36] [INFO ] Implicit Places using invariants in 925 ms returned []
Implicit Place search using SMT only with invariants took 927 ms to find 0 implicit places.
// Phase 1: matrix 12663 rows 8844 cols
[2022-05-16 14:10:36] [INFO ] Computed 201 place invariants in 69 ms
[2022-05-16 14:10:37] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 14:10:37] [INFO ] Dead Transitions using invariants and state equation in 918 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8844/8844 places, 12663/12663 transitions.
// Phase 1: matrix 12663 rows 8844 cols
[2022-05-16 14:10:37] [INFO ] Computed 201 place invariants in 73 ms
Finished random walk after 236467 steps, including 391 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=7 )
Finished Best-First random walk after 68273 steps, including 0 resets, run visited all 1 properties in 5019 ms. (steps per millisecond=13 )
// Phase 1: matrix 12663 rows 8844 cols
[2022-05-16 14:11:12] [INFO ] Computed 201 place invariants in 67 ms
[2022-05-16 14:11:13] [INFO ] [Real]Absence check using 0 positive and 201 generalized place invariants in 169 ms returned sat
[2022-05-16 14:11:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:11:28] [INFO ] [Real]Absence check using state equation in 14558 ms returned unknown
Current structural bounds on expressions (after SMT) : [85211461] Max seen :[143]
Support contains 4221 out of 8844 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8844/8844 places, 12663/12663 transitions.
Applied a total of 0 rules in 636 ms. Remains 8844 /8844 variables (removed 0) and now considering 12663/12663 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8844/8844 places, 12663/12663 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8844/8844 places, 12663/12663 transitions.
Applied a total of 0 rules in 616 ms. Remains 8844 /8844 variables (removed 0) and now considering 12663/12663 (removed 0) transitions.
// Phase 1: matrix 12663 rows 8844 cols
[2022-05-16 14:11:29] [INFO ] Computed 201 place invariants in 72 ms
[2022-05-16 14:11:30] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 14:11:30] [INFO ] Implicit Places using invariants in 911 ms returned []
Implicit Place search using SMT only with invariants took 912 ms to find 0 implicit places.
// Phase 1: matrix 12663 rows 8844 cols
[2022-05-16 14:11:30] [INFO ] Computed 201 place invariants in 59 ms
[2022-05-16 14:11:31] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 14:11:31] [INFO ] Dead Transitions using invariants and state equation in 905 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8844/8844 places, 12663/12663 transitions.
Ending property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-11 in 173392 ms.
Starting property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-12
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 14:11:40] [INFO ] Computed 5834 place invariants in 9425 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1087 ms. (steps per millisecond=9 ) properties (out of 1) seen :38
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 1) seen :0
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 14:11:55] [INFO ] Computed 5834 place invariants in 13407 ms
Current structural bounds on expressions (after SMT) : [50611] Max seen :[38]
Support contains 2211 out of 44838 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 44838/44838 places, 47034/47034 transitions.
Graph (complete) has 77386 edges and 44838 vertex of which 34573 are kept as prefixes of interest. Removing 10265 places using SCC suffix rule.21 ms
Discarding 10265 places :
Also discarding 10854 output transitions
Drop transitions removed 10854 transitions
Discarding 4221 places :
Implicit places reduction removed 4221 places
Drop transitions removed 16884 transitions
Trivial Post-agglo rules discarded 16884 transitions
Performed 16884 trivial Post agglomeration. Transition count delta: 16884
Iterating post reduction 0 with 21105 rules applied. Total rules applied 21106 place count 30352 transition count 19296
Reduce places removed 16884 places and 0 transitions.
Iterating post reduction 1 with 16884 rules applied. Total rules applied 37990 place count 13468 transition count 19296
Performed 4221 Post agglomeration using F-continuation condition.Transition count delta: 4221
Deduced a syphon composed of 4221 places in 3 ms
Reduce places removed 4221 places and 0 transitions.
Iterating global reduction 2 with 8442 rules applied. Total rules applied 46432 place count 9247 transition count 15075
Discarding 4020 places :
Symmetric choice reduction at 2 with 4020 rule applications. Total rules 50452 place count 5227 transition count 11055
Ensure Unique test removed 201 places
Iterating global reduction 2 with 4221 rules applied. Total rules applied 54673 place count 5026 transition count 11055
Ensure Unique test removed 4020 transitions
Reduce isomorphic transitions removed 4020 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 2 with 4221 rules applied. Total rules applied 58894 place count 5026 transition count 6834
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 3 with 201 rules applied. Total rules applied 59095 place count 4825 transition count 6834
Free-agglomeration rule (complex) applied 2211 times.
Iterating global reduction 4 with 2211 rules applied. Total rules applied 61306 place count 4825 transition count 4623
Reduce places removed 2211 places and 0 transitions.
Iterating post reduction 4 with 2211 rules applied. Total rules applied 63517 place count 2614 transition count 4623
Reduce places removed 201 places and 201 transitions.
Iterating global reduction 5 with 201 rules applied. Total rules applied 63718 place count 2413 transition count 4422
Applied a total of 63718 rules in 3912 ms. Remains 2413 /44838 variables (removed 42425) and now considering 4422/47034 (removed 42612) transitions.
Finished structural reductions, in 1 iterations. Remains : 2413/44838 places, 4422/47034 transitions.
// Phase 1: matrix 4422 rows 2413 cols
[2022-05-16 14:12:04] [INFO ] Computed 1 place invariants in 71 ms
Finished random walk after 354565 steps, including 879 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=11 )
Finished Best-First random walk after 128637 steps, including 0 resets, run visited all 1 properties in 5007 ms. (steps per millisecond=25 )
// Phase 1: matrix 4422 rows 2413 cols
[2022-05-16 14:12:39] [INFO ] Computed 1 place invariants in 70 ms
[2022-05-16 14:12:40] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 19 ms returned sat
[2022-05-16 14:12:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:12:42] [INFO ] [Real]Absence check using state equation in 2278 ms returned sat
[2022-05-16 14:12:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 14:12:42] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 19 ms returned sat
[2022-05-16 14:12:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 14:12:45] [INFO ] [Nat]Absence check using state equation in 2285 ms returned sat
[2022-05-16 14:12:45] [INFO ] Computed and/alt/rep : 2211/2211/2211 causal constraints (skipped 0 transitions) in 185 ms.
[2022-05-16 14:12:46] [INFO ] Added : 21 causal constraints over 5 iterations in 1172 ms. Result :sat
Current structural bounds on expressions (after SMT) : [50611] Max seen :[178]
Support contains 2211 out of 2413 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2413/2413 places, 4422/4422 transitions.
Applied a total of 0 rules in 19 ms. Remains 2413 /2413 variables (removed 0) and now considering 4422/4422 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2413/2413 places, 4422/4422 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2413/2413 places, 4422/4422 transitions.
Applied a total of 0 rules in 18 ms. Remains 2413 /2413 variables (removed 0) and now considering 4422/4422 (removed 0) transitions.
// Phase 1: matrix 4422 rows 2413 cols
[2022-05-16 14:12:48] [INFO ] Computed 1 place invariants in 64 ms
[2022-05-16 14:12:49] [INFO ] Implicit Places using invariants in 1215 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1224 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 2412/2413 places, 4422/4422 transitions.
Applied a total of 0 rules in 19 ms. Remains 2412 /2412 variables (removed 0) and now considering 4422/4422 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2412/2413 places, 4422/4422 transitions.
// Phase 1: matrix 4422 rows 2412 cols
[2022-05-16 14:12:49] [INFO ] Computed 0 place invariants in 11 ms
Finished random walk after 355137 steps, including 881 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=11 )
Finished Best-First random walk after 130690 steps, including 0 resets, run visited all 1 properties in 5018 ms. (steps per millisecond=26 )
// Phase 1: matrix 4422 rows 2412 cols
[2022-05-16 14:13:24] [INFO ] Computed 0 place invariants in 11 ms
[2022-05-16 14:13:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:13:27] [INFO ] [Real]Absence check using state equation in 2379 ms returned sat
[2022-05-16 14:13:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 14:13:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 14:13:29] [INFO ] [Nat]Absence check using state equation in 2383 ms returned sat
[2022-05-16 14:13:30] [INFO ] Computed and/alt/rep : 2211/2211/2211 causal constraints (skipped 0 transitions) in 179 ms.
[2022-05-16 14:13:30] [INFO ] Added : 8 causal constraints over 2 iterations in 726 ms. Result :sat
Current structural bounds on expressions (after SMT) : [50611] Max seen :[192]
Support contains 2211 out of 2412 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2412/2412 places, 4422/4422 transitions.
Applied a total of 0 rules in 17 ms. Remains 2412 /2412 variables (removed 0) and now considering 4422/4422 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2412/2412 places, 4422/4422 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2412/2412 places, 4422/4422 transitions.
Applied a total of 0 rules in 17 ms. Remains 2412 /2412 variables (removed 0) and now considering 4422/4422 (removed 0) transitions.
// Phase 1: matrix 4422 rows 2412 cols
[2022-05-16 14:13:32] [INFO ] Computed 0 place invariants in 10 ms
[2022-05-16 14:13:32] [INFO ] Implicit Places using invariants in 203 ms returned []
// Phase 1: matrix 4422 rows 2412 cols
[2022-05-16 14:13:32] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-16 14:13:32] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
[2022-05-16 14:13:33] [INFO ] Redundant transitions in 347 ms returned []
// Phase 1: matrix 4422 rows 2412 cols
[2022-05-16 14:13:33] [INFO ] Computed 0 place invariants in 6 ms
[2022-05-16 14:13:34] [INFO ] Dead Transitions using invariants and state equation in 1656 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2412/2412 places, 4422/4422 transitions.
// Phase 1: matrix 4422 rows 2412 cols
[2022-05-16 14:13:35] [INFO ] Computed 0 place invariants in 5 ms
Finished random walk after 365036 steps, including 905 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=12 )
Finished Best-First random walk after 130169 steps, including 0 resets, run visited all 1 properties in 5004 ms. (steps per millisecond=26 )
// Phase 1: matrix 4422 rows 2412 cols
[2022-05-16 14:14:10] [INFO ] Computed 0 place invariants in 11 ms
[2022-05-16 14:14:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:14:12] [INFO ] [Real]Absence check using state equation in 2481 ms returned sat
[2022-05-16 14:14:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 14:14:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 14:14:15] [INFO ] [Nat]Absence check using state equation in 2502 ms returned sat
[2022-05-16 14:14:15] [INFO ] Computed and/alt/rep : 2211/2211/2211 causal constraints (skipped 0 transitions) in 176 ms.
[2022-05-16 14:14:16] [INFO ] Added : 3 causal constraints over 1 iterations in 572 ms. Result :sat
Current structural bounds on expressions (after SMT) : [50611] Max seen :[197]
Support contains 2211 out of 2412 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2412/2412 places, 4422/4422 transitions.
Applied a total of 0 rules in 18 ms. Remains 2412 /2412 variables (removed 0) and now considering 4422/4422 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2412/2412 places, 4422/4422 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2412/2412 places, 4422/4422 transitions.
Applied a total of 0 rules in 18 ms. Remains 2412 /2412 variables (removed 0) and now considering 4422/4422 (removed 0) transitions.
// Phase 1: matrix 4422 rows 2412 cols
[2022-05-16 14:14:17] [INFO ] Computed 0 place invariants in 9 ms
[2022-05-16 14:14:17] [INFO ] Implicit Places using invariants in 197 ms returned []
// Phase 1: matrix 4422 rows 2412 cols
[2022-05-16 14:14:17] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-16 14:14:18] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
[2022-05-16 14:14:18] [INFO ] Redundant transitions in 226 ms returned []
// Phase 1: matrix 4422 rows 2412 cols
[2022-05-16 14:14:18] [INFO ] Computed 0 place invariants in 6 ms
[2022-05-16 14:14:20] [INFO ] Dead Transitions using invariants and state equation in 1685 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2412/2412 places, 4422/4422 transitions.
// Phase 1: matrix 4422 rows 2412 cols
[2022-05-16 14:14:20] [INFO ] Computed 0 place invariants in 8 ms
Finished random walk after 364352 steps, including 904 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=12 )
Finished Best-First random walk after 130169 steps, including 0 resets, run visited all 1 properties in 5005 ms. (steps per millisecond=26 )
// Phase 1: matrix 4422 rows 2412 cols
[2022-05-16 14:14:55] [INFO ] Computed 0 place invariants in 10 ms
[2022-05-16 14:14:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:14:58] [INFO ] [Real]Absence check using state equation in 2493 ms returned sat
[2022-05-16 14:14:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 14:14:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 14:15:01] [INFO ] [Nat]Absence check using state equation in 2592 ms returned sat
[2022-05-16 14:15:01] [INFO ] Computed and/alt/rep : 2211/2211/2211 causal constraints (skipped 0 transitions) in 191 ms.
[2022-05-16 14:15:01] [INFO ] Added : 0 causal constraints over 0 iterations in 459 ms. Result :sat
Current structural bounds on expressions (after SMT) : [50611] Max seen :[200]
Support contains 2211 out of 2412 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2412/2412 places, 4422/4422 transitions.
Applied a total of 0 rules in 18 ms. Remains 2412 /2412 variables (removed 0) and now considering 4422/4422 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2412/2412 places, 4422/4422 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2412/2412 places, 4422/4422 transitions.
Applied a total of 0 rules in 18 ms. Remains 2412 /2412 variables (removed 0) and now considering 4422/4422 (removed 0) transitions.
// Phase 1: matrix 4422 rows 2412 cols
[2022-05-16 14:15:03] [INFO ] Computed 0 place invariants in 7 ms
[2022-05-16 14:15:03] [INFO ] Implicit Places using invariants in 212 ms returned []
// Phase 1: matrix 4422 rows 2412 cols
[2022-05-16 14:15:03] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-16 14:15:04] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
[2022-05-16 14:15:04] [INFO ] Redundant transitions in 142 ms returned []
// Phase 1: matrix 4422 rows 2412 cols
[2022-05-16 14:15:04] [INFO ] Computed 0 place invariants in 10 ms
[2022-05-16 14:15:06] [INFO ] Dead Transitions using invariants and state equation in 1745 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2412/2412 places, 4422/4422 transitions.
// Phase 1: matrix 4422 rows 2412 cols
[2022-05-16 14:15:06] [INFO ] Computed 0 place invariants in 8 ms
Finished random walk after 354822 steps, including 880 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=11 )
Finished Best-First random walk after 127095 steps, including 0 resets, run visited all 1 properties in 5039 ms. (steps per millisecond=25 )
// Phase 1: matrix 4422 rows 2412 cols
[2022-05-16 14:15:41] [INFO ] Computed 0 place invariants in 10 ms
[2022-05-16 14:15:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:15:43] [INFO ] [Real]Absence check using state equation in 2592 ms returned unsat
Current structural bounds on expressions (after SMT) : [201] Max seen :[201]
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-12 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-12 in 252505 ms.
Starting property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-13
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 14:15:57] [INFO ] Computed 5834 place invariants in 13794 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 728 ms. (steps per millisecond=13 ) properties (out of 1) seen :114
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 1) seen :0
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 14:16:12] [INFO ] Computed 5834 place invariants in 13552 ms
Current structural bounds on expressions (after SMT) : [202444] Max seen :[114]
Support contains 201 out of 44838 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 44838/44838 places, 47034/47034 transitions.
Graph (complete) has 77386 edges and 44838 vertex of which 39196 are kept as prefixes of interest. Removing 5642 places using SCC suffix rule.22 ms
Discarding 5642 places :
Also discarding 6432 output transitions
Drop transitions removed 6432 transitions
Discarding 4221 places :
Implicit places reduction removed 4221 places
Drop transitions removed 21306 transitions
Trivial Post-agglo rules discarded 21306 transitions
Performed 21306 trivial Post agglomeration. Transition count delta: 21306
Iterating post reduction 0 with 25527 rules applied. Total rules applied 25528 place count 34975 transition count 19296
Reduce places removed 21306 places and 0 transitions.
Iterating post reduction 1 with 21306 rules applied. Total rules applied 46834 place count 13669 transition count 19296
Performed 2211 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2211 Pre rules applied. Total rules applied 46834 place count 13669 transition count 17085
Deduced a syphon composed of 2211 places in 3 ms
Reduce places removed 2211 places and 0 transitions.
Iterating global reduction 2 with 4422 rules applied. Total rules applied 51256 place count 11458 transition count 17085
Performed 4221 Post agglomeration using F-continuation condition.Transition count delta: 4221
Deduced a syphon composed of 4221 places in 3 ms
Reduce places removed 4221 places and 0 transitions.
Iterating global reduction 2 with 8442 rules applied. Total rules applied 59698 place count 7237 transition count 12864
Discarding 6030 places :
Symmetric choice reduction at 2 with 6030 rule applications. Total rules 65728 place count 1207 transition count 6834
Ensure Unique test removed 402 places
Iterating global reduction 2 with 6432 rules applied. Total rules applied 72160 place count 805 transition count 6834
Ensure Unique test removed 6030 transitions
Reduce isomorphic transitions removed 6030 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 2 with 6231 rules applied. Total rules applied 78391 place count 805 transition count 603
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 3 with 201 rules applied. Total rules applied 78592 place count 604 transition count 603
Reduce places removed 201 places and 201 transitions.
Iterating global reduction 4 with 201 rules applied. Total rules applied 78793 place count 403 transition count 402
Applied a total of 78793 rules in 3142 ms. Remains 403 /44838 variables (removed 44435) and now considering 402/47034 (removed 46632) transitions.
Finished structural reductions, in 1 iterations. Remains : 403/44838 places, 402/47034 transitions.
// Phase 1: matrix 402 rows 403 cols
[2022-05-16 14:16:20] [INFO ] Computed 1 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2481 resets, run finished after 16020 ms. (steps per millisecond=62 ) properties (out of 1) seen :103
Finished Best-First random walk after 820410 steps, including 13 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=164 )
// Phase 1: matrix 402 rows 403 cols
[2022-05-16 14:16:41] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-16 14:16:41] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-16 14:16:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:16:41] [INFO ] [Real]Absence check using state equation in 116 ms returned unsat
Current structural bounds on expressions (after SMT) : [201] Max seen :[201]
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-13 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-13 in 57594 ms.
Starting property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-14
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 14:16:53] [INFO ] Computed 5834 place invariants in 12345 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 649 ms. (steps per millisecond=15 ) properties (out of 1) seen :50
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 14:17:05] [INFO ] Computed 5834 place invariants in 10635 ms
Current structural bounds on expressions (after SMT) : [4601] Max seen :[50]
Support contains 201 out of 44838 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 44838/44838 places, 47034/47034 transitions.
Graph (complete) has 77386 edges and 44838 vertex of which 43428 are kept as prefixes of interest. Removing 1410 places using SCC suffix rule.22 ms
Discarding 1410 places :
Also discarding 1005 output transitions
Drop transitions removed 1005 transitions
Discarding 4221 places :
Implicit places reduction removed 4221 places
Drop transitions removed 21306 transitions
Trivial Post-agglo rules discarded 21306 transitions
Performed 21306 trivial Post agglomeration. Transition count delta: 21306
Iterating post reduction 0 with 25527 rules applied. Total rules applied 25528 place count 39207 transition count 24723
Reduce places removed 21306 places and 0 transitions.
Iterating post reduction 1 with 21306 rules applied. Total rules applied 46834 place count 17901 transition count 24723
Performed 402 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 402 Pre rules applied. Total rules applied 46834 place count 17901 transition count 24321
Deduced a syphon composed of 402 places in 6 ms
Ensure Unique test removed 402 places
Reduce places removed 804 places and 0 transitions.
Iterating global reduction 2 with 1206 rules applied. Total rules applied 48040 place count 17097 transition count 24321
Discarding 201 places :
Implicit places reduction removed 201 places
Iterating post reduction 2 with 201 rules applied. Total rules applied 48241 place count 16896 transition count 24321
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 48241 place count 16896 transition count 24120
Deduced a syphon composed of 201 places in 6 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 48643 place count 16695 transition count 24120
Performed 6432 Post agglomeration using F-continuation condition.Transition count delta: 6432
Deduced a syphon composed of 6432 places in 6 ms
Reduce places removed 6432 places and 0 transitions.
Iterating global reduction 3 with 12864 rules applied. Total rules applied 61507 place count 10263 transition count 17688
Discarding 8040 places :
Symmetric choice reduction at 3 with 8040 rule applications. Total rules 69547 place count 2223 transition count 9648
Ensure Unique test removed 402 places
Iterating global reduction 3 with 8442 rules applied. Total rules applied 77989 place count 1821 transition count 9648
Ensure Unique test removed 4020 transitions
Reduce isomorphic transitions removed 4020 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 3 with 4221 rules applied. Total rules applied 82210 place count 1821 transition count 5427
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 4 with 201 rules applied. Total rules applied 82411 place count 1620 transition count 5427
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 201 Pre rules applied. Total rules applied 82411 place count 1620 transition count 5226
Deduced a syphon composed of 201 places in 2 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 5 with 402 rules applied. Total rules applied 82813 place count 1419 transition count 5226
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 82823 place count 1409 transition count 3216
Iterating global reduction 5 with 10 rules applied. Total rules applied 82833 place count 1409 transition count 3216
Ensure Unique test removed 2010 transitions
Reduce isomorphic transitions removed 2010 transitions.
Discarding 201 places :
Implicit places reduction removed 201 places
Iterating post reduction 5 with 2211 rules applied. Total rules applied 85044 place count 1208 transition count 1206
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 201 Pre rules applied. Total rules applied 85044 place count 1208 transition count 1005
Deduced a syphon composed of 201 places in 0 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 6 with 402 rules applied. Total rules applied 85446 place count 1007 transition count 1005
Free-agglomeration rule (complex) applied 201 times.
Iterating global reduction 6 with 201 rules applied. Total rules applied 85647 place count 1007 transition count 804
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 6 with 201 rules applied. Total rules applied 85848 place count 806 transition count 804
Reduce places removed 201 places and 201 transitions.
Iterating global reduction 7 with 201 rules applied. Total rules applied 86049 place count 605 transition count 603
Applied a total of 86049 rules in 4493 ms. Remains 605 /44838 variables (removed 44233) and now considering 603/47034 (removed 46431) transitions.
Finished structural reductions, in 1 iterations. Remains : 605/44838 places, 603/47034 transitions.
// Phase 1: matrix 603 rows 605 cols
[2022-05-16 14:17:14] [INFO ] Computed 2 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 1655 resets, run finished after 21916 ms. (steps per millisecond=45 ) properties (out of 1) seen :81
Finished Best-First random walk after 807871 steps, including 7 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=161 )
// Phase 1: matrix 603 rows 605 cols
[2022-05-16 14:17:41] [INFO ] Computed 2 place invariants in 11 ms
[2022-05-16 14:17:41] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 6 ms returned sat
[2022-05-16 14:17:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:17:42] [INFO ] [Real]Absence check using state equation in 178 ms returned unsat
Current structural bounds on expressions (after SMT) : [201] Max seen :[201]
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-14 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-14 in 60471 ms.
Starting property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-15
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 14:17:50] [INFO ] Computed 5834 place invariants in 8309 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1438 ms. (steps per millisecond=6 ) properties (out of 1) seen :58
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 752 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
// Phase 1: matrix 47034 rows 44838 cols
[2022-05-16 14:18:04] [INFO ] Computed 5834 place invariants in 11697 ms
Current structural bounds on expressions (after SMT) : [96621] Max seen :[58]
Support contains 4221 out of 44838 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 44838/44838 places, 47034/47034 transitions.
Graph (complete) has 77386 edges and 44838 vertex of which 21507 are kept as prefixes of interest. Removing 23331 places using SCC suffix rule.19 ms
Discarding 23331 places :
Also discarding 21708 output transitions
Drop transitions removed 21708 transitions
Drop transitions removed 8442 transitions
Trivial Post-agglo rules discarded 8442 transitions
Performed 8442 trivial Post agglomeration. Transition count delta: 8442
Iterating post reduction 0 with 8442 rules applied. Total rules applied 8443 place count 21507 transition count 16884
Reduce places removed 8442 places and 0 transitions.
Iterating post reduction 1 with 8442 rules applied. Total rules applied 16885 place count 13065 transition count 16884
Free-agglomeration rule (complex) applied 4221 times.
Iterating global reduction 2 with 4221 rules applied. Total rules applied 21106 place count 13065 transition count 12663
Reduce places removed 4221 places and 0 transitions.
Iterating post reduction 2 with 4221 rules applied. Total rules applied 25327 place count 8844 transition count 12663
Applied a total of 25327 rules in 6334 ms. Remains 8844 /44838 variables (removed 35994) and now considering 12663/47034 (removed 34371) transitions.
Finished structural reductions, in 1 iterations. Remains : 8844/44838 places, 12663/47034 transitions.
// Phase 1: matrix 12663 rows 8844 cols
[2022-05-16 14:18:15] [INFO ] Computed 201 place invariants in 64 ms
Finished random walk after 235002 steps, including 389 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=7 )
Finished Best-First random walk after 69273 steps, including 0 resets, run visited all 1 properties in 5052 ms. (steps per millisecond=13 )
// Phase 1: matrix 12663 rows 8844 cols
[2022-05-16 14:18:51] [INFO ] Computed 201 place invariants in 67 ms
[2022-05-16 14:18:51] [INFO ] [Real]Absence check using 0 positive and 201 generalized place invariants in 167 ms returned sat
[2022-05-16 14:18:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:19:03] [INFO ] [Real]Absence check using state equation in 11735 ms returned sat
[2022-05-16 14:19:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 14:19:05] [INFO ] [Nat]Absence check using 0 positive and 201 generalized place invariants in 174 ms returned sat
[2022-05-16 14:19:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 14:19:17] [INFO ] [Nat]Absence check using state equation in 12155 ms returned sat
[2022-05-16 14:19:18] [INFO ] Computed and/alt/rep : 4221/4221/4221 causal constraints (skipped 4221 transitions) in 545 ms.
[2022-05-16 14:19:29] [INFO ] Added : 82 causal constraints over 17 iterations in 11704 ms. Result :sat
Current structural bounds on expressions (after SMT) : [96621] Max seen :[100]
Support contains 4221 out of 8844 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8844/8844 places, 12663/12663 transitions.
Applied a total of 0 rules in 605 ms. Remains 8844 /8844 variables (removed 0) and now considering 12663/12663 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8844/8844 places, 12663/12663 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8844/8844 places, 12663/12663 transitions.
Applied a total of 0 rules in 629 ms. Remains 8844 /8844 variables (removed 0) and now considering 12663/12663 (removed 0) transitions.
// Phase 1: matrix 12663 rows 8844 cols
[2022-05-16 14:19:35] [INFO ] Computed 201 place invariants in 65 ms
[2022-05-16 14:19:36] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 14:19:36] [INFO ] Implicit Places using invariants in 907 ms returned []
Implicit Place search using SMT only with invariants took 914 ms to find 0 implicit places.
// Phase 1: matrix 12663 rows 8844 cols
[2022-05-16 14:19:36] [INFO ] Computed 201 place invariants in 62 ms
[2022-05-16 14:19:37] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 14:19:37] [INFO ] Dead Transitions using invariants and state equation in 898 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8844/8844 places, 12663/12663 transitions.
// Phase 1: matrix 12663 rows 8844 cols
[2022-05-16 14:19:37] [INFO ] Computed 201 place invariants in 69 ms
Finished random walk after 236239 steps, including 391 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=7 )
Finished Best-First random walk after 69273 steps, including 0 resets, run visited all 1 properties in 5034 ms. (steps per millisecond=13 )
// Phase 1: matrix 12663 rows 8844 cols
[2022-05-16 14:20:12] [INFO ] Computed 201 place invariants in 69 ms
[2022-05-16 14:20:13] [INFO ] [Real]Absence check using 0 positive and 201 generalized place invariants in 166 ms returned sat
[2022-05-16 14:20:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:20:26] [INFO ] [Real]Absence check using state equation in 13366 ms returned unknown
Current structural bounds on expressions (after SMT) : [96621] Max seen :[143]
Support contains 4221 out of 8844 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8844/8844 places, 12663/12663 transitions.
Applied a total of 0 rules in 616 ms. Remains 8844 /8844 variables (removed 0) and now considering 12663/12663 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8844/8844 places, 12663/12663 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8844/8844 places, 12663/12663 transitions.
Applied a total of 0 rules in 623 ms. Remains 8844 /8844 variables (removed 0) and now considering 12663/12663 (removed 0) transitions.
// Phase 1: matrix 12663 rows 8844 cols
[2022-05-16 14:20:28] [INFO ] Computed 201 place invariants in 65 ms
[2022-05-16 14:20:29] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 14:20:29] [INFO ] Implicit Places using invariants in 906 ms returned []
Implicit Place search using SMT only with invariants took 917 ms to find 0 implicit places.
// Phase 1: matrix 12663 rows 8844 cols
[2022-05-16 14:20:29] [INFO ] Computed 201 place invariants in 60 ms
[2022-05-16 14:20:29] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 14:20:30] [INFO ] Dead Transitions using invariants and state equation in 895 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8844/8844 places, 12663/12663 transitions.
Ending property specific reduction for FamilyReunion-COL-L00200M0020C010P010G005-UpperBounds-15 in 168218 ms.
[2022-05-16 14:20:32] [INFO ] Flatten gal took : 1895 ms
[2022-05-16 14:20:33] [INFO ] Applying decomposition
[2022-05-16 14:20:34] [INFO ] Flatten gal took : 1436 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12834721072989665457.txt' '-o' '/tmp/graph12834721072989665457.bin' '-w' '/tmp/graph12834721072989665457.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12834721072989665457.bin' '-l' '-1' '-v' '-w' '/tmp/graph12834721072989665457.weights' '-q' '0' '-e' '0.001'
[2022-05-16 14:20:38] [INFO ] Decomposing Gal with order
[2022-05-16 14:20:50] [INFO ] Rewriting arrays to variables to allow decomposition.

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="FamilyReunion-COL-L00200M0020C010P010G005"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is FamilyReunion-COL-L00200M0020C010P010G005, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-165260110600653"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00200M0020C010P010G005.tgz
mv FamilyReunion-COL-L00200M0020C010P010G005 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;