Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.8K Feb 25 23:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 23:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 23:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 23:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 23:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 23:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 23:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 23:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 94K Mar 5 18:23 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-S05J60-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678874811619

Running Version 202205111006
[2023-03-15 10:06:52] [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]
[2023-03-15 10:06:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 10:06:52] [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.
[2023-03-15 10:06:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 10:06:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 632 ms
[2023-03-15 10:06:53] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 969 PT places and 2152.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2023-03-15 10:06:53] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 6 ms.
[2023-03-15 10:06:53] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-15 10:06:53] [INFO ] Computed 13 place invariants in 7 ms
FORMULA PolyORBNT-COL-S05J60-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 38 rows 48 cols
[2023-03-15 10:06:53] [INFO ] Computed 13 place invariants in 4 ms
[2023-03-15 10:06:53] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-15 10:06:53] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-15 10:06:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:53] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-15 10:06:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:53] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:53] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-15 10:06:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:06:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-15 10:06:53] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 3 ms to minimize.
[2023-03-15 10:06:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-15 10:06:53] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 10:06:54] [INFO ] Added : 36 causal constraints over 8 iterations in 131 ms. Result :sat
Minimization took 18 ms.
[2023-03-15 10:06:54] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:54] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-15 10:06:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:54] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-15 10:06:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:06:54] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:06:54] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2023-03-15 10:06:54] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:54] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:06:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:06:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:54] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-15 10:06:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 37 ms returned sat
[2023-03-15 10:06:54] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2023-03-15 10:06:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-15 10:06:54] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 10:06:54] [INFO ] Added : 20 causal constraints over 5 iterations in 30 ms. Result :sat
Minimization took 14 ms.
[2023-03-15 10:06:54] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:54] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-15 10:06:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:54] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-15 10:06:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:06:54] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2023-03-15 10:06:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-15 10:06:54] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:06:54] [INFO ] Added : 36 causal constraints over 8 iterations in 41 ms. Result :sat
Minimization took 13 ms.
[2023-03-15 10:06:54] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:54] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-15 10:06:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:54] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-15 10:06:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2023-03-15 10:06:54] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 10:06:54] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2023-03-15 10:06:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-15 10:06:54] [INFO ] Added : 36 causal constraints over 8 iterations in 149 ms. Result :sat
Minimization took 16 ms.
[2023-03-15 10:06:54] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:54] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:06:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:54] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:06:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:06:54] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2023-03-15 10:06:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-03-15 10:06:54] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:06:55] [INFO ] Added : 21 causal constraints over 5 iterations in 90 ms. Result :sat
Minimization took 13 ms.
[2023-03-15 10:06:55] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:06:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:55] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-15 10:06:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:55] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-15 10:06:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:06:55] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2023-03-15 10:06:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-15 10:06:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:06:55] [INFO ] Added : 13 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 8 ms.
[2023-03-15 10:06:55] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:06:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:55] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:06:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:55] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:06:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:06:55] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
[2023-03-15 10:06:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-03-15 10:06:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:06:55] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2023-03-15 10:06:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-03-15 10:06:55] [INFO ] Added : 36 causal constraints over 8 iterations in 164 ms. Result :sat
Minimization took 22 ms.
[2023-03-15 10:06:55] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:55] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:06:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-15 10:06:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:55] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-15 10:06:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 35 ms returned sat
[2023-03-15 10:06:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:06:55] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2023-03-15 10:06:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-15 10:06:55] [INFO ] Added : 36 causal constraints over 8 iterations in 85 ms. Result :sat
Minimization took 12 ms.
[2023-03-15 10:06:55] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:55] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:06:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2023-03-15 10:06:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:55] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-15 10:06:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:06:55] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2023-03-15 10:06:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-03-15 10:06:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:06:55] [INFO ] Added : 20 causal constraints over 5 iterations in 88 ms. Result :sat
Minimization took 46 ms.
[2023-03-15 10:06:56] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:06:56] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:56] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:06:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:06:56] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:56] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:06:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:06:56] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:06:56] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 5 ms.
[2023-03-15 10:06:56] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:56] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:56] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-15 10:06:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:06:56] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:56] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-15 10:06:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 34 ms returned sat
[2023-03-15 10:06:56] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 10:06:56] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2023-03-15 10:06:56] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2023-03-15 10:06:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 73 ms
[2023-03-15 10:06:56] [INFO ] Added : 23 causal constraints over 5 iterations in 484 ms. Result :sat
Minimization took 132 ms.
[2023-03-15 10:06:56] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:56] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:56] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:06:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:56] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:56] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-15 10:06:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:06:56] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2023-03-15 10:06:57] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 1 ms to minimize.
[2023-03-15 10:06:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 53 ms
[2023-03-15 10:06:57] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:06:57] [INFO ] Added : 36 causal constraints over 8 iterations in 44 ms. Result :sat
Minimization took 13 ms.
[2023-03-15 10:06:57] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:06:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:57] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:06:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-15 10:06:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:57] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-15 10:06:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:06:57] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2023-03-15 10:06:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-03-15 10:06:57] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:06:57] [INFO ] Added : 22 causal constraints over 5 iterations in 27 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [5, -1, 2, -1, -1, 3, 1, -1, -1, 4, -1, 10, -1, 4]
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.
[2023-03-15 10:06:57] [INFO ] Unfolded HLPN to a Petri net with 969 places and 2030 transitions 12704 arcs in 46 ms.
[2023-03-15 10:06:57] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Deduced a syphon composed of 60 places in 10 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 676 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 14) seen :24
FORMULA PolyORBNT-COL-S05J60-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 12) seen :17
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :12
Incomplete Best-First random walk after 10001 steps, including 158 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10001 steps, including 149 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :12
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :12
Incomplete Best-First random walk after 10001 steps, including 142 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :17
Incomplete Best-First random walk after 10001 steps, including 251 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :12
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :18
FORMULA PolyORBNT-COL-S05J60-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-15 10:06:57] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2023-03-15 10:06:57] [INFO ] Computed 142 place invariants in 113 ms
[2023-03-15 10:06:58] [INFO ] [Real]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-15 10:06:58] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-15 10:06:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:58] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2023-03-15 10:06:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:58] [INFO ] [Nat]Absence check using 135 positive place invariants in 35 ms returned sat
[2023-03-15 10:06:58] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-15 10:06:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:07:03] [INFO ] [Nat]Absence check using state equation in 4868 ms returned unknown
[2023-03-15 10:07:03] [INFO ] [Real]Absence check using 135 positive place invariants in 37 ms returned sat
[2023-03-15 10:07:03] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 7 ms returned unsat
[2023-03-15 10:07:03] [INFO ] [Real]Absence check using 135 positive place invariants in 35 ms returned sat
[2023-03-15 10:07:03] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 10:07:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:07:04] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2023-03-15 10:07:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:07:04] [INFO ] [Nat]Absence check using 135 positive place invariants in 35 ms returned sat
[2023-03-15 10:07:04] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 20 ms returned sat
[2023-03-15 10:07:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:07:05] [INFO ] [Nat]Absence check using state equation in 812 ms returned sat
[2023-03-15 10:07:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:07:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 121 ms returned sat
[2023-03-15 10:07:05] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 116 ms.
[2023-03-15 10:07:06] [INFO ] Deduced a trap composed of 504 places in 338 ms of which 1 ms to minimize.
[2023-03-15 10:07:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 478 ms
[2023-03-15 10:07:06] [INFO ] Added : 14 causal constraints over 3 iterations in 990 ms. Result :sat
Minimization took 908 ms.
[2023-03-15 10:07:07] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-15 10:07:07] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 17 ms returned unsat
[2023-03-15 10:07:07] [INFO ] [Real]Absence check using 135 positive place invariants in 33 ms returned sat
[2023-03-15 10:07:07] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 7 ms returned unsat
[2023-03-15 10:07:07] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-15 10:07:07] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 17 ms returned unsat
[2023-03-15 10:07:07] [INFO ] [Real]Absence check using 135 positive place invariants in 34 ms returned sat
[2023-03-15 10:07:07] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 6 ms returned unsat
[2023-03-15 10:07:07] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-15 10:07:07] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 7 ms returned unsat
[2023-03-15 10:07:08] [INFO ] [Real]Absence check using 135 positive place invariants in 34 ms returned sat
[2023-03-15 10:07:08] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-15 10:07:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:07:08] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2023-03-15 10:07:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:07:08] [INFO ] [Nat]Absence check using 135 positive place invariants in 34 ms returned sat
[2023-03-15 10:07:08] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 10:07:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:07:09] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2023-03-15 10:07:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 429 ms returned sat
[2023-03-15 10:07:09] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 102 ms.
[2023-03-15 10:07:10] [INFO ] Added : 17 causal constraints over 4 iterations in 583 ms. Result :sat
Minimization took 446 ms.
[2023-03-15 10:07:10] [INFO ] [Real]Absence check using 135 positive place invariants in 33 ms returned sat
[2023-03-15 10:07:10] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 7 ms returned unsat
[2023-03-15 10:07:11] [INFO ] [Real]Absence check using 135 positive place invariants in 33 ms returned sat
[2023-03-15 10:07:11] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 10:07:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:07:11] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2023-03-15 10:07:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:07:11] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2023-03-15 10:07:11] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-15 10:07:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:07:11] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2023-03-15 10:07:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 320 ms returned sat
[2023-03-15 10:07:12] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 83 ms.
[2023-03-15 10:07:13] [INFO ] Added : 18 causal constraints over 4 iterations in 735 ms. Result :sat
Minimization took 621 ms.
Current structural bounds on expressions (after SMT) : [5, 1, 2, 1, 1, 1, 1, 1, 10, 1, 4] Max seen :[4, 1, 0, 1, 1, 1, 1, 1, 3, 1, 3]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 308 out of 909 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 904 transition count 1249
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 137 place count 838 transition count 1249
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 137 place count 838 transition count 1185
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 265 place count 774 transition count 1185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 266 place count 773 transition count 1184
Iterating global reduction 2 with 1 rules applied. Total rules applied 267 place count 773 transition count 1184
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 271 place count 771 transition count 1182
Applied a total of 271 rules in 195 ms. Remains 771 /909 variables (removed 138) and now considering 1182/1315 (removed 133) transitions.
[2023-03-15 10:07:14] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
// Phase 1: matrix 1178 rows 771 cols
[2023-03-15 10:07:14] [INFO ] Computed 137 place invariants in 78 ms
[2023-03-15 10:07:14] [INFO ] Dead Transitions using invariants and state equation in 908 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 : 771/909 places, 1087/1315 transitions.
Applied a total of 0 rules in 37 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 771/909 places, 1087/1315 transitions.
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2023-03-15 10:07:15] [INFO ] Computed 137 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 47344 resets, run finished after 8419 ms. (steps per millisecond=118 ) properties (out of 4) seen :12
FORMULA PolyORBNT-COL-S05J60-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 978713 steps, including 3204 resets, run visited all 3 properties in 5001 ms. (steps per millisecond=195 )
Incomplete Best-First random walk after 1000000 steps, including 3407 resets, run finished after 1532 ms. (steps per millisecond=652 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 1000000 steps, including 3377 resets, run finished after 1524 ms. (steps per millisecond=656 ) properties (out of 3) seen :10
[2023-03-15 10:07:31] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-15 10:07:31] [INFO ] Computed 137 place invariants in 34 ms
[2023-03-15 10:07:31] [INFO ] [Real]Absence check using 130 positive place invariants in 26 ms returned sat
[2023-03-15 10:07:31] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-15 10:07:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:07:31] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2023-03-15 10:07:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:07:32] [INFO ] [Nat]Absence check using 130 positive place invariants in 27 ms returned sat
[2023-03-15 10:07:32] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 10:07:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:07:35] [INFO ] [Nat]Absence check using state equation in 3411 ms returned unsat
[2023-03-15 10:07:35] [INFO ] [Real]Absence check using 130 positive place invariants in 26 ms returned sat
[2023-03-15 10:07:35] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-15 10:07:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:07:36] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2023-03-15 10:07:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:07:36] [INFO ] [Nat]Absence check using 130 positive place invariants in 28 ms returned sat
[2023-03-15 10:07:36] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-15 10:07:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:07:36] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2023-03-15 10:07:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:07:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 277 ms returned sat
[2023-03-15 10:07:37] [INFO ] Deduced a trap composed of 230 places in 227 ms of which 1 ms to minimize.
[2023-03-15 10:07:37] [INFO ] Deduced a trap composed of 236 places in 225 ms of which 1 ms to minimize.
[2023-03-15 10:07:37] [INFO ] Deduced a trap composed of 242 places in 227 ms of which 0 ms to minimize.
[2023-03-15 10:07:38] [INFO ] Deduced a trap composed of 237 places in 222 ms of which 1 ms to minimize.
[2023-03-15 10:07:38] [INFO ] Deduced a trap composed of 227 places in 231 ms of which 1 ms to minimize.
[2023-03-15 10:07:38] [INFO ] Deduced a trap composed of 251 places in 223 ms of which 1 ms to minimize.
[2023-03-15 10:07:39] [INFO ] Deduced a trap composed of 237 places in 223 ms of which 1 ms to minimize.
[2023-03-15 10:07:42] [INFO ] Trap strengthening (SAT) tested/added 7/7 trap constraints in 5209 ms
[2023-03-15 10:07:42] [INFO ] [Real]Absence check using 130 positive place invariants in 26 ms returned sat
[2023-03-15 10:07:42] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-15 10:07:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:07:42] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2023-03-15 10:07:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:07:42] [INFO ] [Nat]Absence check using 130 positive place invariants in 26 ms returned sat
[2023-03-15 10:07:42] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-15 10:07:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:07:43] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2023-03-15 10:07:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 216 ms returned sat
[2023-03-15 10:07:43] [INFO ] Deduced a trap composed of 242 places in 222 ms of which 1 ms to minimize.
[2023-03-15 10:07:43] [INFO ] Deduced a trap composed of 242 places in 235 ms of which 1 ms to minimize.
[2023-03-15 10:07:44] [INFO ] Deduced a trap composed of 230 places in 237 ms of which 1 ms to minimize.
[2023-03-15 10:07:44] [INFO ] Deduced a trap composed of 242 places in 237 ms of which 1 ms to minimize.
[2023-03-15 10:07:44] [INFO ] Deduced a trap composed of 239 places in 234 ms of which 2 ms to minimize.
[2023-03-15 10:07:44] [INFO ] Deduced a trap composed of 248 places in 235 ms of which 1 ms to minimize.
[2023-03-15 10:07:45] [INFO ] Deduced a trap composed of 239 places in 235 ms of which 0 ms to minimize.
[2023-03-15 10:07:45] [INFO ] Deduced a trap composed of 227 places in 240 ms of which 1 ms to minimize.
[2023-03-15 10:07:45] [INFO ] Deduced a trap composed of 224 places in 252 ms of which 1 ms to minimize.
[2023-03-15 10:07:46] [INFO ] Deduced a trap composed of 242 places in 242 ms of which 1 ms to minimize.
[2023-03-15 10:07:46] [INFO ] Deduced a trap composed of 251 places in 235 ms of which 1 ms to minimize.
[2023-03-15 10:07:46] [INFO ] Deduced a trap composed of 242 places in 227 ms of which 1 ms to minimize.
[2023-03-15 10:07:47] [INFO ] Deduced a trap composed of 242 places in 226 ms of which 0 ms to minimize.
[2023-03-15 10:07:47] [INFO ] Deduced a trap composed of 239 places in 218 ms of which 0 ms to minimize.
[2023-03-15 10:07:47] [INFO ] Deduced a trap composed of 236 places in 229 ms of which 1 ms to minimize.
[2023-03-15 10:07:49] [INFO ] Deduced a trap composed of 248 places in 238 ms of which 1 ms to minimize.
[2023-03-15 10:07:49] [INFO ] Deduced a trap composed of 245 places in 244 ms of which 1 ms to minimize.
[2023-03-15 10:07:50] [INFO ] Deduced a trap composed of 233 places in 234 ms of which 1 ms to minimize.
[2023-03-15 10:07:50] [INFO ] Deduced a trap composed of 242 places in 243 ms of which 0 ms to minimize.
[2023-03-15 10:07:51] [INFO ] Deduced a trap composed of 230 places in 237 ms of which 1 ms to minimize.
[2023-03-15 10:07:51] [INFO ] Deduced a trap composed of 221 places in 239 ms of which 0 ms to minimize.
[2023-03-15 10:07:52] [INFO ] Deduced a trap composed of 239 places in 236 ms of which 1 ms to minimize.
[2023-03-15 10:07:52] [INFO ] Deduced a trap composed of 248 places in 239 ms of which 0 ms to minimize.
[2023-03-15 10:07:52] [INFO ] Deduced a trap composed of 230 places in 235 ms of which 1 ms to minimize.
[2023-03-15 10:07:53] [INFO ] Deduced a trap composed of 233 places in 242 ms of which 1 ms to minimize.
[2023-03-15 10:07:54] [INFO ] Deduced a trap composed of 245 places in 220 ms of which 1 ms to minimize.
[2023-03-15 10:07:54] [INFO ] Deduced a trap composed of 230 places in 238 ms of which 1 ms to minimize.
[2023-03-15 10:07:57] [INFO ] Trap strengthening (SAT) tested/added 27/27 trap constraints in 14222 ms
Current structural bounds on expressions (after SMT) : [4, 10, 4] Max seen :[4, 3, 3]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 771 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 31 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 1087/1087 transitions.
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2023-03-15 10:07:57] [INFO ] Computed 137 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 47394 resets, run finished after 4711 ms. (steps per millisecond=212 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000000 steps, including 3355 resets, run finished after 1323 ms. (steps per millisecond=755 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 3392 resets, run finished after 1312 ms. (steps per millisecond=762 ) properties (out of 2) seen :6
[2023-03-15 10:08:04] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-15 10:08:04] [INFO ] Computed 137 place invariants in 24 ms
[2023-03-15 10:08:05] [INFO ] [Real]Absence check using 130 positive place invariants in 25 ms returned sat
[2023-03-15 10:08:05] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-15 10:08:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:08:05] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2023-03-15 10:08:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:08:05] [INFO ] [Nat]Absence check using 130 positive place invariants in 28 ms returned sat
[2023-03-15 10:08:05] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 10:08:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:08:05] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2023-03-15 10:08:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:08:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 275 ms returned sat
[2023-03-15 10:08:06] [INFO ] Deduced a trap composed of 230 places in 213 ms of which 1 ms to minimize.
[2023-03-15 10:08:06] [INFO ] Deduced a trap composed of 236 places in 243 ms of which 0 ms to minimize.
[2023-03-15 10:08:07] [INFO ] Deduced a trap composed of 242 places in 243 ms of which 0 ms to minimize.
[2023-03-15 10:08:07] [INFO ] Deduced a trap composed of 237 places in 236 ms of which 1 ms to minimize.
[2023-03-15 10:08:07] [INFO ] Deduced a trap composed of 227 places in 231 ms of which 1 ms to minimize.
[2023-03-15 10:08:08] [INFO ] Deduced a trap composed of 251 places in 236 ms of which 0 ms to minimize.
[2023-03-15 10:08:08] [INFO ] Deduced a trap composed of 237 places in 254 ms of which 6 ms to minimize.
[2023-03-15 10:08:11] [INFO ] Trap strengthening (SAT) tested/added 7/7 trap constraints in 5287 ms
[2023-03-15 10:08:11] [INFO ] [Real]Absence check using 130 positive place invariants in 28 ms returned sat
[2023-03-15 10:08:11] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-15 10:08:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:08:12] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2023-03-15 10:08:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:08:12] [INFO ] [Nat]Absence check using 130 positive place invariants in 25 ms returned sat
[2023-03-15 10:08:12] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-15 10:08:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:08:12] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2023-03-15 10:08:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 216 ms returned sat
[2023-03-15 10:08:12] [INFO ] Deduced a trap composed of 242 places in 236 ms of which 1 ms to minimize.
[2023-03-15 10:08:13] [INFO ] Deduced a trap composed of 242 places in 234 ms of which 1 ms to minimize.
[2023-03-15 10:08:13] [INFO ] Deduced a trap composed of 230 places in 239 ms of which 0 ms to minimize.
[2023-03-15 10:08:13] [INFO ] Deduced a trap composed of 242 places in 236 ms of which 1 ms to minimize.
[2023-03-15 10:08:14] [INFO ] Deduced a trap composed of 239 places in 248 ms of which 0 ms to minimize.
[2023-03-15 10:08:14] [INFO ] Deduced a trap composed of 248 places in 244 ms of which 1 ms to minimize.
[2023-03-15 10:08:14] [INFO ] Deduced a trap composed of 239 places in 243 ms of which 1 ms to minimize.
[2023-03-15 10:08:14] [INFO ] Deduced a trap composed of 227 places in 244 ms of which 1 ms to minimize.
[2023-03-15 10:08:15] [INFO ] Deduced a trap composed of 224 places in 237 ms of which 1 ms to minimize.
[2023-03-15 10:08:15] [INFO ] Deduced a trap composed of 242 places in 212 ms of which 1 ms to minimize.
[2023-03-15 10:08:15] [INFO ] Deduced a trap composed of 251 places in 243 ms of which 2 ms to minimize.
[2023-03-15 10:08:16] [INFO ] Deduced a trap composed of 242 places in 253 ms of which 6 ms to minimize.
[2023-03-15 10:08:16] [INFO ] Deduced a trap composed of 242 places in 236 ms of which 2 ms to minimize.
[2023-03-15 10:08:16] [INFO ] Deduced a trap composed of 239 places in 233 ms of which 1 ms to minimize.
[2023-03-15 10:08:17] [INFO ] Deduced a trap composed of 236 places in 242 ms of which 0 ms to minimize.
[2023-03-15 10:08:18] [INFO ] Deduced a trap composed of 248 places in 233 ms of which 1 ms to minimize.
[2023-03-15 10:08:19] [INFO ] Deduced a trap composed of 245 places in 232 ms of which 1 ms to minimize.
[2023-03-15 10:08:19] [INFO ] Deduced a trap composed of 233 places in 242 ms of which 0 ms to minimize.
[2023-03-15 10:08:20] [INFO ] Deduced a trap composed of 242 places in 223 ms of which 1 ms to minimize.
[2023-03-15 10:08:20] [INFO ] Deduced a trap composed of 230 places in 240 ms of which 1 ms to minimize.
[2023-03-15 10:08:21] [INFO ] Deduced a trap composed of 221 places in 239 ms of which 0 ms to minimize.
[2023-03-15 10:08:21] [INFO ] Deduced a trap composed of 239 places in 242 ms of which 1 ms to minimize.
[2023-03-15 10:08:21] [INFO ] Deduced a trap composed of 248 places in 223 ms of which 1 ms to minimize.
[2023-03-15 10:08:22] [INFO ] Deduced a trap composed of 230 places in 222 ms of which 0 ms to minimize.
[2023-03-15 10:08:23] [INFO ] Deduced a trap composed of 233 places in 241 ms of which 0 ms to minimize.
[2023-03-15 10:08:23] [INFO ] Deduced a trap composed of 245 places in 228 ms of which 0 ms to minimize.
[2023-03-15 10:08:23] [INFO ] Deduced a trap composed of 230 places in 223 ms of which 1 ms to minimize.
[2023-03-15 10:08:26] [INFO ] Trap strengthening (SAT) tested/added 27/27 trap constraints in 14202 ms
Current structural bounds on expressions (after SMT) : [10, 4] Max seen :[3, 3]
Support contains 2 out of 771 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 31 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 1087/1087 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 30 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2023-03-15 10:08:26] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-15 10:08:27] [INFO ] Computed 137 place invariants in 24 ms
[2023-03-15 10:08:27] [INFO ] Implicit Places using invariants in 794 ms returned []
[2023-03-15 10:08:27] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-15 10:08:27] [INFO ] Computed 137 place invariants in 19 ms
[2023-03-15 10:08:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:08:31] [INFO ] Implicit Places using invariants and state equation in 3854 ms returned []
Implicit Place search using SMT with State Equation took 4650 ms to find 0 implicit places.
[2023-03-15 10:08:31] [INFO ] Redundant transitions in 76 ms returned []
[2023-03-15 10:08:31] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-15 10:08:31] [INFO ] Computed 137 place invariants in 20 ms
[2023-03-15 10:08:32] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 1087/1087 transitions.
Starting property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-12
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2023-03-15 10:08:32] [INFO ] Computed 137 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 470 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :3
[2023-03-15 10:08:32] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-15 10:08:32] [INFO ] Computed 137 place invariants in 25 ms
[2023-03-15 10:08:32] [INFO ] [Real]Absence check using 130 positive place invariants in 26 ms returned sat
[2023-03-15 10:08:32] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-15 10:08:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:08:33] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2023-03-15 10:08:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:08:33] [INFO ] [Nat]Absence check using 130 positive place invariants in 29 ms returned sat
[2023-03-15 10:08:33] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 10:08:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:08:33] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2023-03-15 10:08:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:08:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 290 ms returned sat
[2023-03-15 10:08:34] [INFO ] Deduced a trap composed of 230 places in 223 ms of which 1 ms to minimize.
[2023-03-15 10:08:34] [INFO ] Deduced a trap composed of 236 places in 227 ms of which 0 ms to minimize.
[2023-03-15 10:08:34] [INFO ] Deduced a trap composed of 242 places in 231 ms of which 0 ms to minimize.
[2023-03-15 10:08:35] [INFO ] Deduced a trap composed of 237 places in 239 ms of which 0 ms to minimize.
[2023-03-15 10:08:35] [INFO ] Deduced a trap composed of 227 places in 220 ms of which 1 ms to minimize.
[2023-03-15 10:08:35] [INFO ] Deduced a trap composed of 251 places in 217 ms of which 1 ms to minimize.
[2023-03-15 10:08:36] [INFO ] Deduced a trap composed of 237 places in 219 ms of which 0 ms to minimize.
[2023-03-15 10:08:38] [INFO ] Trap strengthening (SAT) tested/added 7/7 trap constraints in 4250 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 28 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2023-03-15 10:08:38] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-15 10:08:38] [INFO ] Computed 137 place invariants in 17 ms
[2023-03-15 10:08:38] [INFO ] Dead Transitions using invariants and state equation in 732 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 1087/1087 transitions.
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2023-03-15 10:08:38] [INFO ] Computed 137 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 47159 resets, run finished after 4390 ms. (steps per millisecond=227 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 3307 resets, run finished after 1210 ms. (steps per millisecond=826 ) properties (out of 1) seen :3
[2023-03-15 10:08:44] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-15 10:08:44] [INFO ] Computed 137 place invariants in 24 ms
[2023-03-15 10:08:44] [INFO ] [Real]Absence check using 130 positive place invariants in 27 ms returned sat
[2023-03-15 10:08:44] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-15 10:08:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:08:45] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2023-03-15 10:08:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:08:45] [INFO ] [Nat]Absence check using 130 positive place invariants in 27 ms returned sat
[2023-03-15 10:08:45] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 10:08:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:08:45] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2023-03-15 10:08:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:08:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 269 ms returned sat
[2023-03-15 10:08:46] [INFO ] Deduced a trap composed of 230 places in 220 ms of which 0 ms to minimize.
[2023-03-15 10:08:46] [INFO ] Deduced a trap composed of 236 places in 224 ms of which 1 ms to minimize.
[2023-03-15 10:08:46] [INFO ] Deduced a trap composed of 242 places in 231 ms of which 0 ms to minimize.
[2023-03-15 10:08:47] [INFO ] Deduced a trap composed of 237 places in 213 ms of which 0 ms to minimize.
[2023-03-15 10:08:47] [INFO ] Deduced a trap composed of 227 places in 220 ms of which 1 ms to minimize.
[2023-03-15 10:08:47] [INFO ] Deduced a trap composed of 251 places in 214 ms of which 1 ms to minimize.
[2023-03-15 10:08:48] [INFO ] Deduced a trap composed of 237 places in 223 ms of which 1 ms to minimize.
[2023-03-15 10:08:51] [INFO ] Trap strengthening (SAT) tested/added 7/7 trap constraints in 5151 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 27 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 1087/1087 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 25 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2023-03-15 10:08:51] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-15 10:08:51] [INFO ] Computed 137 place invariants in 22 ms
[2023-03-15 10:08:51] [INFO ] Implicit Places using invariants in 739 ms returned []
[2023-03-15 10:08:51] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-15 10:08:51] [INFO ] Computed 137 place invariants in 16 ms
[2023-03-15 10:08:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:08:53] [INFO ] Implicit Places using invariants and state equation in 2059 ms returned []
Implicit Place search using SMT with State Equation took 2801 ms to find 0 implicit places.
[2023-03-15 10:08:53] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-15 10:08:53] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-15 10:08:54] [INFO ] Computed 137 place invariants in 23 ms
[2023-03-15 10:08:54] [INFO ] Dead Transitions using invariants and state equation in 715 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 1087/1087 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-12 in 22242 ms.
Starting property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-14
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2023-03-15 10:08:54] [INFO ] Computed 137 place invariants in 16 ms
Incomplete random walk after 10000 steps, including 464 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :3
[2023-03-15 10:08:54] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-15 10:08:54] [INFO ] Computed 137 place invariants in 23 ms
[2023-03-15 10:08:54] [INFO ] [Real]Absence check using 130 positive place invariants in 25 ms returned sat
[2023-03-15 10:08:54] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-15 10:08:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:08:55] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2023-03-15 10:08:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:08:55] [INFO ] [Nat]Absence check using 130 positive place invariants in 25 ms returned sat
[2023-03-15 10:08:55] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-15 10:08:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:08:55] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2023-03-15 10:08:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:08:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 214 ms returned sat
[2023-03-15 10:08:56] [INFO ] Deduced a trap composed of 242 places in 223 ms of which 0 ms to minimize.
[2023-03-15 10:08:56] [INFO ] Deduced a trap composed of 242 places in 217 ms of which 1 ms to minimize.
[2023-03-15 10:08:56] [INFO ] Deduced a trap composed of 230 places in 216 ms of which 0 ms to minimize.
[2023-03-15 10:08:56] [INFO ] Deduced a trap composed of 242 places in 222 ms of which 0 ms to minimize.
[2023-03-15 10:08:57] [INFO ] Deduced a trap composed of 239 places in 219 ms of which 0 ms to minimize.
[2023-03-15 10:08:57] [INFO ] Deduced a trap composed of 248 places in 218 ms of which 1 ms to minimize.
[2023-03-15 10:08:57] [INFO ] Deduced a trap composed of 239 places in 218 ms of which 0 ms to minimize.
[2023-03-15 10:08:57] [INFO ] Deduced a trap composed of 227 places in 223 ms of which 1 ms to minimize.
[2023-03-15 10:08:58] [INFO ] Deduced a trap composed of 224 places in 210 ms of which 0 ms to minimize.
[2023-03-15 10:08:58] [INFO ] Deduced a trap composed of 242 places in 232 ms of which 0 ms to minimize.
[2023-03-15 10:08:58] [INFO ] Deduced a trap composed of 251 places in 219 ms of which 0 ms to minimize.
[2023-03-15 10:08:59] [INFO ] Deduced a trap composed of 242 places in 211 ms of which 0 ms to minimize.
[2023-03-15 10:08:59] [INFO ] Deduced a trap composed of 242 places in 217 ms of which 1 ms to minimize.
[2023-03-15 10:08:59] [INFO ] Deduced a trap composed of 239 places in 219 ms of which 1 ms to minimize.
[2023-03-15 10:09:00] [INFO ] Deduced a trap composed of 236 places in 224 ms of which 1 ms to minimize.
[2023-03-15 10:09:00] [INFO ] Trap strengthening (SAT) tested/added 15/15 trap constraints in 4407 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 771/771 places, 1087/1087 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 771 transition count 1086
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 770 transition count 1086
Applied a total of 2 rules in 30 ms. Remains 770 /771 variables (removed 1) and now considering 1086/1087 (removed 1) transitions.
[2023-03-15 10:09:00] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-15 10:09:00] [INFO ] Computed 137 place invariants in 20 ms
[2023-03-15 10:09:01] [INFO ] Dead Transitions using invariants and state equation in 727 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 770/771 places, 1086/1087 transitions.
Normalized transition count is 1082 out of 1086 initially.
// Phase 1: matrix 1082 rows 770 cols
[2023-03-15 10:09:01] [INFO ] Computed 137 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 51900 resets, run finished after 4701 ms. (steps per millisecond=212 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 3411 resets, run finished after 1233 ms. (steps per millisecond=811 ) properties (out of 1) seen :3
[2023-03-15 10:09:07] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-15 10:09:07] [INFO ] Computed 137 place invariants in 20 ms
[2023-03-15 10:09:07] [INFO ] [Real]Absence check using 130 positive place invariants in 25 ms returned sat
[2023-03-15 10:09:07] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 20 ms returned sat
[2023-03-15 10:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:09:07] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2023-03-15 10:09:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:09:07] [INFO ] [Nat]Absence check using 130 positive place invariants in 26 ms returned sat
[2023-03-15 10:09:07] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-15 10:09:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:09:07] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2023-03-15 10:09:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:09:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 287 ms returned sat
[2023-03-15 10:09:08] [INFO ] Deduced a trap composed of 152 places in 247 ms of which 0 ms to minimize.
[2023-03-15 10:09:08] [INFO ] Deduced a trap composed of 230 places in 229 ms of which 1 ms to minimize.
[2023-03-15 10:09:09] [INFO ] Deduced a trap composed of 240 places in 222 ms of which 1 ms to minimize.
[2023-03-15 10:09:09] [INFO ] Deduced a trap composed of 243 places in 227 ms of which 1 ms to minimize.
[2023-03-15 10:09:09] [INFO ] Deduced a trap composed of 233 places in 226 ms of which 1 ms to minimize.
[2023-03-15 10:09:09] [INFO ] Deduced a trap composed of 242 places in 229 ms of which 1 ms to minimize.
[2023-03-15 10:09:10] [INFO ] Deduced a trap composed of 246 places in 225 ms of which 1 ms to minimize.
[2023-03-15 10:09:10] [INFO ] Deduced a trap composed of 304 places in 231 ms of which 1 ms to minimize.
[2023-03-15 10:09:10] [INFO ] Deduced a trap composed of 302 places in 228 ms of which 1 ms to minimize.
[2023-03-15 10:09:11] [INFO ] Deduced a trap composed of 251 places in 231 ms of which 0 ms to minimize.
[2023-03-15 10:09:12] [INFO ] Deduced a trap composed of 258 places in 229 ms of which 0 ms to minimize.
[2023-03-15 10:09:12] [INFO ] Deduced a trap composed of 236 places in 228 ms of which 1 ms to minimize.
[2023-03-15 10:09:13] [INFO ] Deduced a trap composed of 239 places in 247 ms of which 1 ms to minimize.
[2023-03-15 10:09:13] [INFO ] Deduced a trap composed of 233 places in 223 ms of which 1 ms to minimize.
[2023-03-15 10:09:14] [INFO ] Deduced a trap composed of 245 places in 213 ms of which 0 ms to minimize.
[2023-03-15 10:09:14] [INFO ] Deduced a trap composed of 243 places in 228 ms of which 0 ms to minimize.
[2023-03-15 10:09:15] [INFO ] Deduced a trap composed of 242 places in 227 ms of which 1 ms to minimize.
[2023-03-15 10:09:15] [INFO ] Deduced a trap composed of 233 places in 229 ms of which 1 ms to minimize.
[2023-03-15 10:09:15] [INFO ] Deduced a trap composed of 224 places in 223 ms of which 1 ms to minimize.
[2023-03-15 10:09:16] [INFO ] Deduced a trap composed of 251 places in 217 ms of which 1 ms to minimize.
[2023-03-15 10:09:16] [INFO ] Deduced a trap composed of 233 places in 215 ms of which 0 ms to minimize.
[2023-03-15 10:09:16] [INFO ] Deduced a trap composed of 239 places in 219 ms of which 1 ms to minimize.
[2023-03-15 10:09:17] [INFO ] Deduced a trap composed of 233 places in 219 ms of which 1 ms to minimize.
[2023-03-15 10:09:20] [INFO ] Trap strengthening (SAT) tested/added 23/23 trap constraints in 11925 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 29 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 24 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2023-03-15 10:09:20] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-15 10:09:20] [INFO ] Computed 137 place invariants in 26 ms
[2023-03-15 10:09:20] [INFO ] Implicit Places using invariants in 757 ms returned []
[2023-03-15 10:09:20] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-15 10:09:21] [INFO ] Computed 137 place invariants in 21 ms
[2023-03-15 10:09:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:09:25] [INFO ] Implicit Places using invariants and state equation in 4140 ms returned []
Implicit Place search using SMT with State Equation took 4899 ms to find 0 implicit places.
[2023-03-15 10:09:25] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-15 10:09:25] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-15 10:09:25] [INFO ] Computed 137 place invariants in 19 ms
[2023-03-15 10:09:25] [INFO ] Dead Transitions using invariants and state equation in 715 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 770/770 places, 1086/1086 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-14 in 31183 ms.
[2023-03-15 10:09:26] [INFO ] Flatten gal took : 151 ms
[2023-03-15 10:09:26] [INFO ] Applying decomposition
[2023-03-15 10:09:26] [INFO ] Flatten gal took : 111 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/graph8314774731120464268.txt' '-o' '/tmp/graph8314774731120464268.bin' '-w' '/tmp/graph8314774731120464268.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8314774731120464268.bin' '-l' '-1' '-v' '-w' '/tmp/graph8314774731120464268.weights' '-q' '0' '-e' '0.001'
[2023-03-15 10:09:26] [INFO ] Decomposing Gal with order
[2023-03-15 10:09:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 10:09:27] [INFO ] Removed a total of 1081 redundant transitions.
[2023-03-15 10:09:27] [INFO ] Flatten gal took : 503 ms
[2023-03-15 10:09:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 494 labels/synchronizations in 81 ms.
[2023-03-15 10:09:27] [INFO ] Time to serialize gal into /tmp/UpperBounds6022846144698139294.gal : 29 ms
[2023-03-15 10:09:27] [INFO ] Time to serialize properties into /tmp/UpperBounds2035563645108412689.prop : 1 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/UpperBounds6022846144698139294.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2035563645108412689.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/UpperBounds2035563645108412689.prop.
Detected timeout of ITS tools.
[2023-03-15 10:30:20] [INFO ] Applying decomposition
[2023-03-15 10:30:20] [INFO ] Flatten gal took : 369 ms
[2023-03-15 10:30:21] [INFO ] Decomposing Gal with order
[2023-03-15 10:30:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 10:30:23] [INFO ] Removed a total of 3944 redundant transitions.
[2023-03-15 10:30:23] [INFO ] Flatten gal took : 1731 ms
[2023-03-15 10:30:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 118 ms.
[2023-03-15 10:30:24] [INFO ] Time to serialize gal into /tmp/UpperBounds9297948663162711924.gal : 68 ms
[2023-03-15 10:30:24] [INFO ] Time to serialize properties into /tmp/UpperBounds5704745710804826364.prop : 3 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/UpperBounds9297948663162711924.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5704745710804826364.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/UpperBounds5704745710804826364.prop.
Detected timeout of ITS tools.
[2023-03-15 10:51:17] [INFO ] Flatten gal took : 836 ms
[2023-03-15 10:51:19] [INFO ] Input system was already deterministic with 1087 transitions.
[2023-03-15 10:51:20] [INFO ] Transformed 771 places.
[2023-03-15 10:51:20] [INFO ] Transformed 1087 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-15 10:51:50] [INFO ] Time to serialize gal into /tmp/UpperBounds15984097685782691476.gal : 9 ms
[2023-03-15 10:51:50] [INFO ] Time to serialize properties into /tmp/UpperBounds1935738978720902952.prop : 21 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/UpperBounds15984097685782691476.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1935738978720902952.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

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...341
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds1935738978720902952.prop.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is PolyORBNT-COL-S05J60, 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 r319-tall-167873969900083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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