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-167873969900082.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-S05J40, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r319-tall-167873969900082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.5K Feb 25 23:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 23:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 23:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 23:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 23:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 23:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 23:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 23:33 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 93K 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-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 1678874783761

Running Version 202205111006
[2023-03-15 10:06:24] [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:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 10:06:25] [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:25] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 10:06:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 686 ms
[2023-03-15 10:06:25] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 669 PT places and 1712.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-15 10:06:25] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2023-03-15 10:06:25] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-15 10:06:25] [INFO ] Computed 13 place invariants in 8 ms
FORMULA PolyORBNT-COL-S05J40-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-UpperBounds-07 41 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 38 rows 48 cols
[2023-03-15 10:06:25] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-15 10:06:26] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-15 10:06:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-15 10:06:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:26] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-15 10:06:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:26] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:26] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-15 10:06:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 10:06:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2023-03-15 10:06:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 10:06:26] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 3 ms to minimize.
[2023-03-15 10:06:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-15 10:06:26] [INFO ] Added : 36 causal constraints over 8 iterations in 107 ms. Result :sat
Minimization took 14 ms.
[2023-03-15 10:06:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:26] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:06:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:06:26] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:26] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-15 10:06:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:06:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-15 10:06:26] [INFO ] Added : 4 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 8 ms.
[2023-03-15 10:06:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:26] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-15 10:06:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:26] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:26] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-15 10:06:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:06:26] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2023-03-15 10:06:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-15 10:06:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:06:26] [INFO ] Added : 36 causal constraints over 8 iterations in 125 ms. Result :sat
Minimization took 13 ms.
[2023-03-15 10:06:26] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:06:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:26] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-15 10:06:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:26] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:26] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-15 10:06:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:06:26] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 12 ms to minimize.
[2023-03-15 10:06:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-15 10:06:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 10:06:26] [INFO ] Added : 15 causal constraints over 4 iterations in 36 ms. Result :sat
Minimization took 9 ms.
[2023-03-15 10:06:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:26] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-15 10:06:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:26] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:26] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-15 10:06:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:06:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 10:06:26] [INFO ] Added : 2 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 10:06:27] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:06:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-15 10:06:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:27] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-15 10:06:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-15 10:06:27] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 10:06:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:27] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-15 10:06:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:06:27] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2023-03-15 10:06:27] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2023-03-15 10:06:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 58 ms
[2023-03-15 10:06:27] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:06:27] [INFO ] Added : 36 causal constraints over 8 iterations in 48 ms. Result :sat
Minimization took 14 ms.
[2023-03-15 10:06:27] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-15 10:06:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:27] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:06:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:27] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:27] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-15 10:06:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2023-03-15 10:06:27] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2023-03-15 10:06:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-15 10:06:27] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:06:27] [INFO ] Added : 21 causal constraints over 5 iterations in 24 ms. Result :sat
Minimization took 49 ms.
[2023-03-15 10:06:27] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-15 10:06:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:27] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-15 10:06:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:27] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:27] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-15 10:06:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:06:27] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 10:06:27] [INFO ] Added : 21 causal constraints over 5 iterations in 320 ms. Result :sat
Minimization took 61 ms.
[2023-03-15 10:06:27] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:06:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:27] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-15 10:06:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:28] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:28] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:06:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-15 10:06:28] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2023-03-15 10:06:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-15 10:06:28] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 10:06:28] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2023-03-15 10:06:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-15 10:06:28] [INFO ] Added : 36 causal constraints over 8 iterations in 157 ms. Result :sat
Minimization took 16 ms.
[2023-03-15 10:06:28] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:06:28] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2023-03-15 10:06:28] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2023-03-15 10:06:28] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:28] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 10:06:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-15 10:06:28] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:28] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:06:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:06:28] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:06:28] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 7 ms.
[2023-03-15 10:06:28] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:28] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:28] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:06:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:28] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:28] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-15 10:06:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 41 ms returned sat
[2023-03-15 10:06:28] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-15 10:06:28] [INFO ] Added : 36 causal constraints over 8 iterations in 44 ms. Result :sat
Minimization took 23 ms.
[2023-03-15 10:06:28] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 10:06:28] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:28] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 10:06:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 10:06:28] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 10:06:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:28] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-15 10:06:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-15 10:06:28] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 0 ms to minimize.
[2023-03-15 10:06:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-03-15 10:06:28] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 10:06:28] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2023-03-15 10:06:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-15 10:06:28] [INFO ] Added : 36 causal constraints over 8 iterations in 79 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, 1, -1, -1, 3, 5, -1, 3, -1, -1, 1]
FORMULA PolyORBNT-COL-S05J40-UpperBounds-11 3 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.
[2023-03-15 10:06:28] [INFO ] Unfolded HLPN to a Petri net with 669 places and 1630 transitions 10784 arcs in 50 ms.
[2023-03-15 10:06:28] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Deduced a syphon composed of 40 places in 8 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 687 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 12) seen :17
FORMULA PolyORBNT-COL-S05J40-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 144 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :12
Incomplete Best-First random walk after 10001 steps, including 250 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :12
Incomplete Best-First random walk after 10000 steps, including 250 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10000 steps, including 117 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :12
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :12
Incomplete Best-First random walk after 10001 steps, including 148 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :12
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :12
Incomplete Best-First random walk after 10001 steps, including 157 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :7
[2023-03-15 10:06:29] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2023-03-15 10:06:29] [INFO ] Computed 102 place invariants in 49 ms
[2023-03-15 10:06:29] [INFO ] [Real]Absence check using 95 positive place invariants in 26 ms returned sat
[2023-03-15 10:06:29] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 8 ms returned unsat
[2023-03-15 10:06:29] [INFO ] [Real]Absence check using 95 positive place invariants in 24 ms returned sat
[2023-03-15 10:06:29] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 9 ms returned unsat
[2023-03-15 10:06:29] [INFO ] [Real]Absence check using 95 positive place invariants in 27 ms returned sat
[2023-03-15 10:06:29] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-15 10:06:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:29] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2023-03-15 10:06:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:29] [INFO ] [Nat]Absence check using 95 positive place invariants in 25 ms returned sat
[2023-03-15 10:06:30] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 7 ms returned unsat
[2023-03-15 10:06:30] [INFO ] [Real]Absence check using 95 positive place invariants in 27 ms returned sat
[2023-03-15 10:06:30] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 13 ms returned unsat
[2023-03-15 10:06:30] [INFO ] [Real]Absence check using 95 positive place invariants in 22 ms returned sat
[2023-03-15 10:06:30] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 8 ms returned unsat
[2023-03-15 10:06:30] [INFO ] [Real]Absence check using 95 positive place invariants in 50 ms returned sat
[2023-03-15 10:06:30] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 6 ms returned unsat
[2023-03-15 10:06:30] [INFO ] [Real]Absence check using 95 positive place invariants in 23 ms returned sat
[2023-03-15 10:06:30] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 9 ms returned unsat
[2023-03-15 10:06:30] [INFO ] [Real]Absence check using 95 positive place invariants in 39 ms returned sat
[2023-03-15 10:06:30] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 7 ms returned unsat
[2023-03-15 10:06:30] [INFO ] [Real]Absence check using 95 positive place invariants in 24 ms returned sat
[2023-03-15 10:06:30] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 9 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 4, 1, 1, 1] Max seen :[1, 1, 1, 1, 1, 4, 1, 1, 1]
FORMULA PolyORBNT-COL-S05J40-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-12 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 4 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-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 5840 ms.

BK_STOP 1678874790854

--------------------
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="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-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 r319-tall-167873969900082"
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 ;