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.r114-smll-165264477200109.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 HealthRecord-PT-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477200109
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 6.0K Apr 30 11:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 30 11:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 10:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 30 10:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 51K 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 HealthRecord-PT-05-UpperBounds-00
FORMULA_NAME HealthRecord-PT-05-UpperBounds-01
FORMULA_NAME HealthRecord-PT-05-UpperBounds-02
FORMULA_NAME HealthRecord-PT-05-UpperBounds-03
FORMULA_NAME HealthRecord-PT-05-UpperBounds-04
FORMULA_NAME HealthRecord-PT-05-UpperBounds-05
FORMULA_NAME HealthRecord-PT-05-UpperBounds-06
FORMULA_NAME HealthRecord-PT-05-UpperBounds-07
FORMULA_NAME HealthRecord-PT-05-UpperBounds-08
FORMULA_NAME HealthRecord-PT-05-UpperBounds-09
FORMULA_NAME HealthRecord-PT-05-UpperBounds-10
FORMULA_NAME HealthRecord-PT-05-UpperBounds-11
FORMULA_NAME HealthRecord-PT-05-UpperBounds-12
FORMULA_NAME HealthRecord-PT-05-UpperBounds-13
FORMULA_NAME HealthRecord-PT-05-UpperBounds-14
FORMULA_NAME HealthRecord-PT-05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652693102812

Running Version 202205111006
[2022-05-16 09:25:05] [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 09:25:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 09:25:05] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2022-05-16 09:25:05] [INFO ] Transformed 125 places.
[2022-05-16 09:25:05] [INFO ] Transformed 246 transitions.
[2022-05-16 09:25:05] [INFO ] Found NUPN structural information;
[2022-05-16 09:25:05] [INFO ] Parsed PT model containing 125 places and 246 transitions in 452 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
Normalized transition count is 229 out of 237 initially.
// Phase 1: matrix 229 rows 125 cols
[2022-05-16 09:25:05] [INFO ] Computed 14 place invariants in 151 ms
Incomplete random walk after 10000 steps, including 930 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 16) seen :9
FORMULA HealthRecord-PT-05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 122 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 126 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :1
FORMULA HealthRecord-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 122 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
[2022-05-16 09:25:06] [INFO ] Flow matrix only has 229 transitions (discarded 8 similar events)
// Phase 1: matrix 229 rows 125 cols
[2022-05-16 09:25:06] [INFO ] Computed 14 place invariants in 16 ms
[2022-05-16 09:25:06] [INFO ] [Real]Absence check using 8 positive place invariants in 23 ms returned sat
[2022-05-16 09:25:06] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 8 ms returned sat
[2022-05-16 09:25:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:25:06] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2022-05-16 09:25:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:25:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 18 ms returned sat
[2022-05-16 09:25:07] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 9 ms returned sat
[2022-05-16 09:25:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:25:07] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2022-05-16 09:25:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:25:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-16 09:25:07] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 57 ms.
[2022-05-16 09:25:07] [INFO ] Added : 9 causal constraints over 2 iterations in 173 ms. Result :sat
Minimization took 38 ms.
[2022-05-16 09:25:07] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2022-05-16 09:25:07] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2022-05-16 09:25:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:25:07] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2022-05-16 09:25:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:25:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2022-05-16 09:25:07] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2022-05-16 09:25:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:25:08] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2022-05-16 09:25:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-16 09:25:08] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 10 ms to minimize.
[2022-05-16 09:25:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2022-05-16 09:25:08] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 49 ms.
[2022-05-16 09:25:08] [INFO ] Added : 9 causal constraints over 2 iterations in 117 ms. Result :sat
Minimization took 30 ms.
[2022-05-16 09:25:08] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2022-05-16 09:25:08] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-16 09:25:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:25:08] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2022-05-16 09:25:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:25:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2022-05-16 09:25:08] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-16 09:25:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:25:08] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2022-05-16 09:25:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-16 09:25:08] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 40 ms.
[2022-05-16 09:25:08] [INFO ] Added : 11 causal constraints over 3 iterations in 138 ms. Result :sat
Minimization took 37 ms.
[2022-05-16 09:25:09] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2022-05-16 09:25:09] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2022-05-16 09:25:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:25:09] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2022-05-16 09:25:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:25:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2022-05-16 09:25:09] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-16 09:25:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:25:09] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2022-05-16 09:25:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-16 09:25:09] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 41 ms.
[2022-05-16 09:25:09] [INFO ] Added : 20 causal constraints over 5 iterations in 193 ms. Result :sat
Minimization took 41 ms.
[2022-05-16 09:25:09] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2022-05-16 09:25:09] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2022-05-16 09:25:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:25:09] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2022-05-16 09:25:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:25:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2022-05-16 09:25:09] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2022-05-16 09:25:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:25:10] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2022-05-16 09:25:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-16 09:25:10] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 41 ms.
[2022-05-16 09:25:10] [INFO ] Added : 9 causal constraints over 2 iterations in 120 ms. Result :sat
Minimization took 36 ms.
[2022-05-16 09:25:10] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2022-05-16 09:25:10] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-16 09:25:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:25:10] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2022-05-16 09:25:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:25:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2022-05-16 09:25:10] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-16 09:25:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:25:10] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2022-05-16 09:25:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-16 09:25:10] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 2 ms to minimize.
[2022-05-16 09:25:10] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2022-05-16 09:25:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 275 ms
[2022-05-16 09:25:11] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 38 ms.
[2022-05-16 09:25:11] [INFO ] Added : 5 causal constraints over 1 iterations in 100 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA HealthRecord-PT-05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 125 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 125/125 places, 237/237 transitions.
Graph (trivial) has 179 edges and 125 vertex of which 6 / 125 are part of one of the 3 SCC in 7 ms
Free SCC test removed 3 places
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 457 edges and 122 vertex of which 100 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.4 ms
Discarding 22 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 0 with 90 rules applied. Total rules applied 92 place count 100 transition count 123
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 148 place count 44 transition count 67
Iterating global reduction 1 with 56 rules applied. Total rules applied 204 place count 44 transition count 67
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 204 place count 44 transition count 61
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 216 place count 38 transition count 61
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 228 place count 26 transition count 41
Iterating global reduction 1 with 12 rules applied. Total rules applied 240 place count 26 transition count 41
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 242 place count 26 transition count 39
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 245 place count 23 transition count 34
Iterating global reduction 2 with 3 rules applied. Total rules applied 248 place count 23 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 249 place count 23 transition count 33
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 251 place count 21 transition count 31
Iterating global reduction 3 with 2 rules applied. Total rules applied 253 place count 21 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 255 place count 21 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 259 place count 19 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 260 place count 18 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 17 transition count 26
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 17 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 265 place count 16 transition count 23
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 266 place count 15 transition count 22
Iterating global reduction 5 with 1 rules applied. Total rules applied 267 place count 15 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 268 place count 15 transition count 21
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 269 place count 15 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 270 place count 14 transition count 20
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 271 place count 14 transition count 20
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 272 place count 14 transition count 19
Applied a total of 272 rules in 75 ms. Remains 14 /125 variables (removed 111) and now considering 19/237 (removed 218) transitions.
Finished structural reductions, in 1 iterations. Remains : 14/125 places, 19/237 transitions.
// Phase 1: matrix 19 rows 14 cols
[2022-05-16 09:25:11] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 131413 resets, run finished after 1095 ms. (steps per millisecond=913 ) properties (out of 3) seen :3
FORMULA HealthRecord-PT-05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 7202 ms.

BK_STOP 1652693112468

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="HealthRecord-PT-05"
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-05, 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 r114-smll-165264477200109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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