Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 6.0K Apr 29 13:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Apr 29 13:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 13:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 13:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K May 9 08:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:27 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-S02J04T10-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652853949765

Running Version 202205111006
[2022-05-18 06:05:50] [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 06:05:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 06:05:51] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-18 06:05:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 06:05:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 664 ms
[2022-05-18 06:05:51] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 752 PT places and 1664.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2022-05-18 06:05:51] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2022-05-18 06:05:51] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2022-05-18 06:05:51] [INFO ] Computed 26 place invariants in 11 ms
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2022-05-18 06:05:51] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2022-05-18 06:05:51] [INFO ] Computed 26 place invariants in 3 ms
[2022-05-18 06:05:51] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-05-18 06:05:51] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2022-05-18 06:05:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:51] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-05-18 06:05:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 06:05:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 06:05:52] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-18 06:05:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:52] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2022-05-18 06:05:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-18 06:05:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2022-05-18 06:05:52] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 2 ms to minimize.
[2022-05-18 06:05:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2022-05-18 06:05:52] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-18 06:05:52] [INFO ] Added : 30 causal constraints over 6 iterations in 71 ms. Result :sat
Minimization took 19 ms.
[2022-05-18 06:05:52] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 06:05:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-18 06:05:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:52] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-05-18 06:05:52] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2022-05-18 06:05:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 06:05:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 06:05:52] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 06:05:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:52] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-05-18 06:05:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2022-05-18 06:05:52] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
[2022-05-18 06:05:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2022-05-18 06:05:52] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-18 06:05:52] [INFO ] Added : 23 causal constraints over 5 iterations in 53 ms. Result :sat
Minimization took 16 ms.
[2022-05-18 06:05:52] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 06:05:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 06:05:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:52] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-18 06:05:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 06:05:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 06:05:52] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 06:05:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:52] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2022-05-18 06:05:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2022-05-18 06:05:52] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-18 06:05:53] [INFO ] Added : 63 causal constraints over 16 iterations in 194 ms. Result :sat
Minimization took 45 ms.
[2022-05-18 06:05:53] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 06:05:53] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 06:05:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:53] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-18 06:05:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 06:05:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 06:05:53] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 06:05:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:53] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-05-18 06:05:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2022-05-18 06:05:53] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 06:05:53] [INFO ] Added : 39 causal constraints over 9 iterations in 82 ms. Result :sat
Minimization took 19 ms.
[2022-05-18 06:05:53] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-05-18 06:05:53] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 06:05:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:53] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-18 06:05:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 06:05:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 06:05:53] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 06:05:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:53] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2022-05-18 06:05:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2022-05-18 06:05:53] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 06:05:53] [INFO ] Added : 58 causal constraints over 12 iterations in 103 ms. Result :sat
Minimization took 33 ms.
[2022-05-18 06:05:53] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 06:05:53] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 06:05:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:53] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-18 06:05:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 06:05:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 06:05:53] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2022-05-18 06:05:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:53] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2022-05-18 06:05:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2022-05-18 06:05:53] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2022-05-18 06:05:53] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 2 ms to minimize.
[2022-05-18 06:05:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2022-05-18 06:05:53] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 06:05:54] [INFO ] Added : 60 causal constraints over 12 iterations in 84 ms. Result :sat
Minimization took 30 ms.
[2022-05-18 06:05:54] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 06:05:54] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2022-05-18 06:05:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:54] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-18 06:05:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 06:05:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 06:05:54] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 06:05:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:54] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-18 06:05:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2022-05-18 06:05:54] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2022-05-18 06:05:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2022-05-18 06:05:54] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 06:05:54] [INFO ] Added : 23 causal constraints over 5 iterations in 70 ms. Result :sat
Minimization took 20 ms.
[2022-05-18 06:05:54] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 06:05:54] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-18 06:05:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:54] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-18 06:05:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 06:05:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 06:05:54] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 06:05:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:54] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2022-05-18 06:05:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2022-05-18 06:05:54] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 06:05:54] [INFO ] Added : 14 causal constraints over 3 iterations in 31 ms. Result :sat
Minimization took 22 ms.
[2022-05-18 06:05:54] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 06:05:54] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 06:05:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:54] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-18 06:05:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 06:05:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 06:05:54] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 06:05:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:54] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2022-05-18 06:05:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2022-05-18 06:05:54] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 06:05:54] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 10 ms.
[2022-05-18 06:05:54] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 06:05:54] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 06:05:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:54] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-18 06:05:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 06:05:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 06:05:54] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 06:05:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:54] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-05-18 06:05:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2022-05-18 06:05:54] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-18 06:05:54] [INFO ] Added : 3 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 16 ms.
[2022-05-18 06:05:54] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 06:05:54] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 06:05:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:54] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-18 06:05:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 06:05:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 06:05:54] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 06:05:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:55] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-18 06:05:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2022-05-18 06:05:55] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 06:05:55] [INFO ] Added : 58 causal constraints over 12 iterations in 145 ms. Result :sat
Minimization took 19 ms.
[2022-05-18 06:05:55] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 06:05:55] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 06:05:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:55] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-18 06:05:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 06:05:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 06:05:55] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 06:05:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:55] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-18 06:05:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2022-05-18 06:05:55] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-18 06:05:55] [INFO ] Added : 24 causal constraints over 5 iterations in 49 ms. Result :sat
Minimization took 23 ms.
[2022-05-18 06:05:55] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 06:05:55] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 06:05:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:55] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-18 06:05:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 06:05:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 06:05:55] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 06:05:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:55] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2022-05-18 06:05:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2022-05-18 06:05:55] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 06:05:55] [INFO ] Added : 10 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [1, 2, 4, 2, 3, 3, 10, 10, 1, 2, 1, 10, 10]
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2022-05-18 06:05:55] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1572 transitions 7262 arcs in 33 ms.
[2022-05-18 06:05:55] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 13) seen :21
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :14
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :14
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :13
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :14
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :23
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2022-05-18 06:05:56] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2022-05-18 06:05:56] [INFO ] Computed 54 place invariants in 82 ms
[2022-05-18 06:05:56] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2022-05-18 06:05:56] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 20 ms returned unsat
[2022-05-18 06:05:56] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2022-05-18 06:05:56] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 21 ms returned sat
[2022-05-18 06:05:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:56] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2022-05-18 06:05:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 06:05:57] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2022-05-18 06:05:57] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 23 ms returned sat
[2022-05-18 06:05:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 06:05:59] [INFO ] [Nat]Absence check using state equation in 2708 ms returned sat
[2022-05-18 06:05:59] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:06:01] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 06:06:01] [INFO ] [Nat]Added 120 Read/Feed constraints in 2188 ms returned unknown
[2022-05-18 06:06:02] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2022-05-18 06:06:02] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 20 ms returned sat
[2022-05-18 06:06:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 06:06:02] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2022-05-18 06:06:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 06:06:02] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2022-05-18 06:06:02] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 19 ms returned unsat
[2022-05-18 06:06:02] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2022-05-18 06:06:02] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 22 ms returned sat
[2022-05-18 06:06:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 06:06:03] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2022-05-18 06:06:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 06:06:03] [INFO ] [Nat]Absence check using 15 positive place invariants in 13 ms returned sat
[2022-05-18 06:06:03] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 22 ms returned sat
[2022-05-18 06:06:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 06:06:06] [INFO ] [Nat]Absence check using state equation in 3305 ms returned sat
[2022-05-18 06:06:08] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 06:06:08] [INFO ] [Nat]Added 120 Read/Feed constraints in 1599 ms returned unknown
[2022-05-18 06:06:08] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2022-05-18 06:06:08] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 21 ms returned sat
[2022-05-18 06:06:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 06:06:08] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2022-05-18 06:06:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 06:06:09] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2022-05-18 06:06:09] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 21 ms returned sat
[2022-05-18 06:06:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 06:06:09] [INFO ] [Nat]Absence check using state equation in 800 ms returned sat
[2022-05-18 06:06:10] [INFO ] [Nat]Added 120 Read/Feed constraints in 217 ms returned sat
[2022-05-18 06:06:10] [INFO ] Computed and/alt/rep : 720/1388/710 causal constraints (skipped 680 transitions) in 115 ms.
[2022-05-18 06:06:11] [INFO ] Added : 52 causal constraints over 11 iterations in 989 ms. Result :sat
Minimization took 564 ms.
[2022-05-18 06:06:11] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2022-05-18 06:06:11] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 20 ms returned unsat
[2022-05-18 06:06:11] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2022-05-18 06:06:11] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 23 ms returned unsat
[2022-05-18 06:06:12] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2022-05-18 06:06:12] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 23 ms returned sat
[2022-05-18 06:06:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 06:06:12] [INFO ] [Real]Absence check using state equation in 507 ms returned sat
[2022-05-18 06:06:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 06:06:12] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2022-05-18 06:06:12] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 26 ms returned sat
[2022-05-18 06:06:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 06:06:13] [INFO ] [Nat]Absence check using state equation in 578 ms returned sat
[2022-05-18 06:06:14] [INFO ] [Nat]Added 120 Read/Feed constraints in 724 ms returned sat
[2022-05-18 06:06:14] [INFO ] Deduced a trap composed of 231 places in 309 ms of which 1 ms to minimize.
[2022-05-18 06:06:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 373 ms
Current structural bounds on expressions (after SMT) : [1, 4, 1, 3, 3, 1, 1, 9] Max seen :[1, 0, 1, 0, 0, 1, 1, 9]
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-15 9 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 21 out of 752 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 750 transition count 1322
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 182 place count 660 transition count 1322
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 182 place count 660 transition count 1242
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 342 place count 580 transition count 1242
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 502 place count 500 transition count 1162
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 522 place count 500 transition count 1142
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 542 place count 480 transition count 1142
Applied a total of 542 rules in 212 ms. Remains 480 /752 variables (removed 272) and now considering 1142/1412 (removed 270) transitions.
[2022-05-18 06:06:14] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
// Phase 1: matrix 1122 rows 480 cols
[2022-05-18 06:06:14] [INFO ] Computed 52 place invariants in 33 ms
[2022-05-18 06:06:15] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 110 transitions.
Found 110 dead transitions using SMT.
Drop transitions removed 110 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 110 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 480/752 places, 1032/1412 transitions.
Reduce places removed 1 places and 20 transitions.
Graph (complete) has 3030 edges and 479 vertex of which 21 are kept as prefixes of interest. Removing 458 places using SCC suffix rule.1 ms
Discarding 458 places :
Also discarding 992 output transitions
Drop transitions removed 992 transitions
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 20
Reduce places removed 0 places and 20 transitions.
Deduced a syphon composed of 21 places in 0 ms
Applied a total of 2 rules in 7 ms. Remains 21 /480 variables (removed 459) and now considering 0/1032 (removed 1032) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/752 places, 0/1412 transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 24533 ms.

BK_STOP 1652853975483

--------------------
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="PolyORBLF-COL-S02J04T10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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