Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 7.6K Feb 26 13:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 13:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 13:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 13:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 14:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 14:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 154K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679494054923

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J06T06
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 14:07:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 14:07:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 14:07:36] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 14:07:36] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 14:07:37] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 678 ms
[2023-03-22 14:07:37] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 700 PT places and 10800.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-22 14:07:37] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2023-03-22 14:07:37] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2023-03-22 14:07:37] [INFO ] Computed 26 place invariants in 17 ms
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-13 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-22 14:07:37] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2023-03-22 14:07:37] [INFO ] Computed 26 place invariants in 6 ms
[2023-03-22 14:07:37] [INFO ] [Real]Absence check using 11 positive place invariants in 22 ms returned sat
[2023-03-22 14:07:37] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2023-03-22 14:07:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:37] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-22 14:07:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:07:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-22 14:07:37] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-22 14:07:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:37] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-22 14:07:37] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 14:07:37] [INFO ] [Nat]Added 8 Read/Feed constraints in 14 ms returned sat
[2023-03-22 14:07:37] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 14:07:37] [INFO ] Added : 9 causal constraints over 2 iterations in 43 ms. Result :sat
Minimization took 17 ms.
[2023-03-22 14:07:37] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 14:07:37] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 14:07:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:37] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-22 14:07:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:07:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 14:07:37] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 14:07:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:37] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-22 14:07:37] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-22 14:07:37] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-22 14:07:38] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 8 ms to minimize.
[2023-03-22 14:07:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-22 14:07:38] [INFO ] Added : 42 causal constraints over 10 iterations in 162 ms. Result :sat
Minimization took 37 ms.
[2023-03-22 14:07:38] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-22 14:07:38] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-22 14:07:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:38] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 14:07:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:07:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 14:07:38] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 14:07:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:38] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-22 14:07:38] [INFO ] [Nat]Added 8 Read/Feed constraints in 27 ms returned sat
[2023-03-22 14:07:38] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 14:07:38] [INFO ] Added : 22 causal constraints over 5 iterations in 42 ms. Result :sat
Minimization took 16 ms.
[2023-03-22 14:07:38] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 14:07:38] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 14:07:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:38] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 14:07:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:07:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 14:07:38] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 14:07:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:38] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-22 14:07:38] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2023-03-22 14:07:38] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 14:07:38] [INFO ] Added : 33 causal constraints over 7 iterations in 65 ms. Result :sat
Minimization took 20 ms.
[2023-03-22 14:07:38] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-22 14:07:38] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 14:07:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:38] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-22 14:07:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:07:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-22 14:07:38] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 14:07:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:38] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-22 14:07:38] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-22 14:07:38] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 14:07:38] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
[2023-03-22 14:07:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-22 14:07:38] [INFO ] Added : 61 causal constraints over 14 iterations in 186 ms. Result :sat
Minimization took 19 ms.
[2023-03-22 14:07:38] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 14:07:38] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 14:07:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:38] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 14:07:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:07:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 14:07:39] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 14:07:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:39] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-22 14:07:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-22 14:07:39] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
[2023-03-22 14:07:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-22 14:07:39] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 14:07:39] [INFO ] Added : 37 causal constraints over 8 iterations in 63 ms. Result :sat
Minimization took 19 ms.
[2023-03-22 14:07:39] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 14:07:39] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 14:07:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:39] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 14:07:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:07:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 14:07:39] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-22 14:07:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:39] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-22 14:07:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-22 14:07:39] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2023-03-22 14:07:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-22 14:07:39] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 14:07:39] [INFO ] Added : 37 causal constraints over 8 iterations in 60 ms. Result :sat
Minimization took 18 ms.
[2023-03-22 14:07:39] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 14:07:39] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 14:07:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:39] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 14:07:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:07:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 14:07:39] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 14:07:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:39] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-22 14:07:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-22 14:07:39] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2023-03-22 14:07:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-22 14:07:39] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 14:07:39] [INFO ] Added : 62 causal constraints over 13 iterations in 116 ms. Result :sat
Minimization took 23 ms.
[2023-03-22 14:07:39] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 14:07:39] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 14:07:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:39] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 14:07:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:07:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 14:07:39] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-22 14:07:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:39] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-22 14:07:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-22 14:07:39] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2023-03-22 14:07:39] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2023-03-22 14:07:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 86 ms
[2023-03-22 14:07:40] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 14:07:40] [INFO ] Added : 59 causal constraints over 12 iterations in 105 ms. Result :sat
Minimization took 20 ms.
[2023-03-22 14:07:40] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 14:07:40] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 14:07:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:40] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 14:07:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:07:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 14:07:40] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 14:07:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:40] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2023-03-22 14:07:40] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-22 14:07:40] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 14:07:40] [INFO ] Added : 30 causal constraints over 7 iterations in 48 ms. Result :sat
Minimization took 23 ms.
[2023-03-22 14:07:40] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 14:07:40] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 14:07:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:40] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 14:07:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:07:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 14:07:40] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 14:07:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:40] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-22 14:07:40] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-22 14:07:40] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 14:07:40] [INFO ] Added : 59 causal constraints over 13 iterations in 129 ms. Result :sat
Minimization took 23 ms.
[2023-03-22 14:07:40] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 14:07:40] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 14:07:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:40] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 14:07:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:07:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 14:07:40] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 14:07:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:40] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-22 14:07:40] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-22 14:07:40] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 14:07:40] [INFO ] Added : 54 causal constraints over 11 iterations in 75 ms. Result :sat
Minimization took 17 ms.
[2023-03-22 14:07:40] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 14:07:40] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 14:07:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:40] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 14:07:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:07:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 14:07:41] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 14:07:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:41] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-22 14:07:41] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-22 14:07:41] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 14:07:41] [INFO ] Added : 10 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [128, 6, 1, 6, 1, 6, 1, 6, 6, 2, 6, 1, 6]
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2023-03-22 14:07:41] [INFO ] Unfolded HLPN to a Petri net with 700 places and 10740 transitions 89778 arcs in 162 ms.
[2023-03-22 14:07:41] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Incomplete random walk after 10000 steps, including 69 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 13) seen :24
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :16
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :18
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :16
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :17
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :18
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :18
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :16
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :17
[2023-03-22 14:07:41] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
// Phase 1: matrix 2634 rows 700 cols
[2023-03-22 14:07:41] [INFO ] Computed 58 place invariants in 142 ms
[2023-03-22 14:07:41] [INFO ] [Real]Absence check using 24 positive place invariants in 12 ms returned sat
[2023-03-22 14:07:41] [INFO ] [Real]Absence check using 24 positive and 34 generalized place invariants in 26 ms returned unsat
[2023-03-22 14:07:42] [INFO ] [Real]Absence check using 24 positive place invariants in 12 ms returned sat
[2023-03-22 14:07:42] [INFO ] [Real]Absence check using 24 positive and 34 generalized place invariants in 29 ms returned sat
[2023-03-22 14:07:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:42] [INFO ] [Real]Absence check using state equation in 835 ms returned sat
[2023-03-22 14:07:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:07:43] [INFO ] [Nat]Absence check using 24 positive place invariants in 16 ms returned sat
[2023-03-22 14:07:43] [INFO ] [Nat]Absence check using 24 positive and 34 generalized place invariants in 29 ms returned sat
[2023-03-22 14:07:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:44] [INFO ] [Nat]Absence check using state equation in 1578 ms returned sat
[2023-03-22 14:07:44] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-22 14:07:47] [INFO ] [Nat]Added 168 Read/Feed constraints in 2799 ms returned sat
[2023-03-22 14:07:48] [INFO ] Deduced a trap composed of 306 places in 499 ms of which 1 ms to minimize.
[2023-03-22 14:07:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 14:07:48] [INFO ] [Real]Absence check using 24 positive place invariants in 12 ms returned sat
[2023-03-22 14:07:48] [INFO ] [Real]Absence check using 24 positive and 34 generalized place invariants in 26 ms returned unsat
[2023-03-22 14:07:48] [INFO ] [Real]Absence check using 24 positive place invariants in 14 ms returned sat
[2023-03-22 14:07:48] [INFO ] [Real]Absence check using 24 positive and 34 generalized place invariants in 24 ms returned unsat
[2023-03-22 14:07:48] [INFO ] [Real]Absence check using 24 positive place invariants in 13 ms returned sat
[2023-03-22 14:07:48] [INFO ] [Real]Absence check using 24 positive and 34 generalized place invariants in 28 ms returned unsat
[2023-03-22 14:07:48] [INFO ] [Real]Absence check using 24 positive place invariants in 12 ms returned sat
[2023-03-22 14:07:48] [INFO ] [Real]Absence check using 24 positive and 34 generalized place invariants in 26 ms returned unsat
[2023-03-22 14:07:48] [INFO ] [Real]Absence check using 24 positive place invariants in 11 ms returned sat
[2023-03-22 14:07:48] [INFO ] [Real]Absence check using 24 positive and 34 generalized place invariants in 25 ms returned unsat
[2023-03-22 14:07:48] [INFO ] [Real]Absence check using 24 positive place invariants in 11 ms returned sat
[2023-03-22 14:07:48] [INFO ] [Real]Absence check using 24 positive and 34 generalized place invariants in 29 ms returned sat
[2023-03-22 14:07:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:49] [INFO ] [Real]Absence check using state equation in 907 ms returned sat
[2023-03-22 14:07:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:07:49] [INFO ] [Nat]Absence check using 24 positive place invariants in 12 ms returned sat
[2023-03-22 14:07:49] [INFO ] [Nat]Absence check using 24 positive and 34 generalized place invariants in 24 ms returned unsat
Current structural bounds on expressions (after SMT) : [6, 6, 1, 1, 1, 1, 1, 2] Max seen :[6, 5, 1, 1, 1, 1, 1, 2]
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-00 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 6 out of 700 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Ensure Unique test removed 6 places
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 694 transition count 2616
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 114 place count 640 transition count 2616
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 114 place count 640 transition count 2532
Deduced a syphon composed of 84 places in 3 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 282 place count 556 transition count 2532
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 426 place count 484 transition count 2460
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 438 place count 484 transition count 2448
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 450 place count 472 transition count 2448
Applied a total of 450 rules in 383 ms. Remains 472 /700 variables (removed 228) and now considering 2448/2670 (removed 222) transitions.
[2023-03-22 14:07:50] [INFO ] Flow matrix only has 2412 transitions (discarded 36 similar events)
// Phase 1: matrix 2412 rows 472 cols
[2023-03-22 14:07:50] [INFO ] Computed 52 place invariants in 76 ms
[2023-03-22 14:07:51] [INFO ] Dead Transitions using invariants and state equation in 1179 ms found 918 transitions.
Found 918 dead transitions using SMT.
Drop transitions removed 918 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 918 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 472/700 places, 1530/2670 transitions.
Applied a total of 0 rules in 38 ms. Remains 472 /472 variables (removed 0) and now considering 1530/1530 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1602 ms. Remains : 472/700 places, 1530/2670 transitions.
Normalized transition count is 1494 out of 1530 initially.
// Phase 1: matrix 1494 rows 472 cols
[2023-03-22 14:07:51] [INFO ] Computed 52 place invariants in 25 ms
Incomplete random walk after 1000000 steps, including 10958 resets, run finished after 5216 ms. (steps per millisecond=191 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 1291 resets, run finished after 1970 ms. (steps per millisecond=507 ) properties (out of 1) seen :5
[2023-03-22 14:07:58] [INFO ] Flow matrix only has 1494 transitions (discarded 36 similar events)
// Phase 1: matrix 1494 rows 472 cols
[2023-03-22 14:07:58] [INFO ] Computed 52 place invariants in 31 ms
[2023-03-22 14:07:58] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-22 14:07:58] [INFO ] [Real]Absence check using 19 positive and 33 generalized place invariants in 17 ms returned sat
[2023-03-22 14:07:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:07:59] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2023-03-22 14:07:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:07:59] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-22 14:07:59] [INFO ] [Nat]Absence check using 19 positive and 33 generalized place invariants in 24 ms returned sat
[2023-03-22 14:07:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:08:00] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2023-03-22 14:08:00] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-22 14:08:02] [INFO ] [Nat]Added 168 Read/Feed constraints in 1973 ms returned sat
[2023-03-22 14:08:02] [INFO ] Deduced a trap composed of 36 places in 240 ms of which 1 ms to minimize.
[2023-03-22 14:08:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 289 ms
Current structural bounds on expressions (after SMT) : [5] Max seen :[5]
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 25918 ms.
ITS solved all properties within timeout

BK_STOP 1679494083131

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is PolyORBLF-COL-S06J06T06, 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 r299-tall-167873953000477"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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