Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 44K Apr 30 09:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 212K Apr 30 09:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 34K Apr 30 09:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 169K Apr 30 09:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 19K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.6K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 143K 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 Peterson-PT-3-UpperBounds-00
FORMULA_NAME Peterson-PT-3-UpperBounds-01
FORMULA_NAME Peterson-PT-3-UpperBounds-02
FORMULA_NAME Peterson-PT-3-UpperBounds-03
FORMULA_NAME Peterson-PT-3-UpperBounds-04
FORMULA_NAME Peterson-PT-3-UpperBounds-05
FORMULA_NAME Peterson-PT-3-UpperBounds-06
FORMULA_NAME Peterson-PT-3-UpperBounds-07
FORMULA_NAME Peterson-PT-3-UpperBounds-08
FORMULA_NAME Peterson-PT-3-UpperBounds-09
FORMULA_NAME Peterson-PT-3-UpperBounds-10
FORMULA_NAME Peterson-PT-3-UpperBounds-11
FORMULA_NAME Peterson-PT-3-UpperBounds-12
FORMULA_NAME Peterson-PT-3-UpperBounds-13
FORMULA_NAME Peterson-PT-3-UpperBounds-14
FORMULA_NAME Peterson-PT-3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652779841529

Running Version 202205111006
[2022-05-17 09:30:43] [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-17 09:30:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 09:30:43] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2022-05-17 09:30:43] [INFO ] Transformed 244 places.
[2022-05-17 09:30:43] [INFO ] Transformed 332 transitions.
[2022-05-17 09:30:43] [INFO ] Found NUPN structural information;
[2022-05-17 09:30:43] [INFO ] Completing missing partition info from NUPN : creating a component with [TestAlone_1_2_3, TestAlone_2_2_3]
[2022-05-17 09:30:43] [INFO ] Parsed PT model containing 244 places and 332 transitions in 195 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
FORMULA Peterson-PT-3-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 308 out of 332 initially.
// Phase 1: matrix 308 rows 244 cols
[2022-05-17 09:30:43] [INFO ] Computed 15 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :18
FORMULA Peterson-PT-3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :5
[2022-05-17 09:30:43] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2022-05-17 09:30:43] [INFO ] Computed 15 place invariants in 7 ms
[2022-05-17 09:30:43] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned unsat
[2022-05-17 09:30:43] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-17 09:30:43] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-17 09:30:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:30:43] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2022-05-17 09:30:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:30:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-05-17 09:30:43] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-17 09:30:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:30:44] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2022-05-17 09:30:44] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-17 09:30:44] [INFO ] [Nat]Added 57 Read/Feed constraints in 17 ms returned sat
[2022-05-17 09:30:44] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 3 ms to minimize.
[2022-05-17 09:30:44] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 1 ms to minimize.
[2022-05-17 09:30:44] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2022-05-17 09:30:44] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 1 ms to minimize.
[2022-05-17 09:30:44] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 1 ms to minimize.
[2022-05-17 09:30:44] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2022-05-17 09:30:44] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2022-05-17 09:30:44] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2022-05-17 09:30:45] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 0 ms to minimize.
[2022-05-17 09:30:45] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1124 ms
[2022-05-17 09:30:45] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 36 ms.
[2022-05-17 09:30:45] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2022-05-17 09:30:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2022-05-17 09:30:45] [INFO ] Added : 113 causal constraints over 24 iterations in 751 ms. Result :sat
Minimization took 109 ms.
[2022-05-17 09:30:46] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-05-17 09:30:46] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-17 09:30:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:30:46] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2022-05-17 09:30:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:30:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-05-17 09:30:46] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-17 09:30:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:30:46] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2022-05-17 09:30:46] [INFO ] [Nat]Added 57 Read/Feed constraints in 12 ms returned sat
[2022-05-17 09:30:46] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2022-05-17 09:30:46] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2022-05-17 09:30:46] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2022-05-17 09:30:46] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2022-05-17 09:30:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 346 ms
[2022-05-17 09:30:46] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 48, 3, 4] Max seen :[4, 2, 3, 4]
FORMULA Peterson-PT-3-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 48 out of 244 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 244 transition count 296
Reduce places removed 36 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 1 with 72 rules applied. Total rules applied 108 place count 208 transition count 260
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 144 place count 172 transition count 260
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 144 place count 172 transition count 236
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 192 place count 148 transition count 236
Applied a total of 192 rules in 133 ms. Remains 148 /244 variables (removed 96) and now considering 236/332 (removed 96) transitions.
Finished structural reductions, in 1 iterations. Remains : 148/244 places, 236/332 transitions.
Normalized transition count is 212 out of 236 initially.
// Phase 1: matrix 212 rows 148 cols
[2022-05-17 09:30:46] [INFO ] Computed 15 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1611 ms. (steps per millisecond=620 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 827 ms. (steps per millisecond=1209 ) properties (out of 1) seen :1
[2022-05-17 09:30:49] [INFO ] Flow matrix only has 212 transitions (discarded 24 similar events)
// Phase 1: matrix 212 rows 148 cols
[2022-05-17 09:30:49] [INFO ] Computed 15 place invariants in 7 ms
[2022-05-17 09:30:49] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-17 09:30:49] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-17 09:30:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:30:49] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2022-05-17 09:30:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:30:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-17 09:30:49] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-17 09:30:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:30:49] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-05-17 09:30:49] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-17 09:30:49] [INFO ] [Nat]Added 57 Read/Feed constraints in 12 ms returned sat
[2022-05-17 09:30:49] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
[2022-05-17 09:30:49] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2022-05-17 09:30:49] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2022-05-17 09:30:49] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2022-05-17 09:30:50] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2022-05-17 09:30:50] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2022-05-17 09:30:50] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2022-05-17 09:30:50] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2022-05-17 09:30:50] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2022-05-17 09:30:50] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2022-05-17 09:30:50] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2022-05-17 09:30:50] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2022-05-17 09:30:50] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 0 ms to minimize.
[2022-05-17 09:30:50] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 874 ms
[2022-05-17 09:30:50] [INFO ] Computed and/alt/rep : 187/389/187 causal constraints (skipped 21 transitions) in 17 ms.
[2022-05-17 09:30:50] [INFO ] Added : 74 causal constraints over 15 iterations in 280 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : [48] Max seen :[3]
Support contains 48 out of 148 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 148/148 places, 236/236 transitions.
Applied a total of 0 rules in 12 ms. Remains 148 /148 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 148/148 places, 236/236 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 148/148 places, 236/236 transitions.
Applied a total of 0 rules in 17 ms. Remains 148 /148 variables (removed 0) and now considering 236/236 (removed 0) transitions.
[2022-05-17 09:30:50] [INFO ] Flow matrix only has 212 transitions (discarded 24 similar events)
// Phase 1: matrix 212 rows 148 cols
[2022-05-17 09:30:50] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-17 09:30:51] [INFO ] Implicit Places using invariants in 89 ms returned [141, 142, 143, 144]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 91 ms to find 4 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 144/148 places, 236/236 transitions.
Applied a total of 0 rules in 7 ms. Remains 144 /144 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 144/148 places, 236/236 transitions.
Normalized transition count is 212 out of 236 initially.
// Phase 1: matrix 212 rows 144 cols
[2022-05-17 09:30:51] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1386 ms. (steps per millisecond=721 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 808 ms. (steps per millisecond=1237 ) properties (out of 1) seen :2
[2022-05-17 09:30:53] [INFO ] Flow matrix only has 212 transitions (discarded 24 similar events)
// Phase 1: matrix 212 rows 144 cols
[2022-05-17 09:30:53] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-17 09:30:53] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
Current structural bounds on expressions (after SMT) : [4] Max seen :[4]
FORMULA Peterson-PT-3-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 10240 ms.

BK_STOP 1652779853356

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-3.tgz
mv Peterson-PT-3 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 ;