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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 8.1K Apr 30 03:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 30 03:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 30 03:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 03:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 92K May 10 09:34 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652931957013

Running Version 202205111006
[2022-05-19 03:45:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 03:45:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 03:45:58] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-19 03:45:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 03:45:58] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 638 ms
[2022-05-19 03:45:58] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 519 PT places and 1492.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2022-05-19 03:45:58] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2022-05-19 03:45:58] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2022-05-19 03:45:58] [INFO ] Computed 13 place invariants in 13 ms
FORMULA PolyORBNT-COL-S05J30-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 38 rows 48 cols
[2022-05-19 03:45:59] [INFO ] Computed 13 place invariants in 7 ms
[2022-05-19 03:45:59] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2022-05-19 03:45:59] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2022-05-19 03:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 03:45:59] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2022-05-19 03:45:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 03:45:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 03:45:59] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 03:45:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 03:45:59] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-19 03:45:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 03:45:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 03:45:59] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 17 ms.
[2022-05-19 03:45:59] [INFO ] Added : 1 causal constraints over 1 iterations in 31 ms. Result :sat
Minimization took 7 ms.
[2022-05-19 03:45:59] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 03:45:59] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 03:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 03:45:59] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-19 03:45:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 03:45:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 03:45:59] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-19 03:45:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 03:45:59] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-19 03:45:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 03:45:59] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
[2022-05-19 03:45:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2022-05-19 03:45:59] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 03:45:59] [INFO ] Added : 15 causal constraints over 4 iterations in 39 ms. Result :sat
Minimization took 15 ms.
[2022-05-19 03:45:59] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 03:45:59] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-19 03:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 03:45:59] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-19 03:45:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 03:45:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 03:45:59] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 03:45:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 03:45:59] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-19 03:45:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-19 03:45:59] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 03:45:59] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2022-05-19 03:45:59] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2022-05-19 03:45:59] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2022-05-19 03:45:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 105 ms
[2022-05-19 03:45:59] [INFO ] Added : 36 causal constraints over 8 iterations in 217 ms. Result :sat
Minimization took 13 ms.
[2022-05-19 03:45:59] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 03:45:59] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 03:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 03:45:59] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-19 03:45:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 03:45:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 03:45:59] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 03:45:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 03:45:59] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-19 03:45:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-19 03:45:59] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 03:46:00] [INFO ] Added : 21 causal constraints over 5 iterations in 322 ms. Result :sat
Minimization took 67 ms.
[2022-05-19 03:46:00] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 03:46:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 03:46:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 03:46:00] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-19 03:46:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 03:46:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 03:46:00] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 03:46:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 03:46:00] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-19 03:46:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-19 03:46:00] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2022-05-19 03:46:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2022-05-19 03:46:00] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 03:46:00] [INFO ] Added : 36 causal constraints over 8 iterations in 114 ms. Result :sat
Minimization took 16 ms.
[2022-05-19 03:46:00] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 03:46:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 03:46:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 03:46:00] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-19 03:46:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 03:46:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 03:46:00] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 03:46:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 03:46:00] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-19 03:46:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 03:46:00] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2022-05-19 03:46:00] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2022-05-19 03:46:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 55 ms
[2022-05-19 03:46:00] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 03:46:00] [INFO ] Added : 36 causal constraints over 8 iterations in 42 ms. Result :sat
Minimization took 14 ms.
[2022-05-19 03:46:00] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 03:46:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2022-05-19 03:46:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 03:46:00] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-19 03:46:00] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 03:46:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 03:46:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 03:46:00] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 03:46:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 03:46:00] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-19 03:46:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-19 03:46:00] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2022-05-19 03:46:00] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2022-05-19 03:46:00] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2022-05-19 03:46:00] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2022-05-19 03:46:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 132 ms
[2022-05-19 03:46:00] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 03:46:01] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2022-05-19 03:46:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2022-05-19 03:46:01] [INFO ] Added : 36 causal constraints over 8 iterations in 87 ms. Result :sat
Minimization took 21 ms.
[2022-05-19 03:46:01] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 03:46:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 03:46:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 03:46:01] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-19 03:46:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 03:46:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 03:46:01] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 03:46:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 03:46:01] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-19 03:46:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 03:46:01] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 03:46:01] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2022-05-19 03:46:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2022-05-19 03:46:01] [INFO ] Added : 36 causal constraints over 8 iterations in 88 ms. Result :sat
Minimization took 15 ms.
[2022-05-19 03:46:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 03:46:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 03:46:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 03:46:01] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-19 03:46:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 03:46:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 03:46:01] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 03:46:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 03:46:01] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-19 03:46:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-19 03:46:01] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 03:46:01] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2022-05-19 03:46:01] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 03:46:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 03:46:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 03:46:01] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-19 03:46:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 03:46:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2022-05-19 03:46:01] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 03:46:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 03:46:01] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-19 03:46:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 03:46:01] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2022-05-19 03:46:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2022-05-19 03:46:01] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 03:46:01] [INFO ] Added : 21 causal constraints over 5 iterations in 78 ms. Result :sat
Minimization took 14 ms.
[2022-05-19 03:46:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 03:46:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 03:46:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 03:46:01] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-19 03:46:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 03:46:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 03:46:01] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 03:46:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 03:46:01] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-19 03:46:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 36 ms returned sat
[2022-05-19 03:46:01] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 03:46:01] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2022-05-19 03:46:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2022-05-19 03:46:01] [INFO ] Added : 36 causal constraints over 8 iterations in 87 ms. Result :sat
Minimization took 13 ms.
[2022-05-19 03:46:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 03:46:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2022-05-19 03:46:01] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 03:46:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-19 03:46:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 03:46:01] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-19 03:46:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 03:46:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 03:46:01] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 03:46:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 03:46:01] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-19 03:46:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 03:46:01] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2022-05-19 03:46:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2022-05-19 03:46:01] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-19 03:46:02] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2022-05-19 03:46:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2022-05-19 03:46:02] [INFO ] Added : 36 causal constraints over 8 iterations in 152 ms. Result :sat
Minimization took 174 ms.
[2022-05-19 03:46:02] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 03:46:02] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 03:46:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 03:46:02] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-19 03:46:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 03:46:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 03:46:02] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 03:46:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 03:46:02] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-19 03:46:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 03:46:02] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2022-05-19 03:46:02] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2022-05-19 03:46:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 75 ms
[2022-05-19 03:46:02] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 03:46:02] [INFO ] Added : 36 causal constraints over 8 iterations in 47 ms. Result :sat
Minimization took 14 ms.
[2022-05-19 03:46:02] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 03:46:02] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2022-05-19 03:46:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 03:46:02] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-19 03:46:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 03:46:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-19 03:46:02] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 03:46:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 03:46:02] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-19 03:46:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-19 03:46:02] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 03:46:02] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [5, 1, 1, 5, 5, -1, 1, -1, -1, 3, -1, 1, 10, -1, -1]
FORMULA PolyORBNT-COL-S05J30-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2022-05-19 03:46:02] [INFO ] Unfolded HLPN to a Petri net with 519 places and 1430 transitions 9824 arcs in 70 ms.
[2022-05-19 03:46:02] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Deduced a syphon composed of 30 places in 24 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 656 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 14) seen :28
FORMULA PolyORBNT-COL-S05J30-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-00 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 157 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :18
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :18
Incomplete Best-First random walk after 10001 steps, including 196 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :14
Incomplete Best-First random walk after 10001 steps, including 137 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :18
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :18
Incomplete Best-First random walk after 10001 steps, including 251 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 170 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :18
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :18
Incomplete Best-First random walk after 10001 steps, including 144 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :18
Incomplete Best-First random walk after 10001 steps, including 251 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :2
[2022-05-19 03:46:03] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 489 cols
[2022-05-19 03:46:03] [INFO ] Computed 82 place invariants in 40 ms
[2022-05-19 03:46:03] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2022-05-19 03:46:03] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-19 03:46:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 03:46:03] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2022-05-19 03:46:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 03:46:04] [INFO ] [Nat]Absence check using 75 positive place invariants in 550 ms returned sat
[2022-05-19 03:46:04] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 10 ms returned sat
[2022-05-19 03:46:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 03:46:04] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2022-05-19 03:46:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 03:46:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-19 03:46:04] [INFO ] Computed and/alt/rep : 449/1109/449 causal constraints (skipped 286 transitions) in 69 ms.
[2022-05-19 03:46:04] [INFO ] Added : 9 causal constraints over 2 iterations in 224 ms. Result :sat
Minimization took 165 ms.
[2022-05-19 03:46:04] [INFO ] [Real]Absence check using 75 positive place invariants in 18 ms returned sat
[2022-05-19 03:46:04] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 6 ms returned unsat
[2022-05-19 03:46:04] [INFO ] [Real]Absence check using 75 positive place invariants in 21 ms returned sat
[2022-05-19 03:46:04] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-19 03:46:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 03:46:05] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2022-05-19 03:46:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 03:46:05] [INFO ] [Nat]Absence check using 75 positive place invariants in 18 ms returned sat
[2022-05-19 03:46:05] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-19 03:46:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 03:46:05] [INFO ] [Nat]Absence check using state equation in 600 ms returned unsat
[2022-05-19 03:46:05] [INFO ] [Real]Absence check using 75 positive place invariants in 18 ms returned sat
[2022-05-19 03:46:05] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 8 ms returned unsat
[2022-05-19 03:46:06] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2022-05-19 03:46:06] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 3 ms returned unsat
[2022-05-19 03:46:06] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2022-05-19 03:46:06] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 4 ms returned unsat
[2022-05-19 03:46:06] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2022-05-19 03:46:06] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 3 ms returned unsat
[2022-05-19 03:46:06] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2022-05-19 03:46:06] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-19 03:46:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 03:46:06] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2022-05-19 03:46:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 03:46:06] [INFO ] [Nat]Absence check using 75 positive place invariants in 17 ms returned sat
[2022-05-19 03:46:06] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 17 ms returned sat
[2022-05-19 03:46:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 03:46:11] [INFO ] [Nat]Absence check using state equation in 4910 ms returned unknown
[2022-05-19 03:46:11] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2022-05-19 03:46:11] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 4 ms returned unsat
[2022-05-19 03:46:11] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2022-05-19 03:46:11] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 4 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 4, 4, 1, 1, 1, 1, 10, 1, 1] Max seen :[0, 4, 4, 1, 1, 1, 1, 4, 1, 1]
FORMULA PolyORBNT-COL-S05J30-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 489 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 489/489 places, 745/745 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 484 transition count 709
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 77 place count 448 transition count 709
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 77 place count 448 transition count 674
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 147 place count 413 transition count 674
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 148 place count 412 transition count 673
Iterating global reduction 2 with 1 rules applied. Total rules applied 149 place count 412 transition count 673
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 153 place count 410 transition count 671
Applied a total of 153 rules in 219 ms. Remains 410 /489 variables (removed 79) and now considering 671/745 (removed 74) transitions.
[2022-05-19 03:46:11] [INFO ] Flow matrix only has 667 transitions (discarded 4 similar events)
// Phase 1: matrix 667 rows 410 cols
[2022-05-19 03:46:11] [INFO ] Computed 77 place invariants in 23 ms
[2022-05-19 03:46:12] [INFO ] Dead Transitions using invariants and state equation in 368 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 410/489 places, 576/745 transitions.
Applied a total of 0 rules in 27 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/489 places, 576/745 transitions.
Normalized transition count is 572 out of 576 initially.
// Phase 1: matrix 572 rows 410 cols
[2022-05-19 03:46:12] [INFO ] Computed 77 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 51931 resets, run finished after 3347 ms. (steps per millisecond=298 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 4178 resets, run finished after 853 ms. (steps per millisecond=1172 ) properties (out of 1) seen :4
[2022-05-19 03:46:16] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2022-05-19 03:46:16] [INFO ] Computed 77 place invariants in 13 ms
[2022-05-19 03:46:16] [INFO ] [Real]Absence check using 70 positive place invariants in 13 ms returned sat
[2022-05-19 03:46:16] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-19 03:46:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 03:46:16] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2022-05-19 03:46:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 03:46:16] [INFO ] [Nat]Absence check using 70 positive place invariants in 12 ms returned sat
[2022-05-19 03:46:16] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-19 03:46:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 03:46:18] [INFO ] [Nat]Absence check using state equation in 1774 ms returned unsat
Current structural bounds on expressions (after SMT) : [4] Max seen :[4]
FORMULA PolyORBNT-COL-S05J30-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 20515 ms.

BK_STOP 1652931978731

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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