Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r197-tall-171640625800506.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is HealthRecord-PT-15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625800506
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 20:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 20:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 73K May 18 16:42 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-15-UpperBounds-00
FORMULA_NAME HealthRecord-PT-15-UpperBounds-01
FORMULA_NAME HealthRecord-PT-15-UpperBounds-02
FORMULA_NAME HealthRecord-PT-15-UpperBounds-03
FORMULA_NAME HealthRecord-PT-15-UpperBounds-04
FORMULA_NAME HealthRecord-PT-15-UpperBounds-05
FORMULA_NAME HealthRecord-PT-15-UpperBounds-06
FORMULA_NAME HealthRecord-PT-15-UpperBounds-07
FORMULA_NAME HealthRecord-PT-15-UpperBounds-08
FORMULA_NAME HealthRecord-PT-15-UpperBounds-09
FORMULA_NAME HealthRecord-PT-15-UpperBounds-10
FORMULA_NAME HealthRecord-PT-15-UpperBounds-11
FORMULA_NAME HealthRecord-PT-15-UpperBounds-12
FORMULA_NAME HealthRecord-PT-15-UpperBounds-13
FORMULA_NAME HealthRecord-PT-15-UpperBounds-14
FORMULA_NAME HealthRecord-PT-15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716558408834

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-15
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-24 13:46:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 13:46:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 13:46:50] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2024-05-24 13:46:50] [INFO ] Transformed 163 places.
[2024-05-24 13:46:50] [INFO ] Transformed 348 transitions.
[2024-05-24 13:46:50] [INFO ] Found NUPN structural information;
[2024-05-24 13:46:50] [INFO ] Parsed PT model containing 163 places and 348 transitions and 919 arcs in 118 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 transitions.
Normalized transition count is 307 out of 319 initially.
// Phase 1: matrix 307 rows 163 cols
[2024-05-24 13:46:50] [INFO ] Computed 18 invariants in 16 ms
Incomplete random walk after 10000 steps, including 924 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 16) seen :10
FORMULA HealthRecord-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 122 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :1
FORMULA HealthRecord-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-24 13:46:50] [INFO ] Flow matrix only has 307 transitions (discarded 12 similar events)
// Phase 1: matrix 307 rows 163 cols
[2024-05-24 13:46:50] [INFO ] Computed 18 invariants in 8 ms
[2024-05-24 13:46:50] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2024-05-24 13:46:50] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2024-05-24 13:46:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:46:50] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-24 13:46:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:46:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-24 13:46:51] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 13:46:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:46:51] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-24 13:46:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:46:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2024-05-24 13:46:51] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 27 ms.
[2024-05-24 13:46:51] [INFO ] Added : 18 causal constraints over 5 iterations in 147 ms. Result :sat
Minimization took 28 ms.
[2024-05-24 13:46:51] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 13:46:51] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-24 13:46:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:46:51] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-24 13:46:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:46:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 13:46:51] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-24 13:46:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:46:51] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-24 13:46:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 13:46:51] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 3 ms to minimize.
[2024-05-24 13:46:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2024-05-24 13:46:51] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 25 ms.
[2024-05-24 13:46:51] [INFO ] Added : 10 causal constraints over 2 iterations in 72 ms. Result :sat
Minimization took 21 ms.
[2024-05-24 13:46:51] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 13:46:51] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 13:46:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:46:51] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-24 13:46:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:46:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-05-24 13:46:51] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-24 13:46:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:46:52] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-24 13:46:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 13:46:52] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 0 ms to minimize.
[2024-05-24 13:46:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-24 13:46:52] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 26 ms.
[2024-05-24 13:46:52] [INFO ] Added : 14 causal constraints over 3 iterations in 84 ms. Result :sat
Minimization took 26 ms.
[2024-05-24 13:46:52] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 13:46:52] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-24 13:46:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:46:52] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-24 13:46:52] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 13:46:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:46:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 13:46:52] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 13:46:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:46:52] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-24 13:46:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 13:46:52] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 25 ms.
[2024-05-24 13:46:52] [INFO ] Added : 17 causal constraints over 5 iterations in 114 ms. Result :sat
Minimization took 26 ms.
[2024-05-24 13:46:52] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 13:46:52] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-24 13:46:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:46:52] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-24 13:46:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:46:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 13:46:52] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-24 13:46:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:46:52] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-24 13:46:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 13:46:52] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 20 ms.
[2024-05-24 13:46:53] [INFO ] Added : 12 causal constraints over 3 iterations in 86 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA HealthRecord-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 319/319 transitions.
Graph (trivial) has 245 edges and 163 vertex of which 6 / 163 are part of one of the 3 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 695 edges and 160 vertex of which 134 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.1 ms
Discarding 26 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Iterating post reduction 0 with 121 rules applied. Total rules applied 123 place count 134 transition count 170
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 208 place count 49 transition count 85
Iterating global reduction 1 with 85 rules applied. Total rules applied 293 place count 49 transition count 85
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 293 place count 49 transition count 77
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 309 place count 41 transition count 77
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 323 place count 27 transition count 55
Iterating global reduction 1 with 14 rules applied. Total rules applied 337 place count 27 transition count 55
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 343 place count 27 transition count 49
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 347 place count 23 transition count 42
Iterating global reduction 2 with 4 rules applied. Total rules applied 351 place count 23 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 352 place count 23 transition count 41
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 354 place count 21 transition count 39
Iterating global reduction 3 with 2 rules applied. Total rules applied 356 place count 21 transition count 39
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 362 place count 21 transition count 33
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 366 place count 19 transition count 31
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 367 place count 19 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 368 place count 18 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 369 place count 17 transition count 29
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 373 place count 17 transition count 25
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 375 place count 16 transition count 24
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 376 place count 15 transition count 23
Iterating global reduction 5 with 1 rules applied. Total rules applied 377 place count 15 transition count 23
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 380 place count 15 transition count 20
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 381 place count 15 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 382 place count 14 transition count 19
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 383 place count 14 transition count 19
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 384 place count 14 transition count 18
Applied a total of 384 rules in 35 ms. Remains 14 /163 variables (removed 149) and now considering 18/319 (removed 301) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 14/163 places, 18/319 transitions.
Normalized transition count is 14 out of 18 initially.
// Phase 1: matrix 14 rows 14 cols
[2024-05-24 13:46:53] [INFO ] Computed 3 invariants in 0 ms
Incomplete random walk after 1000000 steps, including 137437 resets, run finished after 690 ms. (steps per millisecond=1449 ) properties (out of 2) seen :2
FORMULA HealthRecord-PT-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 3557 ms.

BK_STOP 1716558414709

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-15"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is HealthRecord-PT-15, 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 r197-tall-171640625800506"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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