Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 14K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 140K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.3K May 11 18:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 11 18:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 11 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K May 11 15:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 49K May 12 08:13 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 net-UpperBounds-00
FORMULA_NAME net-UpperBounds-01
FORMULA_NAME net-UpperBounds-02
FORMULA_NAME net-UpperBounds-03
FORMULA_NAME net-UpperBounds-04
FORMULA_NAME net-UpperBounds-05
FORMULA_NAME net-UpperBounds-06
FORMULA_NAME net-UpperBounds-07
FORMULA_NAME net-UpperBounds-08
FORMULA_NAME net-UpperBounds-09
FORMULA_NAME net-UpperBounds-10
FORMULA_NAME net-UpperBounds-11
FORMULA_NAME net-UpperBounds-12
FORMULA_NAME net-UpperBounds-13
FORMULA_NAME net-UpperBounds-14
FORMULA_NAME net-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621281686206

Running Version 0
[2021-05-17 20:01: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]
[2021-05-17 20:01:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 20:01:27] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2021-05-17 20:01:27] [INFO ] Transformed 157 places.
[2021-05-17 20:01:27] [INFO ] Transformed 327 transitions.
[2021-05-17 20:01:27] [INFO ] Found NUPN structural information;
[2021-05-17 20:01:27] [INFO ] Parsed PT model containing 157 places and 327 transitions in 90 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Normalized transition count is 289 out of 301 initially.
// Phase 1: matrix 289 rows 157 cols
[2021-05-17 20:01:27] [INFO ] Computed 18 place invariants in 21 ms
Incomplete random walk after 10000 steps, including 591 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :10
FORMULA net-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 86 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :2
FORMULA net-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA net-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2021-05-17 20:01:28] [INFO ] Flow matrix only has 289 transitions (discarded 12 similar events)
// Phase 1: matrix 289 rows 157 cols
[2021-05-17 20:01:28] [INFO ] Computed 18 place invariants in 3 ms
[2021-05-17 20:01:28] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-17 20:01:28] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2021-05-17 20:01:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:01:28] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2021-05-17 20:01:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:01:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-17 20:01:28] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:01:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:01:28] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2021-05-17 20:01:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 20:01:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-17 20:01:28] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 3 ms to minimize.
[2021-05-17 20:01:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2021-05-17 20:01:28] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 24 ms.
[2021-05-17 20:01:28] [INFO ] Added : 84 causal constraints over 17 iterations in 274 ms. Result :sat
Minimization took 30 ms.
[2021-05-17 20:01:28] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:01:28] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:01:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:01:29] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2021-05-17 20:01:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:01:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:01:29] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:01:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:01:29] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-17 20:01:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 20:01:29] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 20 ms.
[2021-05-17 20:01:29] [INFO ] Added : 88 causal constraints over 18 iterations in 244 ms. Result :sat
Minimization took 28 ms.
[2021-05-17 20:01:29] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 20:01:29] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:01:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:01:29] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2021-05-17 20:01:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:01:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-17 20:01:29] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:01:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:01:29] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-17 20:01:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 20:01:29] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 19 ms.
[2021-05-17 20:01:29] [INFO ] Added : 97 causal constraints over 20 iterations in 263 ms. Result :sat
Minimization took 30 ms.
[2021-05-17 20:01:29] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:01:29] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:01:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:01:30] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2021-05-17 20:01:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:01:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:01:30] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:01:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:01:30] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2021-05-17 20:01:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 20:01:30] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2021-05-17 20:01:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2021-05-17 20:01:30] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 22 ms.
[2021-05-17 20:01:30] [INFO ] Added : 84 causal constraints over 17 iterations in 236 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 19200 steps, including 631 resets, run finished after 81 ms. (steps per millisecond=237 ) properties (out of 4) seen :3 could not realise parikh vector
FORMULA net-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 21700 steps, including 597 resets, run finished after 74 ms. (steps per millisecond=293 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 20100 steps, including 1002 resets, run finished after 58 ms. (steps per millisecond=346 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 19200 steps, including 564 resets, run finished after 70 ms. (steps per millisecond=274 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 157 places. Attempting structural reductions.
Drop transitions removed 2 transitions
Starting structural reductions, iteration 0 : 157/157 places, 299/299 transitions.
Graph (trivial) has 237 edges and 157 vertex of which 10 / 157 are part of one of the 5 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Graph (complete) has 653 edges and 152 vertex of which 142 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 142 transition count 271
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 19 place count 137 transition count 264
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 place count 135 transition count 264
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 21 place count 135 transition count 261
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 29 place count 130 transition count 261
Discarding 77 places :
Symmetric choice reduction at 3 with 77 rule applications. Total rules 106 place count 53 transition count 107
Iterating global reduction 3 with 77 rules applied. Total rules applied 183 place count 53 transition count 107
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 193 place count 43 transition count 87
Iterating global reduction 3 with 10 rules applied. Total rules applied 203 place count 43 transition count 87
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 212 place count 43 transition count 78
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 215 place count 40 transition count 69
Iterating global reduction 4 with 3 rules applied. Total rules applied 218 place count 40 transition count 69
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 221 place count 37 transition count 63
Iterating global reduction 4 with 3 rules applied. Total rules applied 224 place count 37 transition count 63
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 233 place count 37 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 36 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 236 place count 36 transition count 52
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 248 place count 30 transition count 89
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 250 place count 30 transition count 87
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 252 place count 30 transition count 85
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 254 place count 28 transition count 85
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 257 place count 28 transition count 82
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 258 place count 28 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 259 place count 27 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 260 place count 27 transition count 81
Applied a total of 260 rules in 61 ms. Remains 27 /157 variables (removed 130) and now considering 81/299 (removed 218) transitions.
[2021-05-17 20:01:30] [INFO ] Flow matrix only has 73 transitions (discarded 8 similar events)
// Phase 1: matrix 73 rows 27 cols
[2021-05-17 20:01:30] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-17 20:01:30] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/157 places, 81/299 transitions.
Successfully produced net in file /tmp/petri1000_11204193080274933047.dot
Drop transitions removed 1 transitions
Dominated transitions for bounds rules discarded 1 transitions
Normalized transition count is 72 out of 80 initially.
// Phase 1: matrix 72 rows 27 cols
[2021-05-17 20:01:30] [INFO ] Computed 7 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 305235 resets, run finished after 2174 ms. (steps per millisecond=459 ) properties (out of 1) seen :1
FORMULA net-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621281694005

--------------------
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="HealthRecord-PT-09"
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 HealthRecord-PT-09, 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 r292-tall-162124156300323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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