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.r168-tall-165277017100749.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBNT-COL-S05J40, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017100749
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 8.1K Apr 30 03:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 30 03:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 30 03:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 30 03:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:29 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-S05J40-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652933926283

Running Version 202205111006
[2022-05-19 04:18:47] [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-19 04:18:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 04:18:47] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-19 04:18:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 04:18:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 598 ms
[2022-05-19 04:18:48] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 669 PT places and 1712.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2022-05-19 04:18:48] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 9 ms.
[2022-05-19 04:18:48] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2022-05-19 04:18:48] [INFO ] Computed 13 place invariants in 13 ms
FORMULA PolyORBNT-COL-S05J40-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-UpperBounds-00 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 38 rows 48 cols
[2022-05-19 04:18:48] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-19 04:18:48] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-19 04:18:48] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2022-05-19 04:18:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:48] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-19 04:18:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 04:18:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-19 04:18:48] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-19 04:18:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:48] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-19 04:18:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 04:18:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-19 04:18:48] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 2 ms to minimize.
[2022-05-19 04:18:48] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2022-05-19 04:18:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 77 ms
[2022-05-19 04:18:48] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-19 04:18:48] [INFO ] Added : 36 causal constraints over 8 iterations in 67 ms. Result :sat
Minimization took 14 ms.
[2022-05-19 04:18:48] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 04:18:48] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 04:18:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:48] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-19 04:18:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 04:18:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 04:18:48] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 04:18:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:48] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-19 04:18:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-19 04:18:48] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2022-05-19 04:18:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2022-05-19 04:18:48] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-19 04:18:49] [INFO ] Added : 23 causal constraints over 6 iterations in 188 ms. Result :sat
Minimization took 22 ms.
[2022-05-19 04:18:49] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 04:18:49] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 04:18:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:49] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-19 04:18:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 04:18:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 04:18:49] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 04:18:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:49] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-19 04:18:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-19 04:18:49] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 04:18:49] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 2 ms to minimize.
[2022-05-19 04:18:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2022-05-19 04:18:49] [INFO ] Added : 36 causal constraints over 8 iterations in 153 ms. Result :sat
Minimization took 17 ms.
[2022-05-19 04:18:49] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 04:18:49] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 04:18:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:49] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-19 04:18:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 04:18:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 04:18:49] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 04:18:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:49] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-19 04:18:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 04:18:49] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 04:18:49] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2022-05-19 04:18:49] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 04:18:49] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 04:18:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:49] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-19 04:18:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 04:18:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 04:18:49] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 04:18:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:49] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-19 04:18:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 04:18:49] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2022-05-19 04:18:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2022-05-19 04:18:49] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 04:18:49] [INFO ] Added : 15 causal constraints over 4 iterations in 27 ms. Result :sat
Minimization took 10 ms.
[2022-05-19 04:18:49] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 04:18:49] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 04:18:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:49] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-19 04:18:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 04:18:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 04:18:49] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 04:18:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:49] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-19 04:18:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 04:18:49] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2022-05-19 04:18:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2022-05-19 04:18:49] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 04:18:49] [INFO ] Added : 21 causal constraints over 5 iterations in 99 ms. Result :sat
Minimization took 16 ms.
[2022-05-19 04:18:49] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-19 04:18:49] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 04:18:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:49] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-19 04:18:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 04:18:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 04:18:50] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-19 04:18:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:50] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-19 04:18:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-19 04:18:50] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 04:18:50] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2022-05-19 04:18:50] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 04:18:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 04:18:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:50] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-19 04:18:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 04:18:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 04:18:50] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 04:18:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:50] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-05-19 04:18:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 04:18:50] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2022-05-19 04:18:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2022-05-19 04:18:50] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 04:18:50] [INFO ] Added : 36 causal constraints over 8 iterations in 40 ms. Result :sat
Minimization took 15 ms.
[2022-05-19 04:18:50] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 04:18:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 04:18:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:50] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-19 04:18:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 04:18:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 04:18:50] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 04:18:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:50] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-19 04:18:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 37 ms returned sat
[2022-05-19 04:18:50] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-19 04:18:50] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2022-05-19 04:18:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2022-05-19 04:18:50] [INFO ] Added : 36 causal constraints over 8 iterations in 101 ms. Result :sat
Minimization took 15 ms.
[2022-05-19 04:18:50] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-19 04:18:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 04:18:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:50] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-19 04:18:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 04:18:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2022-05-19 04:18:50] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 04:18:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:50] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-19 04:18:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 04:18:50] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 04:18:50] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 5 ms.
[2022-05-19 04:18:50] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 04:18:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 04:18:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:50] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-19 04:18:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 04:18:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2022-05-19 04:18:50] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 04:18:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:50] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-19 04:18:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 35 ms returned sat
[2022-05-19 04:18:50] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 04:18:51] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2022-05-19 04:18:51] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2022-05-19 04:18:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 71 ms
[2022-05-19 04:18:51] [INFO ] Added : 23 causal constraints over 5 iterations in 483 ms. Result :sat
Minimization took 133 ms.
[2022-05-19 04:18:51] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 04:18:51] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 04:18:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:51] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-19 04:18:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 04:18:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 04:18:51] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 04:18:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:51] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-19 04:18:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-19 04:18:51] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-19 04:18:51] [INFO ] Added : 1 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 7 ms.
[2022-05-19 04:18:51] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 04:18:51] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 04:18:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:51] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-19 04:18:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 04:18:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 04:18:51] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 04:18:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:51] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-05-19 04:18:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 04:18:51] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2022-05-19 04:18:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2022-05-19 04:18:51] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 04:18:51] [INFO ] Added : 18 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 12 ms.
[2022-05-19 04:18:51] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 04:18:51] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 04:18:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:51] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, 10, -1, -1, 1, 3, -1, -1, -1, 5, 10, -1, 2, 10]
FORMULA PolyORBNT-COL-S05J40-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2022-05-19 04:18:51] [INFO ] Unfolded HLPN to a Petri net with 669 places and 1630 transitions 10784 arcs in 52 ms.
[2022-05-19 04:18:51] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 681 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 13) seen :22
FORMULA PolyORBNT-COL-S05J40-UpperBounds-11 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 173 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :13
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 139 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 162 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :13
Incomplete Best-First random walk after 10001 steps, including 142 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :14
Incomplete Best-First random walk after 10000 steps, including 159 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10000 steps, including 149 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :13
Incomplete Best-First random walk after 10000 steps, including 164 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :13
FORMULA PolyORBNT-COL-S05J40-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 252 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :2
[2022-05-19 04:18:52] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2022-05-19 04:18:52] [INFO ] Computed 102 place invariants in 62 ms
[2022-05-19 04:18:52] [INFO ] [Real]Absence check using 95 positive place invariants in 22 ms returned sat
[2022-05-19 04:18:52] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 9 ms returned unsat
[2022-05-19 04:18:52] [INFO ] [Real]Absence check using 95 positive place invariants in 23 ms returned sat
[2022-05-19 04:18:52] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 6 ms returned unsat
[2022-05-19 04:18:52] [INFO ] [Real]Absence check using 95 positive place invariants in 23 ms returned sat
[2022-05-19 04:18:52] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 8 ms returned unsat
[2022-05-19 04:18:52] [INFO ] [Real]Absence check using 95 positive place invariants in 21 ms returned sat
[2022-05-19 04:18:52] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 8 ms returned unsat
[2022-05-19 04:18:52] [INFO ] [Real]Absence check using 95 positive place invariants in 24 ms returned sat
[2022-05-19 04:18:52] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 12 ms returned sat
[2022-05-19 04:18:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:52] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2022-05-19 04:18:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 04:18:53] [INFO ] [Nat]Absence check using 95 positive place invariants in 22 ms returned sat
[2022-05-19 04:18:53] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 11 ms returned sat
[2022-05-19 04:18:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:53] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2022-05-19 04:18:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 04:18:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 24 ms returned sat
[2022-05-19 04:18:53] [INFO ] Deduced a trap composed of 204 places in 214 ms of which 1 ms to minimize.
[2022-05-19 04:18:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 316 ms
[2022-05-19 04:18:53] [INFO ] Computed and/alt/rep : 549/1329/549 causal constraints (skipped 376 transitions) in 85 ms.
[2022-05-19 04:18:54] [INFO ] Added : 9 causal constraints over 2 iterations in 331 ms. Result :sat
Minimization took 219 ms.
[2022-05-19 04:18:54] [INFO ] [Real]Absence check using 95 positive place invariants in 36 ms returned sat
[2022-05-19 04:18:54] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 7 ms returned unsat
[2022-05-19 04:18:54] [INFO ] [Real]Absence check using 95 positive place invariants in 21 ms returned sat
[2022-05-19 04:18:54] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 9 ms returned unsat
[2022-05-19 04:18:54] [INFO ] [Real]Absence check using 95 positive place invariants in 22 ms returned sat
[2022-05-19 04:18:54] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 11 ms returned unsat
[2022-05-19 04:18:54] [INFO ] [Real]Absence check using 95 positive place invariants in 22 ms returned sat
[2022-05-19 04:18:54] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 11 ms returned sat
[2022-05-19 04:18:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:55] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2022-05-19 04:18:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 04:18:55] [INFO ] [Nat]Absence check using 95 positive place invariants in 22 ms returned sat
[2022-05-19 04:18:55] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 12 ms returned sat
[2022-05-19 04:18:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 04:18:55] [INFO ] [Nat]Absence check using state equation in 532 ms returned sat
[2022-05-19 04:18:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 57 ms returned sat
[2022-05-19 04:18:55] [INFO ] Deduced a trap composed of 343 places in 221 ms of which 1 ms to minimize.
[2022-05-19 04:18:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 312 ms
[2022-05-19 04:18:56] [INFO ] Computed and/alt/rep : 549/1329/549 causal constraints (skipped 376 transitions) in 61 ms.
[2022-05-19 04:18:56] [INFO ] Added : 18 causal constraints over 4 iterations in 355 ms. Result :sat
Minimization took 357 ms.
[2022-05-19 04:18:56] [INFO ] [Real]Absence check using 95 positive place invariants in 22 ms returned sat
[2022-05-19 04:18:56] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 10 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 4, 1, 1, 1, 1, 1, 1, 10, 1] Max seen :[1, 4, 1, 1, 0, 1, 1, 1, 3, 1]
FORMULA PolyORBNT-COL-S05J40-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 629 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 629/629 places, 935/935 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 624 transition count 889
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 97 place count 578 transition count 889
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 97 place count 578 transition count 845
Deduced a syphon composed of 44 places in 8 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 185 place count 534 transition count 845
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 186 place count 533 transition count 844
Iterating global reduction 2 with 1 rules applied. Total rules applied 187 place count 533 transition count 844
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 2 with 4 rules applied. Total rules applied 191 place count 531 transition count 842
Applied a total of 191 rules in 238 ms. Remains 531 /629 variables (removed 98) and now considering 842/935 (removed 93) transitions.
[2022-05-19 04:18:57] [INFO ] Flow matrix only has 838 transitions (discarded 4 similar events)
// Phase 1: matrix 838 rows 531 cols
[2022-05-19 04:18:57] [INFO ] Computed 97 place invariants in 38 ms
[2022-05-19 04:18:57] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 531/629 places, 747/935 transitions.
Applied a total of 0 rules in 51 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 531/629 places, 747/935 transitions.
Normalized transition count is 743 out of 747 initially.
// Phase 1: matrix 743 rows 531 cols
[2022-05-19 04:18:57] [INFO ] Computed 97 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 47341 resets, run finished after 3568 ms. (steps per millisecond=280 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 4603 resets, run finished after 1016 ms. (steps per millisecond=984 ) properties (out of 1) seen :3
[2022-05-19 04:19:02] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-19 04:19:02] [INFO ] Computed 97 place invariants in 18 ms
[2022-05-19 04:19:02] [INFO ] [Real]Absence check using 90 positive place invariants in 15 ms returned sat
[2022-05-19 04:19:02] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 10 ms returned sat
[2022-05-19 04:19:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 04:19:02] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2022-05-19 04:19:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 04:19:02] [INFO ] [Nat]Absence check using 90 positive place invariants in 16 ms returned sat
[2022-05-19 04:19:02] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 13 ms returned sat
[2022-05-19 04:19:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 04:19:03] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2022-05-19 04:19:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 04:19:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 15 ms returned sat
[2022-05-19 04:19:03] [INFO ] Deduced a trap composed of 152 places in 180 ms of which 0 ms to minimize.
[2022-05-19 04:19:03] [INFO ] Deduced a trap composed of 173 places in 158 ms of which 0 ms to minimize.
[2022-05-19 04:19:03] [INFO ] Deduced a trap composed of 179 places in 156 ms of which 0 ms to minimize.
[2022-05-19 04:19:03] [INFO ] Deduced a trap composed of 161 places in 160 ms of which 1 ms to minimize.
[2022-05-19 04:19:04] [INFO ] Deduced a trap composed of 173 places in 160 ms of which 1 ms to minimize.
[2022-05-19 04:19:04] [INFO ] Deduced a trap composed of 164 places in 164 ms of which 1 ms to minimize.
[2022-05-19 04:19:04] [INFO ] Deduced a trap composed of 158 places in 154 ms of which 0 ms to minimize.
[2022-05-19 04:19:04] [INFO ] Deduced a trap composed of 170 places in 141 ms of which 0 ms to minimize.
[2022-05-19 04:19:05] [INFO ] Deduced a trap composed of 164 places in 150 ms of which 1 ms to minimize.
[2022-05-19 04:19:05] [INFO ] Deduced a trap composed of 161 places in 151 ms of which 0 ms to minimize.
[2022-05-19 04:19:05] [INFO ] Deduced a trap composed of 167 places in 153 ms of which 0 ms to minimize.
[2022-05-19 04:19:05] [INFO ] Deduced a trap composed of 158 places in 142 ms of which 0 ms to minimize.
[2022-05-19 04:19:05] [INFO ] Deduced a trap composed of 170 places in 143 ms of which 0 ms to minimize.
[2022-05-19 04:19:06] [INFO ] Deduced a trap composed of 167 places in 150 ms of which 0 ms to minimize.
[2022-05-19 04:19:06] [INFO ] Deduced a trap composed of 167 places in 143 ms of which 1 ms to minimize.
[2022-05-19 04:19:06] [INFO ] Deduced a trap composed of 164 places in 140 ms of which 0 ms to minimize.
[2022-05-19 04:19:06] [INFO ] Deduced a trap composed of 161 places in 155 ms of which 1 ms to minimize.
[2022-05-19 04:19:07] [INFO ] Deduced a trap composed of 158 places in 150 ms of which 0 ms to minimize.
[2022-05-19 04:19:07] [INFO ] Deduced a trap composed of 173 places in 143 ms of which 1 ms to minimize.
[2022-05-19 04:19:08] [INFO ] Deduced a trap composed of 173 places in 146 ms of which 1 ms to minimize.
[2022-05-19 04:19:08] [INFO ] Deduced a trap composed of 176 places in 151 ms of which 0 ms to minimize.
[2022-05-19 04:19:08] [INFO ] Deduced a trap composed of 161 places in 143 ms of which 1 ms to minimize.
[2022-05-19 04:19:08] [INFO ] Deduced a trap composed of 167 places in 153 ms of which 0 ms to minimize.
[2022-05-19 04:19:09] [INFO ] Deduced a trap composed of 173 places in 147 ms of which 0 ms to minimize.
[2022-05-19 04:19:10] [INFO ] Deduced a trap composed of 164 places in 148 ms of which 0 ms to minimize.
[2022-05-19 04:19:10] [INFO ] Deduced a trap composed of 167 places in 154 ms of which 0 ms to minimize.
[2022-05-19 04:19:13] [INFO ] Trap strengthening (SAT) tested/added 26/26 trap constraints in 10537 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 22 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 531/531 places, 747/747 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 28 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
[2022-05-19 04:19:13] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-19 04:19:13] [INFO ] Computed 97 place invariants in 10 ms
[2022-05-19 04:19:14] [INFO ] Implicit Places using invariants in 545 ms returned []
[2022-05-19 04:19:14] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-19 04:19:14] [INFO ] Computed 97 place invariants in 10 ms
[2022-05-19 04:19:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 04:19:16] [INFO ] Implicit Places using invariants and state equation in 1911 ms returned []
Implicit Place search using SMT with State Equation took 2461 ms to find 0 implicit places.
[2022-05-19 04:19:16] [INFO ] Redundant transitions in 49 ms returned []
[2022-05-19 04:19:16] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-19 04:19:16] [INFO ] Computed 97 place invariants in 14 ms
[2022-05-19 04:19:16] [INFO ] Dead Transitions using invariants and state equation in 415 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 531/531 places, 747/747 transitions.
Starting property specific reduction for PolyORBNT-COL-S05J40-UpperBounds-12
Normalized transition count is 743 out of 747 initially.
// Phase 1: matrix 743 rows 531 cols
[2022-05-19 04:19:16] [INFO ] Computed 97 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 475 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :3
[2022-05-19 04:19:16] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-19 04:19:16] [INFO ] Computed 97 place invariants in 19 ms
[2022-05-19 04:19:16] [INFO ] [Real]Absence check using 90 positive place invariants in 16 ms returned sat
[2022-05-19 04:19:16] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-19 04:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 04:19:17] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2022-05-19 04:19:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 04:19:17] [INFO ] [Nat]Absence check using 90 positive place invariants in 17 ms returned sat
[2022-05-19 04:19:17] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 13 ms returned sat
[2022-05-19 04:19:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 04:19:17] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2022-05-19 04:19:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 04:19:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 17 ms returned sat
[2022-05-19 04:19:17] [INFO ] Deduced a trap composed of 152 places in 158 ms of which 1 ms to minimize.
[2022-05-19 04:19:17] [INFO ] Deduced a trap composed of 173 places in 151 ms of which 0 ms to minimize.
[2022-05-19 04:19:18] [INFO ] Deduced a trap composed of 179 places in 151 ms of which 0 ms to minimize.
[2022-05-19 04:19:18] [INFO ] Deduced a trap composed of 161 places in 153 ms of which 1 ms to minimize.
[2022-05-19 04:19:18] [INFO ] Deduced a trap composed of 173 places in 144 ms of which 1 ms to minimize.
[2022-05-19 04:19:18] [INFO ] Deduced a trap composed of 164 places in 149 ms of which 1 ms to minimize.
[2022-05-19 04:19:18] [INFO ] Deduced a trap composed of 158 places in 150 ms of which 0 ms to minimize.
[2022-05-19 04:19:19] [INFO ] Deduced a trap composed of 170 places in 152 ms of which 0 ms to minimize.
[2022-05-19 04:19:19] [INFO ] Deduced a trap composed of 164 places in 169 ms of which 1 ms to minimize.
[2022-05-19 04:19:19] [INFO ] Deduced a trap composed of 161 places in 151 ms of which 1 ms to minimize.
[2022-05-19 04:19:19] [INFO ] Deduced a trap composed of 167 places in 146 ms of which 0 ms to minimize.
[2022-05-19 04:19:20] [INFO ] Deduced a trap composed of 158 places in 147 ms of which 1 ms to minimize.
[2022-05-19 04:19:20] [INFO ] Deduced a trap composed of 170 places in 143 ms of which 0 ms to minimize.
[2022-05-19 04:19:20] [INFO ] Deduced a trap composed of 167 places in 160 ms of which 1 ms to minimize.
[2022-05-19 04:19:20] [INFO ] Deduced a trap composed of 167 places in 146 ms of which 0 ms to minimize.
[2022-05-19 04:19:20] [INFO ] Deduced a trap composed of 164 places in 153 ms of which 1 ms to minimize.
[2022-05-19 04:19:21] [INFO ] Deduced a trap composed of 161 places in 145 ms of which 1 ms to minimize.
[2022-05-19 04:19:21] [INFO ] Deduced a trap composed of 158 places in 158 ms of which 1 ms to minimize.
[2022-05-19 04:19:22] [INFO ] Deduced a trap composed of 173 places in 146 ms of which 0 ms to minimize.
[2022-05-19 04:19:22] [INFO ] Trap strengthening (SAT) tested/added 19/19 trap constraints in 4613 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 29 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
[2022-05-19 04:19:22] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-19 04:19:22] [INFO ] Computed 97 place invariants in 9 ms
[2022-05-19 04:19:22] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 531/531 places, 747/747 transitions.
Normalized transition count is 743 out of 747 initially.
// Phase 1: matrix 743 rows 531 cols
[2022-05-19 04:19:22] [INFO ] Computed 97 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 47267 resets, run finished after 3455 ms. (steps per millisecond=289 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 4551 resets, run finished after 1010 ms. (steps per millisecond=990 ) properties (out of 1) seen :3
[2022-05-19 04:19:27] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-19 04:19:27] [INFO ] Computed 97 place invariants in 20 ms
[2022-05-19 04:19:27] [INFO ] [Real]Absence check using 90 positive place invariants in 16 ms returned sat
[2022-05-19 04:19:27] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 10 ms returned sat
[2022-05-19 04:19:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 04:19:27] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2022-05-19 04:19:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 04:19:27] [INFO ] [Nat]Absence check using 90 positive place invariants in 20 ms returned sat
[2022-05-19 04:19:27] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 14 ms returned sat
[2022-05-19 04:19:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 04:19:27] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2022-05-19 04:19:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 04:19:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 26 ms returned sat
[2022-05-19 04:19:27] [INFO ] Deduced a trap composed of 152 places in 149 ms of which 0 ms to minimize.
[2022-05-19 04:19:28] [INFO ] Deduced a trap composed of 173 places in 146 ms of which 0 ms to minimize.
[2022-05-19 04:19:28] [INFO ] Deduced a trap composed of 179 places in 148 ms of which 0 ms to minimize.
[2022-05-19 04:19:28] [INFO ] Deduced a trap composed of 161 places in 147 ms of which 0 ms to minimize.
[2022-05-19 04:19:28] [INFO ] Deduced a trap composed of 173 places in 162 ms of which 0 ms to minimize.
[2022-05-19 04:19:28] [INFO ] Deduced a trap composed of 164 places in 149 ms of which 0 ms to minimize.
[2022-05-19 04:19:29] [INFO ] Deduced a trap composed of 158 places in 146 ms of which 0 ms to minimize.
[2022-05-19 04:19:29] [INFO ] Deduced a trap composed of 170 places in 147 ms of which 0 ms to minimize.
[2022-05-19 04:19:29] [INFO ] Deduced a trap composed of 164 places in 147 ms of which 1 ms to minimize.
[2022-05-19 04:19:29] [INFO ] Deduced a trap composed of 161 places in 154 ms of which 2 ms to minimize.
[2022-05-19 04:19:30] [INFO ] Deduced a trap composed of 167 places in 149 ms of which 2 ms to minimize.
[2022-05-19 04:19:30] [INFO ] Deduced a trap composed of 158 places in 151 ms of which 1 ms to minimize.
[2022-05-19 04:19:30] [INFO ] Deduced a trap composed of 170 places in 151 ms of which 0 ms to minimize.
[2022-05-19 04:19:30] [INFO ] Deduced a trap composed of 167 places in 144 ms of which 0 ms to minimize.
[2022-05-19 04:19:30] [INFO ] Deduced a trap composed of 167 places in 153 ms of which 1 ms to minimize.
[2022-05-19 04:19:31] [INFO ] Deduced a trap composed of 164 places in 150 ms of which 0 ms to minimize.
[2022-05-19 04:19:31] [INFO ] Deduced a trap composed of 161 places in 154 ms of which 1 ms to minimize.
[2022-05-19 04:19:31] [INFO ] Deduced a trap composed of 158 places in 148 ms of which 0 ms to minimize.
[2022-05-19 04:19:32] [INFO ] Deduced a trap composed of 173 places in 151 ms of which 0 ms to minimize.
[2022-05-19 04:19:32] [INFO ] Deduced a trap composed of 173 places in 145 ms of which 0 ms to minimize.
[2022-05-19 04:19:32] [INFO ] Deduced a trap composed of 176 places in 144 ms of which 0 ms to minimize.
[2022-05-19 04:19:32] [INFO ] Deduced a trap composed of 161 places in 146 ms of which 0 ms to minimize.
[2022-05-19 04:19:33] [INFO ] Deduced a trap composed of 167 places in 151 ms of which 1 ms to minimize.
[2022-05-19 04:19:33] [INFO ] Deduced a trap composed of 173 places in 158 ms of which 1 ms to minimize.
[2022-05-19 04:19:34] [INFO ] Deduced a trap composed of 164 places in 152 ms of which 1 ms to minimize.
[2022-05-19 04:19:35] [INFO ] Deduced a trap composed of 167 places in 147 ms of which 1 ms to minimize.
[2022-05-19 04:19:38] [INFO ] Trap strengthening (SAT) tested/added 26/26 trap constraints in 10481 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 17 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 531/531 places, 747/747 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 16 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
[2022-05-19 04:19:38] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-19 04:19:38] [INFO ] Computed 97 place invariants in 9 ms
[2022-05-19 04:19:38] [INFO ] Implicit Places using invariants in 441 ms returned []
[2022-05-19 04:19:38] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-19 04:19:38] [INFO ] Computed 97 place invariants in 8 ms
[2022-05-19 04:19:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 04:19:40] [INFO ] Implicit Places using invariants and state equation in 1991 ms returned []
Implicit Place search using SMT with State Equation took 2443 ms to find 0 implicit places.
[2022-05-19 04:19:40] [INFO ] Redundant transitions in 27 ms returned []
[2022-05-19 04:19:40] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-19 04:19:40] [INFO ] Computed 97 place invariants in 8 ms
[2022-05-19 04:19:41] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 531/531 places, 747/747 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J40-UpperBounds-12 in 24507 ms.
[2022-05-19 04:19:41] [INFO ] Flatten gal took : 116 ms
[2022-05-19 04:19:41] [INFO ] Applying decomposition
[2022-05-19 04:19:41] [INFO ] Flatten gal took : 85 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5077868542488664802.txt' '-o' '/tmp/graph5077868542488664802.bin' '-w' '/tmp/graph5077868542488664802.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5077868542488664802.bin' '-l' '-1' '-v' '-w' '/tmp/graph5077868542488664802.weights' '-q' '0' '-e' '0.001'
[2022-05-19 04:19:41] [INFO ] Decomposing Gal with order
[2022-05-19 04:19:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 04:19:42] [INFO ] Removed a total of 721 redundant transitions.
[2022-05-19 04:19:42] [INFO ] Flatten gal took : 310 ms
[2022-05-19 04:19:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 328 labels/synchronizations in 31 ms.
[2022-05-19 04:19:42] [INFO ] Time to serialize gal into /tmp/UpperBounds7565136659586019552.gal : 26 ms
[2022-05-19 04:19:42] [INFO ] Time to serialize properties into /tmp/UpperBounds2443276789968622255.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7565136659586019552.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2443276789968622255.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...274
Loading property file /tmp/UpperBounds2443276789968622255.prop.
Detected timeout of ITS tools.
[2022-05-19 04:40:31] [INFO ] Applying decomposition
[2022-05-19 04:40:32] [INFO ] Flatten gal took : 1352 ms
[2022-05-19 04:40:32] [INFO ] Decomposing Gal with order
[2022-05-19 04:40:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 04:40:33] [INFO ] Removed a total of 2724 redundant transitions.
[2022-05-19 04:40:33] [INFO ] Flatten gal took : 610 ms
[2022-05-19 04:40:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 143 ms.
[2022-05-19 04:40:33] [INFO ] Time to serialize gal into /tmp/UpperBounds12447517826013716943.gal : 148 ms
[2022-05-19 04:40:33] [INFO ] Time to serialize properties into /tmp/UpperBounds5335788384844861833.prop : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12447517826013716943.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5335788384844861833.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds5335788384844861833.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.10827e+10,652.412,7766180,1.97968e+06,25,2.03422e+07,2754,1808,2.23089e+07,48,2479,0
Total reachable state count : 11082705900

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property PolyORBNT-COL-S05J40-UpperBounds-12 :0 <= QueueJobE.QueueJobE_0 <= 3
FORMULA PolyORBNT-COL-S05J40-UpperBounds-12 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBNT-COL-S05J40-UpperBounds-12,0,772.758,7777272,1,0,2.03422e+07,2754,3740,3.12279e+07,60,2479,54719
Total runtime 2081018 ms.

BK_STOP 1652936008624

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S05J40, 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 r168-tall-165277017100749"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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