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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 7.6K Apr 29 19:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 19:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 19:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 19:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 41K 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 LamportFastMutEx-COL-5-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652742025948

Running Version 0
[2022-05-16 23:00:27] [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-16 23:00:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 23:00:27] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2022-05-16 23:00:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 23:00:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 645 ms
[2022-05-16 23:00:28] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 174 PT places and 396.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
[2022-05-16 23:00:28] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions in 3 ms.
[2022-05-16 23:00:28] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_12746119630166822242.dot
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 17 rows 15 cols
[2022-05-16 23:00:28] [INFO ] Computed 2 place invariants in 7 ms
FORMULA LamportFastMutEx-COL-5-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-UpperBounds-09 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2022-05-16 23:00:28] [INFO ] Unfolded HLPN to a Petri net with 174 places and 318 transitions in 17 ms.
[2022-05-16 23:00:28] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 17 rows 15 cols
[2022-05-16 23:00:28] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 23:00:28] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:28] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-16 23:00:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:00:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:28] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-16 23:00:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 23:00:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-16 23:00:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 23:00:28] [INFO ] Added : 11 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 6 ms.
[2022-05-16 23:00:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:28] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-16 23:00:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:00:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:28] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-16 23:00:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 23:00:28] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2022-05-16 23:00:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:28] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-16 23:00:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:00:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:28] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-16 23:00:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 23:00:28] [INFO ] Added : 11 causal constraints over 3 iterations in 18 ms. Result :sat
Minimization took 4 ms.
[2022-05-16 23:00:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:28] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 23:00:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:00:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:28] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-16 23:00:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 23:00:28] [INFO ] Added : 11 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 7 ms.
[2022-05-16 23:00:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:28] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 23:00:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:00:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:28] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-16 23:00:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 23:00:28] [INFO ] Added : 11 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 4 ms.
[2022-05-16 23:00:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:28] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-16 23:00:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:00:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:28] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-16 23:00:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 23:00:28] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 6 ms.
[2022-05-16 23:00:28] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:28] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 23:00:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:00:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:28] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-16 23:00:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 23:00:28] [INFO ] Added : 11 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 5 ms.
[2022-05-16 23:00:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:28] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-16 23:00:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:00:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:28] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-16 23:00:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 23:00:28] [INFO ] Added : 12 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 5 ms.
[2022-05-16 23:00:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:28] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 23:00:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:00:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:28] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-16 23:00:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 23:00:28] [INFO ] Added : 13 causal constraints over 4 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2022-05-16 23:00:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:28] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-16 23:00:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:00:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:28] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-16 23:00:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 23:00:28] [INFO ] Added : 11 causal constraints over 3 iterations in 8 ms. Result :sat
Minimization took 7 ms.
[2022-05-16 23:00:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:28] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 23:00:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:00:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:28] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-16 23:00:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 23:00:28] [INFO ] Added : 11 causal constraints over 3 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2022-05-16 23:00:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 23:00:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:28] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 23:00:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:00:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 23:00:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-16 23:00:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-16 23:00:29] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 23:00:29] [INFO ] Added : 11 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [5, 5, 5, 5, 5, 5, 5, 5, 5, 25, 5, 5]
[2022-05-16 23:00:29] [INFO ] Unfolded HLPN to a Petri net with 174 places and 318 transitions in 5 ms.
[2022-05-16 23:00:29] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_9422955833265681142.dot
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 58 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :59
FORMULA LamportFastMutEx-COL-5-UpperBounds-08 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :49
FORMULA LamportFastMutEx-COL-5-UpperBounds-14 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :42
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :19
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :35
FORMULA LamportFastMutEx-COL-5-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :23
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :39
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :34
[2022-05-16 23:00:29] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-16 23:00:29] [INFO ] Computed 37 place invariants in 6 ms
[2022-05-16 23:00:29] [INFO ] [Real]Absence check using 37 positive place invariants in 11 ms returned sat
[2022-05-16 23:00:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:29] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-05-16 23:00:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:00:29] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2022-05-16 23:00:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:29] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-05-16 23:00:29] [INFO ] State equation strengthened by 65 read => feed constraints.
[2022-05-16 23:00:29] [INFO ] [Nat]Added 65 Read/Feed constraints in 12 ms returned sat
[2022-05-16 23:00:29] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 3 ms to minimize.
[2022-05-16 23:00:29] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2022-05-16 23:00:29] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2022-05-16 23:00:29] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2022-05-16 23:00:29] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2022-05-16 23:00:29] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2022-05-16 23:00:29] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2022-05-16 23:00:29] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2022-05-16 23:00:29] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2022-05-16 23:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 537 ms
[2022-05-16 23:00:29] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2022-05-16 23:00:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:29] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2022-05-16 23:00:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:00:30] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2022-05-16 23:00:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:30] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2022-05-16 23:00:30] [INFO ] [Nat]Added 65 Read/Feed constraints in 7 ms returned sat
[2022-05-16 23:00:30] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2022-05-16 23:00:30] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2022-05-16 23:00:30] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2022-05-16 23:00:30] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2022-05-16 23:00:30] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2022-05-16 23:00:30] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2022-05-16 23:00:30] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2022-05-16 23:00:30] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2022-05-16 23:00:30] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2022-05-16 23:00:30] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2022-05-16 23:00:30] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2022-05-16 23:00:30] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2022-05-16 23:00:30] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2022-05-16 23:00:30] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2022-05-16 23:00:30] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2022-05-16 23:00:30] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2022-05-16 23:00:30] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2022-05-16 23:00:30] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2022-05-16 23:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 18 trap constraints in 798 ms
[2022-05-16 23:00:30] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2022-05-16 23:00:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:30] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2022-05-16 23:00:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:00:30] [INFO ] [Nat]Absence check using 37 positive place invariants in 13 ms returned sat
[2022-05-16 23:00:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:30] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-05-16 23:00:31] [INFO ] [Nat]Added 65 Read/Feed constraints in 6 ms returned sat
[2022-05-16 23:00:31] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2022-05-16 23:00:31] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2022-05-16 23:00:31] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2022-05-16 23:00:31] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2022-05-16 23:00:31] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2022-05-16 23:00:31] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2022-05-16 23:00:31] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 0 ms to minimize.
[2022-05-16 23:00:31] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 5 ms to minimize.
[2022-05-16 23:00:31] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 402 ms
[2022-05-16 23:00:31] [INFO ] Computed and/alt/rep : 175/790/175 causal constraints (skipped 20 transitions) in 15 ms.
[2022-05-16 23:00:31] [INFO ] Added : 121 causal constraints over 25 iterations in 378 ms. Result :sat
Minimization took 89 ms.
[2022-05-16 23:00:31] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2022-05-16 23:00:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:31] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2022-05-16 23:00:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:00:31] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2022-05-16 23:00:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:32] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2022-05-16 23:00:32] [INFO ] [Nat]Added 65 Read/Feed constraints in 6 ms returned sat
[2022-05-16 23:00:32] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2022-05-16 23:00:32] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2022-05-16 23:00:32] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2022-05-16 23:00:32] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2022-05-16 23:00:32] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2022-05-16 23:00:32] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2022-05-16 23:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 228 ms
[2022-05-16 23:00:32] [INFO ] [Real]Absence check using 37 positive place invariants in 5 ms returned sat
[2022-05-16 23:00:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:32] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2022-05-16 23:00:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:00:32] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2022-05-16 23:00:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:32] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2022-05-16 23:00:32] [INFO ] [Nat]Added 65 Read/Feed constraints in 6 ms returned sat
[2022-05-16 23:00:32] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2022-05-16 23:00:32] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2022-05-16 23:00:32] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 0 ms to minimize.
[2022-05-16 23:00:32] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2022-05-16 23:00:32] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2022-05-16 23:00:32] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2022-05-16 23:00:32] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2022-05-16 23:00:32] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2022-05-16 23:00:32] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2022-05-16 23:00:32] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2022-05-16 23:00:32] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2022-05-16 23:00:32] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2022-05-16 23:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 582 ms
[2022-05-16 23:00:32] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2022-05-16 23:00:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:32] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2022-05-16 23:00:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:00:33] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2022-05-16 23:00:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:33] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2022-05-16 23:00:33] [INFO ] [Nat]Added 65 Read/Feed constraints in 6 ms returned sat
[2022-05-16 23:00:33] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2022-05-16 23:00:33] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2022-05-16 23:00:33] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2022-05-16 23:00:33] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2022-05-16 23:00:33] [INFO ] Deduced a trap composed of 27 places in 22 ms of which 0 ms to minimize.
[2022-05-16 23:00:33] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 0 ms to minimize.
[2022-05-16 23:00:33] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 0 ms to minimize.
[2022-05-16 23:00:33] [INFO ] Deduced a trap composed of 11 places in 15 ms of which 0 ms to minimize.
[2022-05-16 23:00:33] [INFO ] Deduced a trap composed of 11 places in 15 ms of which 1 ms to minimize.
[2022-05-16 23:00:33] [INFO ] Deduced a trap composed of 30 places in 20 ms of which 0 ms to minimize.
[2022-05-16 23:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 300 ms
[2022-05-16 23:00:33] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2022-05-16 23:00:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:33] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2022-05-16 23:00:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:00:33] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2022-05-16 23:00:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:33] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2022-05-16 23:00:33] [INFO ] [Nat]Added 65 Read/Feed constraints in 7 ms returned sat
[2022-05-16 23:00:33] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2022-05-16 23:00:33] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2022-05-16 23:00:33] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2022-05-16 23:00:33] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2022-05-16 23:00:33] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2022-05-16 23:00:33] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2022-05-16 23:00:33] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2022-05-16 23:00:33] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2022-05-16 23:00:33] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 0 ms to minimize.
[2022-05-16 23:00:33] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2022-05-16 23:00:33] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2022-05-16 23:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 443 ms
[2022-05-16 23:00:33] [INFO ] [Real]Absence check using 37 positive place invariants in 5 ms returned sat
[2022-05-16 23:00:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:33] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2022-05-16 23:00:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:00:34] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2022-05-16 23:00:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:00:34] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-05-16 23:00:34] [INFO ] [Nat]Added 65 Read/Feed constraints in 7 ms returned sat
[2022-05-16 23:00:34] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2022-05-16 23:00:34] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2022-05-16 23:00:34] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2022-05-16 23:00:34] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2022-05-16 23:00:34] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2022-05-16 23:00:34] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2022-05-16 23:00:34] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 0 ms to minimize.
[2022-05-16 23:00:34] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 9 ms to minimize.
[2022-05-16 23:00:34] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2022-05-16 23:00:34] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2022-05-16 23:00:34] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2022-05-16 23:00:34] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2022-05-16 23:00:34] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2022-05-16 23:00:34] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 0 ms to minimize.
[2022-05-16 23:00:34] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 0 ms to minimize.
[2022-05-16 23:00:34] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2022-05-16 23:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 632 ms
Current structural bounds on expressions (after SMT) : [4, 4, 5, 4, 4, 4, 20, 4] Max seen :[4, 4, 3, 4, 4, 4, 20, 4]
FORMULA LamportFastMutEx-COL-5-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-12 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 27000 steps, including 911 resets, run finished after 67 ms. (steps per millisecond=402 ) properties (out of 1) seen :5 could not realise parikh vector
FORMULA LamportFastMutEx-COL-5-UpperBounds-02 5 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652742035906

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is LamportFastMutEx-COL-5, 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 r143-tall-165271830300136"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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