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.r179-tall-165277027100295.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 gold2021
Input is PolyORBNT-COL-S10J40, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277027100295
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 9.4K Apr 30 03:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 30 03:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 30 03:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 30 03:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 93K May 10 09:34 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 PolyORBNT-COL-S10J40-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652837617934

Running Version 0
[2022-05-18 01:33:39] [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-18 01:33:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 01:33:39] [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.
[2022-05-18 01:33:39] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 01:33:39] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 586 ms
[2022-05-18 01:33:39] [INFO ] ms1 symmetric to ms4 in transition trans_489
[2022-05-18 01:33:39] [INFO ] ms4 symmetric to ms2 in transition trans_489
[2022-05-18 01:33:39] [INFO ] ms2 symmetric to ms3 in transition trans_489
[2022-05-18 01:33:39] [INFO ] ms1 symmetric to ms2 in transition trans_488
[2022-05-18 01:33:39] [INFO ] ms2 symmetric to ms3 in transition trans_488
[2022-05-18 01:33:39] [INFO ] ms1 symmetric to ms2 in transition trans_487
[2022-05-18 01:33:39] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 894 PT places and 12462.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2022-05-18 01:33:39] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions in 3 ms.
[2022-05-18 01:33:39] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_8029948943765273932.dot
// Phase 1: matrix 38 rows 48 cols
[2022-05-18 01:33:40] [INFO ] Computed 13 place invariants in 6 ms
FORMULA PolyORBNT-COL-S10J40-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J40-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2022-05-18 01:33:40] [INFO ] Unfolded HLPN to a Petri net with 894 places and 2270 transitions in 35 ms.
[2022-05-18 01:33:40] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2022-05-18 01:33:40] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-18 01:33:40] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-18 01:33:40] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:33:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:40] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-18 01:33:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:33:40] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:33:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:33:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:33:40] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:33:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:40] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-18 01:33:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-18 01:33:40] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 3 ms to minimize.
[2022-05-18 01:33:40] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2022-05-18 01:33:40] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2022-05-18 01:33:40] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
[2022-05-18 01:33:40] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 1 ms to minimize.
[2022-05-18 01:33:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 208 ms
[2022-05-18 01:33:40] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 01:33:40] [INFO ] Added : 33 causal constraints over 7 iterations in 150 ms. Result :sat
Minimization took 16 ms.
[2022-05-18 01:33:40] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:33:40] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:33:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:40] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-18 01:33:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:33:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:33:40] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:33:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:40] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-18 01:33:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 01:33:40] [INFO ] Deduced a trap composed of 14 places in 16 ms of which 0 ms to minimize.
[2022-05-18 01:33:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2022-05-18 01:33:40] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 01:33:41] [INFO ] Added : 21 causal constraints over 5 iterations in 250 ms. Result :sat
Minimization took 214 ms.
[2022-05-18 01:33:41] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:33:41] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:33:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:41] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-18 01:33:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:33:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:33:41] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:33:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:41] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2022-05-18 01:33:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:33:41] [INFO ] Deduced a trap composed of 14 places in 15 ms of which 1 ms to minimize.
[2022-05-18 01:33:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2022-05-18 01:33:41] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 01:33:41] [INFO ] Added : 18 causal constraints over 4 iterations in 22 ms. Result :sat
Minimization took 12 ms.
[2022-05-18 01:33:41] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:33:41] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:33:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:41] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-18 01:33:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:33:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:33:41] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:33:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:41] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-18 01:33:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:33:41] [INFO ] Deduced a trap composed of 14 places in 13 ms of which 0 ms to minimize.
[2022-05-18 01:33:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2022-05-18 01:33:41] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 01:33:41] [INFO ] Added : 15 causal constraints over 4 iterations in 23 ms. Result :sat
Minimization took 9 ms.
[2022-05-18 01:33:41] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:33:41] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:33:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:41] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-18 01:33:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:33:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:33:41] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:33:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:41] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-18 01:33:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 01:33:41] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 01:33:41] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2022-05-18 01:33:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2022-05-18 01:33:41] [INFO ] Added : 36 causal constraints over 8 iterations in 240 ms. Result :sat
Minimization took 24 ms.
[2022-05-18 01:33:41] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:33:41] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:33:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:41] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-18 01:33:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:33:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:33:41] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2022-05-18 01:33:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:41] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-18 01:33:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 01:33:41] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2022-05-18 01:33:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2022-05-18 01:33:41] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-18 01:33:42] [INFO ] Deduced a trap composed of 25 places in 17 ms of which 1 ms to minimize.
[2022-05-18 01:33:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2022-05-18 01:33:42] [INFO ] Added : 36 causal constraints over 8 iterations in 176 ms. Result :sat
Minimization took 50 ms.
[2022-05-18 01:33:42] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:33:42] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:33:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:42] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-18 01:33:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:33:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 14 ms returned sat
[2022-05-18 01:33:42] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:33:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:42] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-18 01:33:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:33:42] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 0 ms to minimize.
[2022-05-18 01:33:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2022-05-18 01:33:42] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 01:33:42] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2022-05-18 01:33:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 370 ms
[2022-05-18 01:33:42] [INFO ] Added : 36 causal constraints over 8 iterations in 441 ms. Result :sat
Minimization took 17 ms.
[2022-05-18 01:33:42] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:33:42] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:33:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:42] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-18 01:33:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:33:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:33:42] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:33:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:42] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-18 01:33:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2022-05-18 01:33:42] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2022-05-18 01:33:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2022-05-18 01:33:42] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 01:33:42] [INFO ] Added : 22 causal constraints over 5 iterations in 107 ms. Result :sat
Minimization took 52 ms.
[2022-05-18 01:33:43] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:33:43] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:33:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:43] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-05-18 01:33:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:33:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:33:43] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:33:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:43] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-18 01:33:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-18 01:33:43] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 01:33:43] [INFO ] Added : 36 causal constraints over 8 iterations in 69 ms. Result :sat
Minimization took 18 ms.
[2022-05-18 01:33:43] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-18 01:33:43] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:33:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:43] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-18 01:33:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:33:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2022-05-18 01:33:43] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:33:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:43] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-18 01:33:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:33:43] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2022-05-18 01:33:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2022-05-18 01:33:43] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-18 01:33:43] [INFO ] Added : 17 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 164 ms.
[2022-05-18 01:33:43] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:33:43] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:33:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:43] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-18 01:33:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:33:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:33:43] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:33:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:43] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-18 01:33:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:33:43] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 01:33:43] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2022-05-18 01:33:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2022-05-18 01:33:43] [INFO ] Added : 36 causal constraints over 8 iterations in 145 ms. Result :sat
Minimization took 15 ms.
[2022-05-18 01:33:43] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:33:43] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-18 01:33:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:43] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2022-05-18 01:33:43] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:33:43] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:33:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:43] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-18 01:33:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:33:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:33:43] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:33:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:43] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-18 01:33:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 01:33:43] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 01:33:44] [INFO ] Added : 33 causal constraints over 7 iterations in 40 ms. Result :sat
Minimization took 25 ms.
[2022-05-18 01:33:44] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:33:44] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-18 01:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:44] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-18 01:33:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:33:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:33:44] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:33:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:44] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-18 01:33:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:33:44] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
[2022-05-18 01:33:44] [INFO ] Deduced a trap composed of 14 places in 14 ms of which 0 ms to minimize.
[2022-05-18 01:33:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 42 ms
[2022-05-18 01:33:44] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 01:33:44] [INFO ] Added : 36 causal constraints over 8 iterations in 41 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [1, 10, 2, 1, -1, 10, -1, 3, -1, 10, -1, 10, 10, -1]
FORMULA PolyORBNT-COL-S10J40-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
[2022-05-18 01:33:44] [INFO ] Unfolded HLPN to a Petri net with 894 places and 2270 transitions in 14 ms.
[2022-05-18 01:33:44] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_11656315769427703126.dot
Deduced a syphon composed of 40 places in 15 ms
Reduce places removed 40 places and 40 transitions.
Incomplete random walk after 10000 steps, including 561 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 13) seen :13
FORMULA PolyORBNT-COL-S10J40-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :12
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :2
[2022-05-18 01:33:44] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 854 cols
[2022-05-18 01:33:45] [INFO ] Computed 112 place invariants in 166 ms
[2022-05-18 01:33:45] [INFO ] [Real]Absence check using 105 positive place invariants in 31 ms returned sat
[2022-05-18 01:33:45] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 7 ms returned unsat
[2022-05-18 01:33:45] [INFO ] [Real]Absence check using 105 positive place invariants in 28 ms returned sat
[2022-05-18 01:33:45] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned sat
[2022-05-18 01:33:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:45] [INFO ] [Real]Absence check using state equation in 565 ms returned sat
[2022-05-18 01:33:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:33:46] [INFO ] [Nat]Absence check using 105 positive place invariants in 31 ms returned sat
[2022-05-18 01:33:46] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 19 ms returned sat
[2022-05-18 01:33:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:47] [INFO ] [Nat]Absence check using state equation in 1150 ms returned sat
[2022-05-18 01:33:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:33:50] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 01:33:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 3717 ms returned unknown
[2022-05-18 01:33:51] [INFO ] [Real]Absence check using 105 positive place invariants in 30 ms returned sat
[2022-05-18 01:33:51] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned sat
[2022-05-18 01:33:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:51] [INFO ] [Real]Absence check using state equation in 561 ms returned sat
[2022-05-18 01:33:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:33:51] [INFO ] [Nat]Absence check using 105 positive place invariants in 30 ms returned sat
[2022-05-18 01:33:51] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned sat
[2022-05-18 01:33:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:52] [INFO ] [Nat]Absence check using state equation in 1006 ms returned sat
[2022-05-18 01:33:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 38 ms returned sat
[2022-05-18 01:33:53] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 253 ms.
[2022-05-18 01:33:53] [INFO ] Added : 7 causal constraints over 2 iterations in 580 ms. Result :sat
Minimization took 405 ms.
[2022-05-18 01:33:54] [INFO ] [Real]Absence check using 105 positive place invariants in 31 ms returned sat
[2022-05-18 01:33:54] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 16 ms returned unsat
[2022-05-18 01:33:54] [INFO ] [Real]Absence check using 105 positive place invariants in 28 ms returned sat
[2022-05-18 01:33:54] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned sat
[2022-05-18 01:33:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:54] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2022-05-18 01:33:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:33:54] [INFO ] [Nat]Absence check using 105 positive place invariants in 27 ms returned sat
[2022-05-18 01:33:54] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 16 ms returned sat
[2022-05-18 01:33:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:33:59] [INFO ] [Nat]Absence check using state equation in 4899 ms returned unknown
[2022-05-18 01:33:59] [INFO ] [Real]Absence check using 105 positive place invariants in 29 ms returned sat
[2022-05-18 01:34:00] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 16 ms returned sat
[2022-05-18 01:34:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:34:00] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2022-05-18 01:34:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:34:00] [INFO ] [Nat]Absence check using 105 positive place invariants in 26 ms returned sat
[2022-05-18 01:34:00] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned sat
[2022-05-18 01:34:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:34:02] [INFO ] [Nat]Absence check using state equation in 1287 ms returned sat
[2022-05-18 01:34:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 389 ms returned sat
[2022-05-18 01:34:03] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 492 ms.
[2022-05-18 01:34:04] [INFO ] Deduced a trap composed of 19 places in 354 ms of which 0 ms to minimize.
[2022-05-18 01:34:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 560 ms
[2022-05-18 01:34:05] [INFO ] Added : 42 causal constraints over 10 iterations in 2634 ms. Result :sat
Minimization took 492 ms.
[2022-05-18 01:34:05] [INFO ] [Real]Absence check using 105 positive place invariants in 30 ms returned sat
[2022-05-18 01:34:05] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned sat
[2022-05-18 01:34:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:34:06] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2022-05-18 01:34:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:34:06] [INFO ] [Nat]Absence check using 105 positive place invariants in 29 ms returned sat
[2022-05-18 01:34:06] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned sat
[2022-05-18 01:34:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:34:07] [INFO ] [Nat]Absence check using state equation in 860 ms returned sat
[2022-05-18 01:34:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 51 ms returned sat
[2022-05-18 01:34:07] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 165 ms.
[2022-05-18 01:34:08] [INFO ] Deduced a trap composed of 457 places in 548 ms of which 1 ms to minimize.
[2022-05-18 01:34:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 808 ms
[2022-05-18 01:34:08] [INFO ] Added : 13 causal constraints over 3 iterations in 1432 ms. Result :sat
Minimization took 861 ms.
[2022-05-18 01:34:10] [INFO ] [Real]Absence check using 105 positive place invariants in 28 ms returned sat
[2022-05-18 01:34:10] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned unsat
[2022-05-18 01:34:10] [INFO ] [Real]Absence check using 105 positive place invariants in 29 ms returned sat
[2022-05-18 01:34:10] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 19 ms returned sat
[2022-05-18 01:34:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:34:10] [INFO ] [Real]Absence check using state equation in 495 ms returned sat
[2022-05-18 01:34:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:34:10] [INFO ] [Nat]Absence check using 105 positive place invariants in 31 ms returned sat
[2022-05-18 01:34:10] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned sat
[2022-05-18 01:34:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:34:12] [INFO ] [Nat]Absence check using state equation in 1284 ms returned sat
[2022-05-18 01:34:15] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 01:34:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 3597 ms returned unknown
[2022-05-18 01:34:15] [INFO ] [Real]Absence check using 105 positive place invariants in 28 ms returned sat
[2022-05-18 01:34:15] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned sat
[2022-05-18 01:34:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:34:16] [INFO ] [Real]Absence check using state equation in 538 ms returned sat
[2022-05-18 01:34:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:34:16] [INFO ] [Nat]Absence check using 105 positive place invariants in 29 ms returned sat
[2022-05-18 01:34:16] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 21 ms returned sat
[2022-05-18 01:34:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:34:17] [INFO ] [Nat]Absence check using state equation in 860 ms returned sat
[2022-05-18 01:34:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-18 01:34:17] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 154 ms.
[2022-05-18 01:34:19] [INFO ] Deduced a trap composed of 19 places in 542 ms of which 1 ms to minimize.
[2022-05-18 01:34:20] [INFO ] Deduced a trap composed of 221 places in 443 ms of which 1 ms to minimize.
[2022-05-18 01:34:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1762 ms
[2022-05-18 01:34:20] [INFO ] Added : 39 causal constraints over 9 iterations in 3219 ms. Result :sat
Minimization took 677 ms.
[2022-05-18 01:34:21] [INFO ] [Real]Absence check using 105 positive place invariants in 29 ms returned sat
[2022-05-18 01:34:21] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 16 ms returned sat
[2022-05-18 01:34:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:34:22] [INFO ] [Real]Absence check using state equation in 554 ms returned sat
[2022-05-18 01:34:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:34:22] [INFO ] [Nat]Absence check using 105 positive place invariants in 29 ms returned sat
[2022-05-18 01:34:22] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 9 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 2, 1, 1, 10, 2147483647, 3, 1, 10, 2147483647, 1] Max seen :[4, 0, 0, 1, 4, 0, 0, 1, 1, 0, 1]
FORMULA PolyORBNT-COL-S10J40-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 16200 steps, including 941 resets, run finished after 176 ms. (steps per millisecond=92 ) properties (out of 7) seen :4 could not realise parikh vector
FORMULA PolyORBNT-COL-S10J40-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 3300 steps, including 213 resets, run finished after 42 ms. (steps per millisecond=78 ) properties (out of 6) seen :8 could not realise parikh vector
FORMULA PolyORBNT-COL-S10J40-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 1400 steps, including 93 resets, run finished after 15 ms. (steps per millisecond=93 ) properties (out of 4) seen :2 could not realise parikh vector
Support contains 4 out of 854 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 844 transition count 2187
Reduce places removed 43 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 97 place count 801 transition count 2186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 800 transition count 2186
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 98 place count 800 transition count 2141
Deduced a syphon composed of 45 places in 2 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 188 place count 755 transition count 2141
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 192 place count 753 transition count 2139
Applied a total of 192 rules in 356 ms. Remains 753 /854 variables (removed 101) and now considering 2139/2230 (removed 91) transitions.
[2022-05-18 01:34:22] [INFO ] Flow matrix only has 2130 transitions (discarded 9 similar events)
// Phase 1: matrix 2130 rows 753 cols
[2022-05-18 01:34:23] [INFO ] Computed 102 place invariants in 132 ms
[2022-05-18 01:34:23] [INFO ] Dead Transitions using invariants and state equation in 1037 ms returned [713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 754, 755, 756, 757, 758, 760, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 789, 790, 791, 792, 793, 795, 798, 799, 800, 801, 802, 803, 805, 808, 812, 813, 814, 815, 816, 817, 818, 819, 820, 821, 822, 823, 824, 825, 826, 827, 828, 829, 830, 831, 832, 833, 834, 835, 836, 837, 838, 839, 840, 841, 842, 843, 845, 846, 847, 848, 849, 851, 854, 855, 856, 857, 858, 859, 861, 864, 868, 869, 870, 871, 872, 873, 874, 876, 879, 883, 888, 889, 890, 891, 892, 893, 894, 895, 896, 897, 898, 899, 900, 901, 902, 903, 904, 905, 906, 907, 908, 909, 910, 911, 912, 913, 914, 915, 916, 917, 918, 919, 920, 921, 922, 923, 924, 925, 926, 927, 929, 930, 931, 932, 933, 935, 938, 939, 940, 941, 942, 943, 945, 948, 952, 953, 954, 955, 956, 957, 958, 960, 963, 967, 972, 973, 974, 975, 976, 977, 978, 979, 981, 984, 988, 993, 999, 1000, 1001, 1002, 1003, 1004, 1005, 1006, 1007, 1008, 1009, 1010, 1011, 1012, 1013, 1014, 1015, 1016, 1017, 1018, 1019, 1020, 1021, 1022, 1023, 1024, 1025, 1026, 1027, 1028, 1029, 1030, 1031, 1032, 1033, 1034, 1035, 1036, 1037, 1038, 1039, 1040, 1041, 1042, 1043, 1044, 1045, 1046, 1047, 1049, 1050, 1051, 1052, 1053, 1055, 1058, 1059, 1060, 1061, 1062, 1063, 1065, 1068, 1072, 1073, 1074, 1075, 1076, 1077, 1078, 1080, 1083, 1087, 1092, 1093, 1094, 1095, 1096, 1097, 1098, 1099, 1101, 1104, 1108, 1113, 1119, 1120, 1121, 1122, 1123, 1124, 1125, 1126, 1127, 1129, 1132, 1136, 1141, 1147, 1154, 1155, 1156, 1157, 1158, 1159, 1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1179, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1188, 1189, 1190, 1191, 1192, 1193, 1194, 1195, 1196, 1197, 1198, 1199, 1200, 1201, 1202, 1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1211, 1212, 1214, 1215, 1216, 1217, 1218, 1220, 1223, 1224, 1225, 1226, 1227, 1228, 1230, 1233, 1237, 1238, 1239, 1240, 1241, 1242, 1243, 1245, 1248, 1252, 1257, 1258, 1259, 1260, 1261, 1262, 1263, 1264, 1266, 1269, 1273, 1278, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1294, 1297, 1301, 1306, 1312, 1319, 1320, 1321, 1322, 1323, 1324, 1325, 1326, 1327, 1328, 1330, 1333, 1337, 1342, 1348, 1355, 1363, 1364, 1365, 1366, 1367, 1368, 1369, 1370, 1371, 1372, 1373, 1374, 1375, 1376, 1377, 1378, 1379, 1380, 1381, 1382, 1383, 1384, 1385, 1386, 1387, 1388, 1389, 1390, 1391, 1392, 1393, 1394, 1395, 1396, 1397, 1398, 1399, 1400, 1401, 1402, 1403, 1404, 1405, 1406, 1407, 1408, 1409, 1410, 1411, 1412, 1413, 1414, 1415, 1416, 1417, 1418, 1419, 1420, 1421, 1422, 1423, 1424, 1425, 1426, 1427, 1428, 1429, 1430, 1431, 1432, 1434, 1435, 1436, 1437, 1438, 1440, 1443, 1444, 1445, 1446, 1447, 1448, 1450, 1453, 1457, 1458, 1459, 1460, 1461, 1462, 1463, 1465, 1468, 1472, 1477, 1478, 1479, 1480, 1481, 1482, 1483, 1484, 1486, 1489, 1493, 1498, 1504, 1505, 1506, 1507, 1508, 1509, 1510, 1511, 1512, 1514, 1517, 1521, 1526, 1532, 1539, 1540, 1541, 1542, 1543, 1544, 1545, 1546, 1547, 1548, 1550, 1553, 1557, 1562, 1568, 1575, 1583, 1584, 1585, 1586, 1587, 1588, 1589, 1590, 1591, 1592, 1593, 1595, 1598, 1602, 1607, 1613, 1620, 1628, 1637, 1638, 1639, 1640, 1641, 1642, 1643, 1644, 1645, 1646, 1647, 1648, 1650, 1653, 1657, 1662, 1668, 1675, 1683, 1692, 1702]
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions :[1702, 1692, 1683, 1675, 1668, 1662, 1657, 1653, 1650, 1648, 1647, 1646, 1645, 1644, 1643, 1642, 1641, 1640, 1639, 1638, 1637, 1628, 1620, 1613, 1607, 1602, 1598, 1595, 1593, 1592, 1591, 1590, 1589, 1588, 1587, 1586, 1585, 1584, 1583, 1575, 1568, 1562, 1557, 1553, 1550, 1548, 1547, 1546, 1545, 1544, 1543, 1542, 1541, 1540, 1539, 1532, 1526, 1521, 1517, 1514, 1512, 1511, 1510, 1509, 1508, 1507, 1506, 1505, 1504, 1498, 1493, 1489, 1486, 1484, 1483, 1482, 1481, 1480, 1479, 1478, 1477, 1472, 1468, 1465, 1463, 1462, 1461, 1460, 1459, 1458, 1457, 1453, 1450, 1448, 1447, 1446, 1445, 1444, 1443, 1440, 1438, 1437, 1436, 1435, 1434, 1432, 1431, 1430, 1429, 1428, 1427, 1426, 1425, 1424, 1423, 1422, 1421, 1420, 1419, 1418, 1417, 1416, 1415, 1414, 1413, 1412, 1411, 1410, 1409, 1408, 1407, 1406, 1405, 1404, 1403, 1402, 1401, 1400, 1399, 1398, 1397, 1396, 1395, 1394, 1393, 1392, 1391, 1390, 1389, 1388, 1387, 1386, 1385, 1384, 1383, 1382, 1381, 1380, 1379, 1378, 1377, 1376, 1375, 1374, 1373, 1372, 1371, 1370, 1369, 1368, 1367, 1366, 1365, 1364, 1363, 1355, 1348, 1342, 1337, 1333, 1330, 1328, 1327, 1326, 1325, 1324, 1323, 1322, 1321, 1320, 1319, 1312, 1306, 1301, 1297, 1294, 1292, 1291, 1290, 1289, 1288, 1287, 1286, 1285, 1284, 1278, 1273, 1269, 1266, 1264, 1263, 1262, 1261, 1260, 1259, 1258, 1257, 1252, 1248, 1245, 1243, 1242, 1241, 1240, 1239, 1238, 1237, 1233, 1230, 1228, 1227, 1226, 1225, 1224, 1223, 1220, 1218, 1217, 1216, 1215, 1214, 1212, 1211, 1210, 1209, 1208, 1207, 1206, 1205, 1204, 1203, 1202, 1201, 1200, 1199, 1198, 1197, 1196, 1195, 1194, 1193, 1192, 1191, 1190, 1189, 1188, 1187, 1186, 1185, 1184, 1183, 1182, 1181, 1180, 1179, 1178, 1177, 1176, 1175, 1174, 1173, 1172, 1171, 1170, 1169, 1168, 1167, 1166, 1165, 1164, 1163, 1162, 1161, 1160, 1159, 1158, 1157, 1156, 1155, 1154, 1147, 1141, 1136, 1132, 1129, 1127, 1126, 1125, 1124, 1123, 1122, 1121, 1120, 1119, 1113, 1108, 1104, 1101, 1099, 1098, 1097, 1096, 1095, 1094, 1093, 1092, 1087, 1083, 1080, 1078, 1077, 1076, 1075, 1074, 1073, 1072, 1068, 1065, 1063, 1062, 1061, 1060, 1059, 1058, 1055, 1053, 1052, 1051, 1050, 1049, 1047, 1046, 1045, 1044, 1043, 1042, 1041, 1040, 1039, 1038, 1037, 1036, 1035, 1034, 1033, 1032, 1031, 1030, 1029, 1028, 1027, 1026, 1025, 1024, 1023, 1022, 1021, 1020, 1019, 1018, 1017, 1016, 1015, 1014, 1013, 1012, 1011, 1010, 1009, 1008, 1007, 1006, 1005, 1004, 1003, 1002, 1001, 1000, 999, 993, 988, 984, 981, 979, 978, 977, 976, 975, 974, 973, 972, 967, 963, 960, 958, 957, 956, 955, 954, 953, 952, 948, 945, 943, 942, 941, 940, 939, 938, 935, 933, 932, 931, 930, 929, 927, 926, 925, 924, 923, 922, 921, 920, 919, 918, 917, 916, 915, 914, 913, 912, 911, 910, 909, 908, 907, 906, 905, 904, 903, 902, 901, 900, 899, 898, 897, 896, 895, 894, 893, 892, 891, 890, 889, 888, 883, 879, 876, 874, 873, 872, 871, 870, 869, 868, 864, 861, 859, 858, 857, 856, 855, 854, 851, 849, 848, 847, 846, 845, 843, 842, 841, 840, 839, 838, 837, 836, 835, 834, 833, 832, 831, 830, 829, 828, 827, 826, 825, 824, 823, 822, 821, 820, 819, 818, 817, 816, 815, 814, 813, 812, 808, 805, 803, 802, 801, 800, 799, 798, 795, 793, 792, 791, 790, 789, 787, 786, 785, 784, 783, 782, 781, 780, 779, 778, 777, 776, 775, 774, 773, 772, 771, 770, 769, 768, 767, 766, 765, 764, 763, 760, 758, 757, 756, 755, 754, 752, 751, 750, 749, 748, 747, 746, 745, 744, 743, 742, 741, 740, 739, 738, 737, 736, 735, 734, 732, 731, 730, 729, 728, 727, 726, 725, 724, 723, 722, 721, 720, 719, 718, 717, 716, 715, 714, 713]
Starting structural reductions, iteration 1 : 753/854 places, 1524/2230 transitions.
Applied a total of 0 rules in 52 ms. Remains 753 /753 variables (removed 0) and now considering 1524/1524 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 753/854 places, 1524/2230 transitions.
Normalized transition count is 1515 out of 1524 initially.
// Phase 1: matrix 1515 rows 753 cols
[2022-05-18 01:34:24] [INFO ] Computed 102 place invariants in 66 ms
Incomplete random walk after 1000000 steps, including 69215 resets, run finished after 8836 ms. (steps per millisecond=113 ) properties (out of 4) seen :9
Incomplete Best-First random walk after 1000001 steps, including 7383 resets, run finished after 1655 ms. (steps per millisecond=604 ) properties (out of 4) seen :9
Incomplete Best-First random walk after 1000001 steps, including 8167 resets, run finished after 1700 ms. (steps per millisecond=588 ) properties (out of 4) seen :9
Incomplete Best-First random walk after 1000001 steps, including 8269 resets, run finished after 1717 ms. (steps per millisecond=582 ) properties (out of 4) seen :9
Incomplete Best-First random walk after 1000001 steps, including 8288 resets, run finished after 1716 ms. (steps per millisecond=582 ) properties (out of 4) seen :9
[2022-05-18 01:34:39] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
// Phase 1: matrix 1515 rows 753 cols
[2022-05-18 01:34:39] [INFO ] Computed 102 place invariants in 37 ms
[2022-05-18 01:34:39] [INFO ] [Real]Absence check using 95 positive place invariants in 21 ms returned sat
[2022-05-18 01:34:39] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 12 ms returned sat
[2022-05-18 01:34:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:34:40] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2022-05-18 01:34:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:34:40] [INFO ] [Nat]Absence check using 95 positive place invariants in 23 ms returned sat
[2022-05-18 01:34:40] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 12 ms returned sat
[2022-05-18 01:34:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:34:46] [INFO ] [Nat]Absence check using state equation in 6406 ms returned unknown
[2022-05-18 01:34:46] [INFO ] [Real]Absence check using 95 positive place invariants in 20 ms returned sat
[2022-05-18 01:34:46] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 10 ms returned unsat
[2022-05-18 01:34:46] [INFO ] [Real]Absence check using 95 positive place invariants in 24 ms returned sat
[2022-05-18 01:34:46] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 18 ms returned sat
[2022-05-18 01:34:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:34:47] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2022-05-18 01:34:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:34:47] [INFO ] [Nat]Absence check using 95 positive place invariants in 25 ms returned sat
[2022-05-18 01:34:47] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 12 ms returned sat
[2022-05-18 01:34:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:34:47] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2022-05-18 01:34:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:34:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 17 ms returned sat
[2022-05-18 01:34:48] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 1 ms to minimize.
[2022-05-18 01:34:48] [INFO ] Deduced a trap composed of 304 places in 304 ms of which 0 ms to minimize.
[2022-05-18 01:34:48] [INFO ] Deduced a trap composed of 304 places in 300 ms of which 0 ms to minimize.
[2022-05-18 01:34:49] [INFO ] Deduced a trap composed of 306 places in 301 ms of which 0 ms to minimize.
[2022-05-18 01:34:49] [INFO ] Deduced a trap composed of 290 places in 303 ms of which 1 ms to minimize.
[2022-05-18 01:34:50] [INFO ] Deduced a trap composed of 300 places in 286 ms of which 0 ms to minimize.
[2022-05-18 01:34:50] [INFO ] Deduced a trap composed of 306 places in 298 ms of which 1 ms to minimize.
[2022-05-18 01:34:50] [INFO ] Deduced a trap composed of 300 places in 291 ms of which 1 ms to minimize.
[2022-05-18 01:34:51] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 1 ms to minimize.
[2022-05-18 01:34:51] [INFO ] Deduced a trap composed of 304 places in 296 ms of which 0 ms to minimize.
[2022-05-18 01:34:51] [INFO ] Deduced a trap composed of 308 places in 302 ms of which 1 ms to minimize.
[2022-05-18 01:34:52] [INFO ] Deduced a trap composed of 306 places in 315 ms of which 1 ms to minimize.
[2022-05-18 01:34:52] [INFO ] Deduced a trap composed of 300 places in 308 ms of which 7 ms to minimize.
[2022-05-18 01:34:52] [INFO ] Deduced a trap composed of 296 places in 299 ms of which 1 ms to minimize.
[2022-05-18 01:34:53] [INFO ] Deduced a trap composed of 306 places in 304 ms of which 0 ms to minimize.
[2022-05-18 01:34:53] [INFO ] Deduced a trap composed of 312 places in 292 ms of which 0 ms to minimize.
[2022-05-18 01:34:54] [INFO ] Deduced a trap composed of 306 places in 307 ms of which 1 ms to minimize.
[2022-05-18 01:34:54] [INFO ] Deduced a trap composed of 298 places in 304 ms of which 0 ms to minimize.
[2022-05-18 01:34:54] [INFO ] Deduced a trap composed of 304 places in 308 ms of which 0 ms to minimize.
[2022-05-18 01:34:55] [INFO ] Deduced a trap composed of 296 places in 297 ms of which 0 ms to minimize.
[2022-05-18 01:34:56] [INFO ] Deduced a trap composed of 300 places in 303 ms of which 1 ms to minimize.
[2022-05-18 01:34:56] [INFO ] Deduced a trap composed of 296 places in 307 ms of which 0 ms to minimize.
[2022-05-18 01:34:56] [INFO ] Deduced a trap composed of 304 places in 305 ms of which 0 ms to minimize.
[2022-05-18 01:34:57] [INFO ] Deduced a trap composed of 306 places in 299 ms of which 1 ms to minimize.
[2022-05-18 01:34:57] [INFO ] Deduced a trap composed of 300 places in 291 ms of which 1 ms to minimize.
[2022-05-18 01:34:57] [INFO ] Deduced a trap composed of 302 places in 304 ms of which 1 ms to minimize.
[2022-05-18 01:34:58] [INFO ] Deduced a trap composed of 306 places in 300 ms of which 0 ms to minimize.
[2022-05-18 01:34:58] [INFO ] Deduced a trap composed of 314 places in 304 ms of which 1 ms to minimize.
[2022-05-18 01:34:59] [INFO ] Deduced a trap composed of 306 places in 302 ms of which 1 ms to minimize.
[2022-05-18 01:34:59] [INFO ] Deduced a trap composed of 306 places in 296 ms of which 0 ms to minimize.
[2022-05-18 01:35:00] [INFO ] Deduced a trap composed of 294 places in 301 ms of which 0 ms to minimize.
[2022-05-18 01:35:00] [INFO ] Deduced a trap composed of 308 places in 310 ms of which 1 ms to minimize.
[2022-05-18 01:35:00] [INFO ] Deduced a trap composed of 304 places in 301 ms of which 1 ms to minimize.
[2022-05-18 01:35:01] [INFO ] Deduced a trap composed of 294 places in 301 ms of which 1 ms to minimize.
[2022-05-18 01:35:01] [INFO ] Deduced a trap composed of 308 places in 314 ms of which 10 ms to minimize.
[2022-05-18 01:35:02] [INFO ] Deduced a trap composed of 312 places in 308 ms of which 0 ms to minimize.
[2022-05-18 01:35:02] [INFO ] Deduced a trap composed of 300 places in 301 ms of which 1 ms to minimize.
[2022-05-18 01:35:02] [INFO ] Deduced a trap composed of 300 places in 298 ms of which 0 ms to minimize.
[2022-05-18 01:35:03] [INFO ] Deduced a trap composed of 296 places in 303 ms of which 1 ms to minimize.
[2022-05-18 01:35:03] [INFO ] Deduced a trap composed of 296 places in 304 ms of which 0 ms to minimize.
[2022-05-18 01:35:04] [INFO ] Deduced a trap composed of 304 places in 309 ms of which 0 ms to minimize.
[2022-05-18 01:35:04] [INFO ] Deduced a trap composed of 306 places in 290 ms of which 1 ms to minimize.
[2022-05-18 01:35:04] [INFO ] Deduced a trap composed of 298 places in 304 ms of which 1 ms to minimize.
[2022-05-18 01:35:05] [INFO ] Deduced a trap composed of 298 places in 310 ms of which 5 ms to minimize.
[2022-05-18 01:35:05] [INFO ] Deduced a trap composed of 300 places in 311 ms of which 0 ms to minimize.
[2022-05-18 01:35:05] [INFO ] Deduced a trap composed of 294 places in 296 ms of which 3 ms to minimize.
[2022-05-18 01:35:06] [INFO ] Deduced a trap composed of 294 places in 288 ms of which 1 ms to minimize.
[2022-05-18 01:35:06] [INFO ] Deduced a trap composed of 308 places in 286 ms of which 1 ms to minimize.
[2022-05-18 01:35:07] [INFO ] Deduced a trap composed of 310 places in 289 ms of which 1 ms to minimize.
[2022-05-18 01:35:07] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 1 ms to minimize.
[2022-05-18 01:35:07] [INFO ] Deduced a trap composed of 300 places in 304 ms of which 1 ms to minimize.
[2022-05-18 01:35:08] [INFO ] Deduced a trap composed of 304 places in 302 ms of which 1 ms to minimize.
[2022-05-18 01:35:08] [INFO ] Deduced a trap composed of 294 places in 314 ms of which 1 ms to minimize.
[2022-05-18 01:35:08] [INFO ] Deduced a trap composed of 302 places in 290 ms of which 0 ms to minimize.
[2022-05-18 01:35:09] [INFO ] Deduced a trap composed of 308 places in 291 ms of which 0 ms to minimize.
[2022-05-18 01:35:09] [INFO ] Deduced a trap composed of 302 places in 304 ms of which 0 ms to minimize.
[2022-05-18 01:35:10] [INFO ] Deduced a trap composed of 306 places in 297 ms of which 1 ms to minimize.
[2022-05-18 01:35:10] [INFO ] Deduced a trap composed of 310 places in 296 ms of which 1 ms to minimize.
[2022-05-18 01:35:11] [INFO ] Deduced a trap composed of 298 places in 295 ms of which 0 ms to minimize.
[2022-05-18 01:35:11] [INFO ] Deduced a trap composed of 307 places in 301 ms of which 1 ms to minimize.
[2022-05-18 01:35:12] [INFO ] Deduced a trap composed of 288 places in 307 ms of which 1 ms to minimize.
[2022-05-18 01:35:12] [INFO ] Deduced a trap composed of 306 places in 314 ms of which 1 ms to minimize.
[2022-05-18 01:35:12] [INFO ] Deduced a trap composed of 298 places in 302 ms of which 1 ms to minimize.
[2022-05-18 01:35:13] [INFO ] Deduced a trap composed of 304 places in 297 ms of which 1 ms to minimize.
[2022-05-18 01:35:13] [INFO ] Deduced a trap composed of 306 places in 302 ms of which 1 ms to minimize.
[2022-05-18 01:35:14] [INFO ] Deduced a trap composed of 298 places in 307 ms of which 1 ms to minimize.
[2022-05-18 01:35:14] [INFO ] Deduced a trap composed of 302 places in 312 ms of which 0 ms to minimize.
[2022-05-18 01:35:15] [INFO ] Deduced a trap composed of 302 places in 305 ms of which 1 ms to minimize.
[2022-05-18 01:35:15] [INFO ] Deduced a trap composed of 300 places in 301 ms of which 1 ms to minimize.
[2022-05-18 01:35:16] [INFO ] Deduced a trap composed of 304 places in 305 ms of which 1 ms to minimize.
[2022-05-18 01:35:16] [INFO ] Deduced a trap composed of 300 places in 289 ms of which 0 ms to minimize.
[2022-05-18 01:35:16] [INFO ] Deduced a trap composed of 304 places in 293 ms of which 1 ms to minimize.
[2022-05-18 01:35:17] [INFO ] Deduced a trap composed of 304 places in 289 ms of which 1 ms to minimize.
[2022-05-18 01:35:18] [INFO ] Deduced a trap composed of 306 places in 282 ms of which 0 ms to minimize.
[2022-05-18 01:35:19] [INFO ] Deduced a trap composed of 296 places in 310 ms of which 1 ms to minimize.
[2022-05-18 01:35:20] [INFO ] Deduced a trap composed of 300 places in 309 ms of which 0 ms to minimize.
[2022-05-18 01:35:21] [INFO ] Deduced a trap composed of 302 places in 304 ms of which 1 ms to minimize.
[2022-05-18 01:35:21] [INFO ] Deduced a trap composed of 302 places in 304 ms of which 1 ms to minimize.
[2022-05-18 01:35:22] [INFO ] Deduced a trap composed of 310 places in 301 ms of which 0 ms to minimize.
[2022-05-18 01:35:23] [INFO ] Deduced a trap composed of 298 places in 292 ms of which 1 ms to minimize.
[2022-05-18 01:35:24] [INFO ] Deduced a trap composed of 306 places in 280 ms of which 1 ms to minimize.
[2022-05-18 01:35:24] [INFO ] Deduced a trap composed of 296 places in 284 ms of which 1 ms to minimize.
[2022-05-18 01:35:25] [INFO ] Deduced a trap composed of 304 places in 287 ms of which 1 ms to minimize.
[2022-05-18 01:35:25] [INFO ] Deduced a trap composed of 302 places in 301 ms of which 0 ms to minimize.
[2022-05-18 01:35:25] [INFO ] Deduced a trap composed of 306 places in 288 ms of which 1 ms to minimize.
[2022-05-18 01:35:26] [INFO ] Deduced a trap composed of 294 places in 288 ms of which 0 ms to minimize.
[2022-05-18 01:35:26] [INFO ] Deduced a trap composed of 306 places in 293 ms of which 0 ms to minimize.
[2022-05-18 01:35:27] [INFO ] Deduced a trap composed of 304 places in 277 ms of which 1 ms to minimize.
[2022-05-18 01:35:27] [INFO ] Deduced a trap composed of 302 places in 303 ms of which 0 ms to minimize.
[2022-05-18 01:35:28] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 1 ms to minimize.
[2022-05-18 01:35:28] [INFO ] Deduced a trap composed of 310 places in 301 ms of which 1 ms to minimize.
[2022-05-18 01:35:29] [INFO ] Deduced a trap composed of 298 places in 300 ms of which 0 ms to minimize.
[2022-05-18 01:35:29] [INFO ] Deduced a trap composed of 308 places in 303 ms of which 1 ms to minimize.
[2022-05-18 01:35:30] [INFO ] Deduced a trap composed of 304 places in 300 ms of which 1 ms to minimize.
[2022-05-18 01:35:31] [INFO ] Deduced a trap composed of 310 places in 290 ms of which 1 ms to minimize.
[2022-05-18 01:35:31] [INFO ] Deduced a trap composed of 294 places in 304 ms of which 0 ms to minimize.
[2022-05-18 01:35:31] [INFO ] Deduced a trap composed of 304 places in 280 ms of which 0 ms to minimize.
[2022-05-18 01:35:32] [INFO ] Deduced a trap composed of 296 places in 289 ms of which 0 ms to minimize.
[2022-05-18 01:35:32] [INFO ] Deduced a trap composed of 3 places in 394 ms of which 1 ms to minimize.
[2022-05-18 01:35:32] [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 2
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-18 01:35:32] [INFO ] [Real]Absence check using 95 positive place invariants in 23 ms returned sat
[2022-05-18 01:35:32] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 5 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 1, 10, 1] Max seen :[4, 1, 3, 1]
FORMULA PolyORBNT-COL-S10J40-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 753 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 753/753 places, 1524/1524 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 753 transition count 1523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 752 transition count 1523
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 751 transition count 1522
Applied a total of 4 rules in 115 ms. Remains 751 /753 variables (removed 2) and now considering 1522/1524 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 751/753 places, 1522/1524 transitions.
Normalized transition count is 1513 out of 1522 initially.
// Phase 1: matrix 1513 rows 751 cols
[2022-05-18 01:35:33] [INFO ] Computed 102 place invariants in 35 ms
Incomplete random walk after 1000000 steps, including 70636 resets, run finished after 8845 ms. (steps per millisecond=113 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 7420 resets, run finished after 1658 ms. (steps per millisecond=603 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000000 steps, including 8211 resets, run finished after 1709 ms. (steps per millisecond=585 ) properties (out of 2) seen :7
[2022-05-18 01:35:45] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2022-05-18 01:35:45] [INFO ] Computed 102 place invariants in 36 ms
[2022-05-18 01:35:45] [INFO ] [Real]Absence check using 95 positive place invariants in 22 ms returned sat
[2022-05-18 01:35:45] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 11 ms returned sat
[2022-05-18 01:35:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:35:45] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2022-05-18 01:35:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:35:45] [INFO ] [Nat]Absence check using 95 positive place invariants in 23 ms returned sat
[2022-05-18 01:35:45] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 14 ms returned sat
[2022-05-18 01:35:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:35:52] [INFO ] [Nat]Absence check using state equation in 6319 ms returned unknown
[2022-05-18 01:35:52] [INFO ] [Real]Absence check using 95 positive place invariants in 22 ms returned sat
[2022-05-18 01:35:52] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 17 ms returned sat
[2022-05-18 01:35:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:35:52] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2022-05-18 01:35:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:35:52] [INFO ] [Nat]Absence check using 95 positive place invariants in 26 ms returned sat
[2022-05-18 01:35:52] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 14 ms returned sat
[2022-05-18 01:35:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:35:53] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2022-05-18 01:35:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:35:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 195 ms returned sat
[2022-05-18 01:35:53] [INFO ] Deduced a trap composed of 302 places in 290 ms of which 1 ms to minimize.
[2022-05-18 01:35:54] [INFO ] Deduced a trap composed of 304 places in 295 ms of which 0 ms to minimize.
[2022-05-18 01:35:54] [INFO ] Deduced a trap composed of 298 places in 289 ms of which 1 ms to minimize.
[2022-05-18 01:35:54] [INFO ] Deduced a trap composed of 300 places in 295 ms of which 0 ms to minimize.
[2022-05-18 01:35:55] [INFO ] Deduced a trap composed of 300 places in 289 ms of which 1 ms to minimize.
[2022-05-18 01:35:55] [INFO ] Deduced a trap composed of 304 places in 289 ms of which 1 ms to minimize.
[2022-05-18 01:35:55] [INFO ] Deduced a trap composed of 298 places in 302 ms of which 1 ms to minimize.
[2022-05-18 01:35:56] [INFO ] Deduced a trap composed of 300 places in 301 ms of which 1 ms to minimize.
[2022-05-18 01:35:56] [INFO ] Deduced a trap composed of 296 places in 286 ms of which 0 ms to minimize.
[2022-05-18 01:35:56] [INFO ] Deduced a trap composed of 296 places in 299 ms of which 0 ms to minimize.
[2022-05-18 01:35:57] [INFO ] Deduced a trap composed of 306 places in 300 ms of which 1 ms to minimize.
[2022-05-18 01:35:57] [INFO ] Deduced a trap composed of 300 places in 299 ms of which 1 ms to minimize.
[2022-05-18 01:35:58] [INFO ] Deduced a trap composed of 298 places in 300 ms of which 1 ms to minimize.
[2022-05-18 01:35:58] [INFO ] Deduced a trap composed of 300 places in 287 ms of which 1 ms to minimize.
[2022-05-18 01:35:58] [INFO ] Deduced a trap composed of 304 places in 299 ms of which 0 ms to minimize.
[2022-05-18 01:35:59] [INFO ] Deduced a trap composed of 298 places in 298 ms of which 0 ms to minimize.
[2022-05-18 01:35:59] [INFO ] Deduced a trap composed of 294 places in 328 ms of which 0 ms to minimize.
[2022-05-18 01:35:59] [INFO ] Deduced a trap composed of 300 places in 300 ms of which 1 ms to minimize.
[2022-05-18 01:36:00] [INFO ] Deduced a trap composed of 304 places in 302 ms of which 1 ms to minimize.
[2022-05-18 01:36:00] [INFO ] Deduced a trap composed of 304 places in 298 ms of which 0 ms to minimize.
[2022-05-18 01:36:01] [INFO ] Deduced a trap composed of 296 places in 303 ms of which 1 ms to minimize.
[2022-05-18 01:36:01] [INFO ] Deduced a trap composed of 308 places in 309 ms of which 0 ms to minimize.
[2022-05-18 01:36:01] [INFO ] Deduced a trap composed of 302 places in 304 ms of which 0 ms to minimize.
[2022-05-18 01:36:02] [INFO ] Deduced a trap composed of 290 places in 302 ms of which 1 ms to minimize.
[2022-05-18 01:36:03] [INFO ] Deduced a trap composed of 306 places in 299 ms of which 0 ms to minimize.
[2022-05-18 01:36:03] [INFO ] Deduced a trap composed of 304 places in 298 ms of which 0 ms to minimize.
[2022-05-18 01:36:04] [INFO ] Deduced a trap composed of 298 places in 299 ms of which 1 ms to minimize.
[2022-05-18 01:36:04] [INFO ] Deduced a trap composed of 296 places in 302 ms of which 0 ms to minimize.
[2022-05-18 01:36:04] [INFO ] Deduced a trap composed of 313 places in 309 ms of which 1 ms to minimize.
[2022-05-18 01:36:05] [INFO ] Deduced a trap composed of 294 places in 309 ms of which 0 ms to minimize.
[2022-05-18 01:36:05] [INFO ] Deduced a trap composed of 302 places in 304 ms of which 0 ms to minimize.
[2022-05-18 01:36:06] [INFO ] Deduced a trap composed of 298 places in 298 ms of which 1 ms to minimize.
[2022-05-18 01:36:06] [INFO ] Deduced a trap composed of 304 places in 296 ms of which 1 ms to minimize.
[2022-05-18 01:36:07] [INFO ] Deduced a trap composed of 296 places in 289 ms of which 1 ms to minimize.
[2022-05-18 01:36:08] [INFO ] Deduced a trap composed of 296 places in 305 ms of which 1 ms to minimize.
[2022-05-18 01:36:08] [INFO ] Deduced a trap composed of 292 places in 303 ms of which 1 ms to minimize.
[2022-05-18 01:36:08] [INFO ] Deduced a trap composed of 304 places in 294 ms of which 1 ms to minimize.
[2022-05-18 01:36:09] [INFO ] Deduced a trap composed of 294 places in 301 ms of which 1 ms to minimize.
[2022-05-18 01:36:09] [INFO ] Deduced a trap composed of 304 places in 301 ms of which 1 ms to minimize.
[2022-05-18 01:36:09] [INFO ] Deduced a trap composed of 306 places in 303 ms of which 1 ms to minimize.
[2022-05-18 01:36:10] [INFO ] Deduced a trap composed of 304 places in 310 ms of which 1 ms to minimize.
[2022-05-18 01:36:11] [INFO ] Deduced a trap composed of 305 places in 310 ms of which 0 ms to minimize.
[2022-05-18 01:36:11] [INFO ] Deduced a trap composed of 304 places in 287 ms of which 1 ms to minimize.
[2022-05-18 01:36:12] [INFO ] Deduced a trap composed of 298 places in 301 ms of which 1 ms to minimize.
[2022-05-18 01:36:13] [INFO ] Deduced a trap composed of 296 places in 306 ms of which 1 ms to minimize.
[2022-05-18 01:36:13] [INFO ] Deduced a trap composed of 302 places in 301 ms of which 0 ms to minimize.
[2022-05-18 01:36:14] [INFO ] Deduced a trap composed of 292 places in 303 ms of which 1 ms to minimize.
[2022-05-18 01:36:14] [INFO ] Deduced a trap composed of 304 places in 300 ms of which 0 ms to minimize.
[2022-05-18 01:36:14] [INFO ] Deduced a trap composed of 298 places in 309 ms of which 1 ms to minimize.
[2022-05-18 01:36:15] [INFO ] Deduced a trap composed of 296 places in 302 ms of which 1 ms to minimize.
[2022-05-18 01:36:15] [INFO ] Deduced a trap composed of 304 places in 301 ms of which 0 ms to minimize.
[2022-05-18 01:36:16] [INFO ] Deduced a trap composed of 314 places in 303 ms of which 1 ms to minimize.
[2022-05-18 01:36:16] [INFO ] Deduced a trap composed of 304 places in 301 ms of which 1 ms to minimize.
[2022-05-18 01:36:38] [INFO ] Deduced a trap composed of 3 places in 401 ms of which 1 ms to minimize.
[2022-05-18 01:36: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: 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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [10, 10] Max seen :[4, 3]
Support contains 2 out of 751 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 35 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 751/751 places, 1522/1522 transitions.
Starting structural reductions, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 34 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2022-05-18 01:36:38] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2022-05-18 01:36:38] [INFO ] Computed 102 place invariants in 26 ms
[2022-05-18 01:36:38] [INFO ] Implicit Places using invariants in 610 ms returned []
[2022-05-18 01:36:38] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2022-05-18 01:36:38] [INFO ] Computed 102 place invariants in 34 ms
[2022-05-18 01:36:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:36:41] [INFO ] Implicit Places using invariants and state equation in 2801 ms returned []
Implicit Place search using SMT with State Equation took 3414 ms to find 0 implicit places.
[2022-05-18 01:36:41] [INFO ] Redundant transitions in 101 ms returned []
[2022-05-18 01:36:41] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2022-05-18 01:36:41] [INFO ] Computed 102 place invariants in 35 ms
[2022-05-18 01:36:42] [INFO ] Dead Transitions using invariants and state equation in 717 ms returned []
Finished structural reductions, in 1 iterations. Remains : 751/751 places, 1522/1522 transitions.
Starting property specific reduction for PolyORBNT-COL-S10J40-UpperBounds-06
Normalized transition count is 1513 out of 1522 initially.
// Phase 1: matrix 1513 rows 751 cols
[2022-05-18 01:36:42] [INFO ] Computed 102 place invariants in 31 ms
Incomplete random walk after 10000 steps, including 723 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :4
[2022-05-18 01:36:42] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2022-05-18 01:36:42] [INFO ] Computed 102 place invariants in 39 ms
[2022-05-18 01:36:42] [INFO ] [Real]Absence check using 95 positive place invariants in 21 ms returned sat
[2022-05-18 01:36:42] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 11 ms returned sat
[2022-05-18 01:36:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:36:43] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2022-05-18 01:36:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:36:43] [INFO ] [Nat]Absence check using 95 positive place invariants in 23 ms returned sat
[2022-05-18 01:36:43] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 14 ms returned sat
[2022-05-18 01:36:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:36:48] [INFO ] [Nat]Absence check using state equation in 4906 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[4]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 751/751 places, 1522/1522 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 751 transition count 1521
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1521
Applied a total of 2 rules in 42 ms. Remains 750 /751 variables (removed 1) and now considering 1521/1522 (removed 1) transitions.
[2022-05-18 01:36:48] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2022-05-18 01:36:48] [INFO ] Computed 102 place invariants in 26 ms
[2022-05-18 01:36:48] [INFO ] Dead Transitions using invariants and state equation in 716 ms returned []
Finished structural reductions, in 1 iterations. Remains : 750/751 places, 1521/1522 transitions.
Normalized transition count is 1512 out of 1521 initially.
// Phase 1: matrix 1512 rows 750 cols
[2022-05-18 01:36:49] [INFO ] Computed 102 place invariants in 29 ms
Incomplete random walk after 1000000 steps, including 72558 resets, run finished after 9185 ms. (steps per millisecond=108 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 7257 resets, run finished after 1623 ms. (steps per millisecond=616 ) properties (out of 1) seen :4
[2022-05-18 01:36:59] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2022-05-18 01:36:59] [INFO ] Computed 102 place invariants in 36 ms
[2022-05-18 01:36:59] [INFO ] [Real]Absence check using 95 positive place invariants in 24 ms returned sat
[2022-05-18 01:36:59] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 13 ms returned sat
[2022-05-18 01:36:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:37:00] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2022-05-18 01:37:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:37:00] [INFO ] [Nat]Absence check using 95 positive place invariants in 23 ms returned sat
[2022-05-18 01:37:00] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 12 ms returned sat
[2022-05-18 01:37:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:37:06] [INFO ] [Nat]Absence check using state equation in 6387 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[4]
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 31 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 750/750 places, 1521/1521 transitions.
Starting structural reductions, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 28 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2022-05-18 01:37:07] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2022-05-18 01:37:07] [INFO ] Computed 102 place invariants in 28 ms
[2022-05-18 01:37:07] [INFO ] Implicit Places using invariants in 567 ms returned []
[2022-05-18 01:37:07] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2022-05-18 01:37:07] [INFO ] Computed 102 place invariants in 34 ms
[2022-05-18 01:37:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:37:09] [INFO ] Implicit Places using invariants and state equation in 2201 ms returned []
Implicit Place search using SMT with State Equation took 2770 ms to find 0 implicit places.
[2022-05-18 01:37:09] [INFO ] Redundant transitions in 68 ms returned []
[2022-05-18 01:37:09] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2022-05-18 01:37:09] [INFO ] Computed 102 place invariants in 30 ms
[2022-05-18 01:37:10] [INFO ] Dead Transitions using invariants and state equation in 732 ms returned []
Finished structural reductions, in 1 iterations. Remains : 750/750 places, 1521/1521 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J40-UpperBounds-06 in 28136 ms.
Starting property specific reduction for PolyORBNT-COL-S10J40-UpperBounds-11
Normalized transition count is 1513 out of 1522 initially.
// Phase 1: matrix 1513 rows 751 cols
[2022-05-18 01:37:10] [INFO ] Computed 102 place invariants in 27 ms
Incomplete random walk after 10000 steps, including 695 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :3
[2022-05-18 01:37:10] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2022-05-18 01:37:10] [INFO ] Computed 102 place invariants in 30 ms
[2022-05-18 01:37:10] [INFO ] [Real]Absence check using 95 positive place invariants in 22 ms returned sat
[2022-05-18 01:37:10] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 21 ms returned sat
[2022-05-18 01:37:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:37:11] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2022-05-18 01:37:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:37:11] [INFO ] [Nat]Absence check using 95 positive place invariants in 23 ms returned sat
[2022-05-18 01:37:11] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 14 ms returned sat
[2022-05-18 01:37:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:37:11] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2022-05-18 01:37:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:37:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 216 ms returned sat
[2022-05-18 01:37:12] [INFO ] Deduced a trap composed of 302 places in 310 ms of which 0 ms to minimize.
[2022-05-18 01:37:12] [INFO ] Deduced a trap composed of 304 places in 316 ms of which 0 ms to minimize.
[2022-05-18 01:37:13] [INFO ] Deduced a trap composed of 298 places in 291 ms of which 0 ms to minimize.
[2022-05-18 01:37:13] [INFO ] Deduced a trap composed of 300 places in 309 ms of which 1 ms to minimize.
[2022-05-18 01:37:13] [INFO ] Deduced a trap composed of 300 places in 297 ms of which 1 ms to minimize.
[2022-05-18 01:37:14] [INFO ] Deduced a trap composed of 304 places in 301 ms of which 1 ms to minimize.
[2022-05-18 01:37:14] [INFO ] Deduced a trap composed of 298 places in 300 ms of which 1 ms to minimize.
[2022-05-18 01:37:14] [INFO ] Deduced a trap composed of 300 places in 297 ms of which 1 ms to minimize.
[2022-05-18 01:37:15] [INFO ] Deduced a trap composed of 296 places in 293 ms of which 1 ms to minimize.
[2022-05-18 01:37:15] [INFO ] Deduced a trap composed of 296 places in 314 ms of which 6 ms to minimize.
[2022-05-18 01:37:15] [INFO ] Deduced a trap composed of 306 places in 301 ms of which 1 ms to minimize.
[2022-05-18 01:37:16] [INFO ] Deduced a trap composed of 300 places in 286 ms of which 1 ms to minimize.
[2022-05-18 01:37:16] [INFO ] Deduced a trap composed of 3 places in 404 ms of which 0 ms to minimize.
[2022-05-18 01:37:16] [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 0
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 29 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2022-05-18 01:37:16] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2022-05-18 01:37:16] [INFO ] Computed 102 place invariants in 35 ms
[2022-05-18 01:37:17] [INFO ] Dead Transitions using invariants and state equation in 788 ms returned []
Finished structural reductions, in 1 iterations. Remains : 751/751 places, 1522/1522 transitions.
Normalized transition count is 1513 out of 1522 initially.
// Phase 1: matrix 1513 rows 751 cols
[2022-05-18 01:37:17] [INFO ] Computed 102 place invariants in 29 ms
Incomplete random walk after 1000000 steps, including 70409 resets, run finished after 8775 ms. (steps per millisecond=113 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8014 resets, run finished after 1697 ms. (steps per millisecond=589 ) properties (out of 1) seen :3
[2022-05-18 01:37:28] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2022-05-18 01:37:28] [INFO ] Computed 102 place invariants in 33 ms
[2022-05-18 01:37:28] [INFO ] [Real]Absence check using 95 positive place invariants in 22 ms returned sat
[2022-05-18 01:37:28] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 14 ms returned sat
[2022-05-18 01:37:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:37:28] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2022-05-18 01:37:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:37:28] [INFO ] [Nat]Absence check using 95 positive place invariants in 23 ms returned sat
[2022-05-18 01:37:28] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 13 ms returned sat
[2022-05-18 01:37:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:37:29] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2022-05-18 01:37:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:37:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 198 ms returned sat
[2022-05-18 01:37:29] [INFO ] Deduced a trap composed of 302 places in 301 ms of which 0 ms to minimize.
[2022-05-18 01:37:30] [INFO ] Deduced a trap composed of 304 places in 309 ms of which 0 ms to minimize.
[2022-05-18 01:37:30] [INFO ] Deduced a trap composed of 298 places in 297 ms of which 1 ms to minimize.
[2022-05-18 01:37:30] [INFO ] Deduced a trap composed of 300 places in 299 ms of which 0 ms to minimize.
[2022-05-18 01:37:31] [INFO ] Deduced a trap composed of 300 places in 301 ms of which 1 ms to minimize.
[2022-05-18 01:37:31] [INFO ] Deduced a trap composed of 304 places in 311 ms of which 1 ms to minimize.
[2022-05-18 01:37:31] [INFO ] Deduced a trap composed of 298 places in 277 ms of which 1 ms to minimize.
[2022-05-18 01:37:32] [INFO ] Deduced a trap composed of 300 places in 290 ms of which 0 ms to minimize.
[2022-05-18 01:37:32] [INFO ] Deduced a trap composed of 296 places in 291 ms of which 0 ms to minimize.
[2022-05-18 01:37:32] [INFO ] Deduced a trap composed of 296 places in 283 ms of which 0 ms to minimize.
[2022-05-18 01:37:33] [INFO ] Deduced a trap composed of 306 places in 303 ms of which 0 ms to minimize.
[2022-05-18 01:37:33] [INFO ] Deduced a trap composed of 300 places in 308 ms of which 1 ms to minimize.
[2022-05-18 01:37:33] [INFO ] Deduced a trap composed of 298 places in 300 ms of which 0 ms to minimize.
[2022-05-18 01:37:34] [INFO ] Deduced a trap composed of 300 places in 285 ms of which 0 ms to minimize.
[2022-05-18 01:37:34] [INFO ] Deduced a trap composed of 304 places in 291 ms of which 1 ms to minimize.
[2022-05-18 01:37:35] [INFO ] Deduced a trap composed of 298 places in 302 ms of which 0 ms to minimize.
[2022-05-18 01:37:35] [INFO ] Deduced a trap composed of 294 places in 302 ms of which 1 ms to minimize.
[2022-05-18 01:37:35] [INFO ] Deduced a trap composed of 300 places in 278 ms of which 0 ms to minimize.
[2022-05-18 01:37:36] [INFO ] Deduced a trap composed of 304 places in 304 ms of which 1 ms to minimize.
[2022-05-18 01:37:36] [INFO ] Deduced a trap composed of 304 places in 291 ms of which 1 ms to minimize.
[2022-05-18 01:37:36] [INFO ] Deduced a trap composed of 296 places in 292 ms of which 1 ms to minimize.
[2022-05-18 01:37:37] [INFO ] Deduced a trap composed of 308 places in 290 ms of which 1 ms to minimize.
[2022-05-18 01:37:37] [INFO ] Deduced a trap composed of 302 places in 284 ms of which 0 ms to minimize.
[2022-05-18 01:37:38] [INFO ] Deduced a trap composed of 290 places in 279 ms of which 0 ms to minimize.
[2022-05-18 01:37:38] [INFO ] Deduced a trap composed of 306 places in 301 ms of which 0 ms to minimize.
[2022-05-18 01:37:39] [INFO ] Deduced a trap composed of 304 places in 300 ms of which 0 ms to minimize.
[2022-05-18 01:37:40] [INFO ] Deduced a trap composed of 298 places in 283 ms of which 1 ms to minimize.
[2022-05-18 01:37:40] [INFO ] Deduced a trap composed of 296 places in 284 ms of which 1 ms to minimize.
[2022-05-18 01:37:40] [INFO ] Deduced a trap composed of 313 places in 290 ms of which 0 ms to minimize.
[2022-05-18 01:37:41] [INFO ] Deduced a trap composed of 294 places in 293 ms of which 1 ms to minimize.
[2022-05-18 01:37:41] [INFO ] Deduced a trap composed of 302 places in 284 ms of which 1 ms to minimize.
[2022-05-18 01:37:41] [INFO ] Deduced a trap composed of 298 places in 296 ms of which 1 ms to minimize.
[2022-05-18 01:37:42] [INFO ] Deduced a trap composed of 304 places in 299 ms of which 1 ms to minimize.
[2022-05-18 01:37:42] [INFO ] Deduced a trap composed of 296 places in 286 ms of which 1 ms to minimize.
[2022-05-18 01:37:43] [INFO ] Deduced a trap composed of 296 places in 290 ms of which 1 ms to minimize.
[2022-05-18 01:37:44] [INFO ] Deduced a trap composed of 292 places in 293 ms of which 1 ms to minimize.
[2022-05-18 01:37:44] [INFO ] Deduced a trap composed of 304 places in 302 ms of which 1 ms to minimize.
[2022-05-18 01:37:44] [INFO ] Deduced a trap composed of 294 places in 289 ms of which 1 ms to minimize.
[2022-05-18 01:37:45] [INFO ] Deduced a trap composed of 304 places in 293 ms of which 1 ms to minimize.
[2022-05-18 01:37:45] [INFO ] Deduced a trap composed of 306 places in 301 ms of which 0 ms to minimize.
[2022-05-18 01:37:46] [INFO ] Deduced a trap composed of 304 places in 295 ms of which 1 ms to minimize.
[2022-05-18 01:37:46] [INFO ] Deduced a trap composed of 305 places in 291 ms of which 1 ms to minimize.
[2022-05-18 01:37:47] [INFO ] Deduced a trap composed of 304 places in 321 ms of which 15 ms to minimize.
[2022-05-18 01:37:48] [INFO ] Deduced a trap composed of 298 places in 276 ms of which 0 ms to minimize.
[2022-05-18 01:37:49] [INFO ] Deduced a trap composed of 296 places in 284 ms of which 0 ms to minimize.
[2022-05-18 01:37:49] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 1 ms to minimize.
[2022-05-18 01:37:49] [INFO ] Deduced a trap composed of 292 places in 299 ms of which 1 ms to minimize.
[2022-05-18 01:37:50] [INFO ] Deduced a trap composed of 304 places in 315 ms of which 0 ms to minimize.
[2022-05-18 01:37:50] [INFO ] Deduced a trap composed of 298 places in 298 ms of which 1 ms to minimize.
[2022-05-18 01:37:50] [INFO ] Deduced a trap composed of 296 places in 295 ms of which 1 ms to minimize.
[2022-05-18 01:37:51] [INFO ] Deduced a trap composed of 304 places in 295 ms of which 0 ms to minimize.
[2022-05-18 01:37:52] [INFO ] Deduced a trap composed of 314 places in 281 ms of which 0 ms to minimize.
[2022-05-18 01:37:52] [INFO ] Deduced a trap composed of 304 places in 291 ms of which 1 ms to minimize.
[2022-05-18 01:38:14] [INFO ] Deduced a trap composed of 3 places in 374 ms of which 0 ms to minimize.
[2022-05-18 01:38:14] [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 0
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 27 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 751/751 places, 1522/1522 transitions.
Starting structural reductions, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 26 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2022-05-18 01:38:14] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2022-05-18 01:38:14] [INFO ] Computed 102 place invariants in 33 ms
[2022-05-18 01:38:14] [INFO ] Implicit Places using invariants in 590 ms returned []
[2022-05-18 01:38:14] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2022-05-18 01:38:14] [INFO ] Computed 102 place invariants in 34 ms
[2022-05-18 01:38:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:38:17] [INFO ] Implicit Places using invariants and state equation in 2831 ms returned []
Implicit Place search using SMT with State Equation took 3423 ms to find 0 implicit places.
[2022-05-18 01:38:17] [INFO ] Redundant transitions in 24 ms returned []
[2022-05-18 01:38:17] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2022-05-18 01:38:17] [INFO ] Computed 102 place invariants in 26 ms
[2022-05-18 01:38:18] [INFO ] Dead Transitions using invariants and state equation in 708 ms returned []
Finished structural reductions, in 1 iterations. Remains : 751/751 places, 1522/1522 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J40-UpperBounds-11 in 67693 ms.
[2022-05-18 01:38:18] [INFO ] Flatten gal took : 224 ms
[2022-05-18 01:38:18] [INFO ] Applying decomposition
[2022-05-18 01:38:18] [INFO ] Flatten gal took : 149 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12383325944458498436.txt, -o, /tmp/graph12383325944458498436.bin, -w, /tmp/graph12383325944458498436.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12383325944458498436.bin, -l, -1, -v, -w, /tmp/graph12383325944458498436.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-18 01:38:19] [INFO ] Decomposing Gal with order
[2022-05-18 01:38:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 01:38:19] [INFO ] Removed a total of 3396 redundant transitions.
[2022-05-18 01:38:19] [INFO ] Flatten gal took : 341 ms
[2022-05-18 01:38:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 415 labels/synchronizations in 68 ms.
[2022-05-18 01:38:19] [INFO ] Time to serialize gal into /tmp/UpperBounds2985208264374037530.gal : 27 ms
[2022-05-18 01:38:19] [INFO ] Time to serialize properties into /tmp/UpperBounds10656108643238882747.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds2985208264374037530.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds10656108643238882747.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds2985208264374037530.gal -t CGAL -reachable-file /tmp/UpperBounds10656108643238882747.prop --nowitness
Loading property file /tmp/UpperBounds10656108643238882747.prop.
Detected timeout of ITS tools.
[2022-05-18 01:59:59] [INFO ] Applying decomposition
[2022-05-18 02:00:01] [INFO ] Flatten gal took : 1853 ms
[2022-05-18 02:00:01] [INFO ] Decomposing Gal with order
[2022-05-18 02:00:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 02:00:02] [INFO ] Removed a total of 7679 redundant transitions.
[2022-05-18 02:00:02] [INFO ] Flatten gal took : 310 ms
[2022-05-18 02:00:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 207 ms.
[2022-05-18 02:00:02] [INFO ] Time to serialize gal into /tmp/UpperBounds5846236271735814630.gal : 26 ms
[2022-05-18 02:00:02] [INFO ] Time to serialize properties into /tmp/UpperBounds7847832872218340689.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds5846236271735814630.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds7847832872218340689.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds5846236271735814630.gal -t CGAL -reachable-file /tmp/UpperBounds7847832872218340689.prop --nowitness
Loading property file /tmp/UpperBounds7847832872218340689.prop.
Detected timeout of ITS tools.
[2022-05-18 02:21:45] [INFO ] Flatten gal took : 419 ms
[2022-05-18 02:21:46] [INFO ] Input system was already deterministic with 1522 transitions.
[2022-05-18 02:21:46] [INFO ] Transformed 751 places.
[2022-05-18 02:21:47] [INFO ] Transformed 1522 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-18 02:22:17] [INFO ] Time to serialize gal into /tmp/UpperBounds9136424321221189209.gal : 49 ms
[2022-05-18 02:22:17] [INFO ] Time to serialize properties into /tmp/UpperBounds17067974385289325369.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds9136424321221189209.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds17067974385289325369.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds9136424321221189209.gal -t CGAL -reachable-file /tmp/UpperBounds17067974385289325369.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds17067974385289325369.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="PolyORBNT-COL-S10J40"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is PolyORBNT-COL-S10J40, 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 r179-tall-165277027100295"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J40.tgz
mv PolyORBNT-COL-S10J40 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 ;