Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 8.0K Apr 29 14:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 29 14:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 14:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 14:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 154K May 10 09:34 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652833158880

Running Version 0
[2022-05-18 00:19:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 00:19:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 00:19:20] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2022-05-18 00:19:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 00:19:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 632 ms
[2022-05-18 00:19:21] [INFO ] ms1 symmetric to ms2 in transition T_1124
[2022-05-18 00:19:21] [INFO ] ms1 symmetric to ms2 in transition T_1125
[2022-05-18 00:19:21] [INFO ] ms2 symmetric to ms3 in transition T_1125
[2022-05-18 00:19:21] [INFO ] ms1 symmetric to ms4 in transition T_1126
[2022-05-18 00:19:21] [INFO ] ms4 symmetric to ms2 in transition T_1126
[2022-05-18 00:19:21] [INFO ] ms2 symmetric to ms3 in transition T_1126
[2022-05-18 00:19:21] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 810 PT places and 14100.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2022-05-18 00:19:21] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions in 19 ms.
[2022-05-18 00:19:21] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_1684049436825389860.dot
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2022-05-18 00:19:21] [INFO ] Computed 26 place invariants in 14 ms
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2022-05-18 00:19:21] [INFO ] Unfolded HLPN to a Petri net with 810 places and 3254 transitions in 67 ms.
[2022-05-18 00:19:21] [INFO ] Unfolded HLPN properties in 0 ms.
[2022-05-18 00:19:21] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2022-05-18 00:19:21] [INFO ] Computed 26 place invariants in 11 ms
[2022-05-18 00:19:21] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2022-05-18 00:19:21] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2022-05-18 00:19:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:19:21] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2022-05-18 00:19:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:19:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-05-18 00:19:21] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-18 00:19:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:19:21] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2022-05-18 00:19:21] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-18 00:19:21] [INFO ] [Nat]Added 9 Read/Feed constraints in 5 ms returned sat
[2022-05-18 00:19:21] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 3 ms to minimize.
[2022-05-18 00:19:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2022-05-18 00:19:21] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-18 00:19:21] [INFO ] Added : 60 causal constraints over 12 iterations in 146 ms. Result :sat
Minimization took 25 ms.
[2022-05-18 00:19:21] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-18 00:19:21] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned unsat
[2022-05-18 00:19:21] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-18 00:19:21] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:19:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:19:22] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-18 00:19:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:19:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:19:22] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:19:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:19:22] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-05-18 00:19:22] [INFO ] [Nat]Added 9 Read/Feed constraints in 14 ms returned sat
[2022-05-18 00:19:22] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2022-05-18 00:19:22] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2022-05-18 00:19:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 53 ms
[2022-05-18 00:19:22] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 00:19:22] [INFO ] Added : 63 causal constraints over 14 iterations in 120 ms. Result :sat
Minimization took 23 ms.
[2022-05-18 00:19:22] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:19:22] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:19:22] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-18 00:19:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:19:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:19:22] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:19:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:19:22] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-05-18 00:19:22] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2022-05-18 00:19:22] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 2 ms to minimize.
[2022-05-18 00:19:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2022-05-18 00:19:22] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 17 ms.
[2022-05-18 00:19:22] [INFO ] Deduced a trap composed of 35 places in 20 ms of which 1 ms to minimize.
[2022-05-18 00:19:22] [INFO ] Deduced a trap composed of 34 places in 25 ms of which 1 ms to minimize.
[2022-05-18 00:19:22] [INFO ] Deduced a trap composed of 34 places in 23 ms of which 1 ms to minimize.
[2022-05-18 00:19:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 146 ms
[2022-05-18 00:19:22] [INFO ] Added : 57 causal constraints over 12 iterations in 285 ms. Result :sat
Minimization took 70 ms.
[2022-05-18 00:19:22] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:19:22] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:19:22] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-18 00:19:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:19:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-05-18 00:19:22] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2022-05-18 00:19:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:19:22] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-05-18 00:19:22] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2022-05-18 00:19:22] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2022-05-18 00:19:22] [INFO ] Deduced a trap composed of 15 places in 14 ms of which 1 ms to minimize.
[2022-05-18 00:19:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 53 ms
[2022-05-18 00:19:23] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 00:19:23] [INFO ] Deduced a trap composed of 29 places in 23 ms of which 1 ms to minimize.
[2022-05-18 00:19:23] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 0 ms to minimize.
[2022-05-18 00:19:23] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 1 ms to minimize.
[2022-05-18 00:19:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 100 ms
[2022-05-18 00:19:23] [INFO ] Added : 63 causal constraints over 14 iterations in 235 ms. Result :sat
Minimization took 26 ms.
[2022-05-18 00:19:23] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:19:23] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2022-05-18 00:19:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:19:23] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-05-18 00:19:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:19:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:19:23] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:19:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:19:23] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-05-18 00:19:23] [INFO ] [Nat]Added 9 Read/Feed constraints in 27 ms returned sat
[2022-05-18 00:19:23] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-18 00:19:23] [INFO ] Deduced a trap composed of 31 places in 20 ms of which 1 ms to minimize.
[2022-05-18 00:19:23] [INFO ] Deduced a trap composed of 30 places in 19 ms of which 1 ms to minimize.
[2022-05-18 00:19:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 66 ms
[2022-05-18 00:19:23] [INFO ] Added : 53 causal constraints over 11 iterations in 184 ms. Result :sat
Minimization took 30 ms.
[2022-05-18 00:19:23] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:19:23] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned unsat
[2022-05-18 00:19:23] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:19:23] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:19:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:19:23] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-18 00:19:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:19:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:19:23] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:19:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:19:23] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-18 00:19:23] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2022-05-18 00:19:23] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 00:19:23] [INFO ] Deduced a trap composed of 18 places in 16 ms of which 1 ms to minimize.
[2022-05-18 00:19:23] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2022-05-18 00:19:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 57 ms
[2022-05-18 00:19:23] [INFO ] Added : 62 causal constraints over 13 iterations in 203 ms. Result :sat
Minimization took 23 ms.
[2022-05-18 00:19:23] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:19:23] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:19:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:19:24] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-18 00:19:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:19:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:19:24] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:19:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:19:24] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-05-18 00:19:24] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2022-05-18 00:19:24] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-18 00:19:24] [INFO ] Added : 61 causal constraints over 13 iterations in 110 ms. Result :sat
Minimization took 124 ms.
[2022-05-18 00:19:24] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:19:24] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:19:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:19:24] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-18 00:19:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:19:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:19:24] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:19:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:19:24] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-05-18 00:19:24] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2022-05-18 00:19:24] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-18 00:19:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2022-05-18 00:19:24] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 00:19:24] [INFO ] Added : 61 causal constraints over 13 iterations in 104 ms. Result :sat
Minimization took 24 ms.
[2022-05-18 00:19:24] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:19:24] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:19:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:19:24] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-18 00:19:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:19:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2022-05-18 00:19:24] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-18 00:19:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:19:24] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-18 00:19:24] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2022-05-18 00:19:24] [INFO ] Deduced a trap composed of 31 places in 22 ms of which 0 ms to minimize.
[2022-05-18 00:19:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2022-05-18 00:19:24] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-18 00:19:24] [INFO ] Added : 60 causal constraints over 12 iterations in 114 ms. Result :sat
Minimization took 23 ms.
[2022-05-18 00:19:24] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:19:24] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2022-05-18 00:19:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:19:24] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-18 00:19:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:19:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:19:25] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:19:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:19:25] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-05-18 00:19:25] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2022-05-18 00:19:25] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2022-05-18 00:19:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-18 00:19:25] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:19:25] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:19:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:19:25] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-18 00:19:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:19:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:19:25] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:19:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:19:25] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2022-05-18 00:19:25] [INFO ] [Nat]Added 9 Read/Feed constraints in 23 ms returned sat
[2022-05-18 00:19:25] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-18 00:19:25] [INFO ] Added : 63 causal constraints over 13 iterations in 102 ms. Result :sat
Minimization took 59 ms.
[2022-05-18 00:19:25] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:19:25] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:19:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:19:25] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-18 00:19:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:19:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:19:25] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:19:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:19:25] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2022-05-18 00:19:25] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2022-05-18 00:19:25] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 1 ms to minimize.
[2022-05-18 00:19:25] [INFO ] Deduced a trap composed of 15 places in 12 ms of which 0 ms to minimize.
[2022-05-18 00:19:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 48 ms
[2022-05-18 00:19:25] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 00:19:25] [INFO ] Added : 62 causal constraints over 13 iterations in 127 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [1, 10, 8, 159, 8, 8, 1, 6, 35, 1, 1, 7, 4, 6]
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-13 7 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
[2022-05-18 00:19:25] [INFO ] Unfolded HLPN to a Petri net with 810 places and 3254 transitions in 29 ms.
[2022-05-18 00:19:25] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_2545930537835789176.dot
Incomplete random walk after 10000 steps, including 72 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 11) seen :27
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :17
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :18
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :14
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :20
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-07 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :13
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :13
[2022-05-18 00:19:26] [INFO ] Flow matrix only has 3206 transitions (discarded 48 similar events)
// Phase 1: matrix 3206 rows 810 cols
[2022-05-18 00:19:26] [INFO ] Computed 58 place invariants in 221 ms
[2022-05-18 00:19:26] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2022-05-18 00:19:26] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 29 ms returned unsat
[2022-05-18 00:19:26] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2022-05-18 00:19:26] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 18 ms returned unsat
[2022-05-18 00:19:26] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2022-05-18 00:19:26] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 32 ms returned unsat
[2022-05-18 00:19:26] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2022-05-18 00:19:26] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 31 ms returned unsat
[2022-05-18 00:19:27] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2022-05-18 00:19:27] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 12 ms returned unsat
[2022-05-18 00:19:27] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2022-05-18 00:19:27] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 31 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 5, 1, 1, 4, 1] Max seen :[1, 5, 1, 1, 4, 1]
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652833168203

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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