Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r202-smll-167840348500293.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is HealthRecord-PT-08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348500293
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 18:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 17:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 17:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 18:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 37K Feb 26 18:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 18:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 68K Mar 5 18:22 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-08-UpperBounds-00
FORMULA_NAME HealthRecord-PT-08-UpperBounds-01
FORMULA_NAME HealthRecord-PT-08-UpperBounds-02
FORMULA_NAME HealthRecord-PT-08-UpperBounds-03
FORMULA_NAME HealthRecord-PT-08-UpperBounds-04
FORMULA_NAME HealthRecord-PT-08-UpperBounds-05
FORMULA_NAME HealthRecord-PT-08-UpperBounds-06
FORMULA_NAME HealthRecord-PT-08-UpperBounds-07
FORMULA_NAME HealthRecord-PT-08-UpperBounds-08
FORMULA_NAME HealthRecord-PT-08-UpperBounds-09
FORMULA_NAME HealthRecord-PT-08-UpperBounds-10
FORMULA_NAME HealthRecord-PT-08-UpperBounds-11
FORMULA_NAME HealthRecord-PT-08-UpperBounds-12
FORMULA_NAME HealthRecord-PT-08-UpperBounds-13
FORMULA_NAME HealthRecord-PT-08-UpperBounds-14
FORMULA_NAME HealthRecord-PT-08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678690569683

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-08
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 06:56:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 06:56:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 06:56:13] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2023-03-13 06:56:13] [INFO ] Transformed 156 places.
[2023-03-13 06:56:13] [INFO ] Transformed 326 transitions.
[2023-03-13 06:56:13] [INFO ] Found NUPN structural information;
[2023-03-13 06:56:13] [INFO ] Parsed PT model containing 156 places and 326 transitions and 855 arcs in 363 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Normalized transition count is 288 out of 300 initially.
// Phase 1: matrix 288 rows 156 cols
[2023-03-13 06:56:13] [INFO ] Computed 18 place invariants in 36 ms
Incomplete random walk after 10000 steps, including 551 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :10
FORMULA HealthRecord-PT-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :1
FORMULA HealthRecord-PT-08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 75 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :0
[2023-03-13 06:56:14] [INFO ] Flow matrix only has 288 transitions (discarded 12 similar events)
// Phase 1: matrix 288 rows 156 cols
[2023-03-13 06:56:14] [INFO ] Computed 18 place invariants in 7 ms
[2023-03-13 06:56:14] [INFO ] [Real]Absence check using 10 positive place invariants in 26 ms returned sat
[2023-03-13 06:56:14] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 23 ms returned sat
[2023-03-13 06:56:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 06:56:14] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2023-03-13 06:56:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 06:56:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-13 06:56:14] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-13 06:56:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 06:56:15] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2023-03-13 06:56:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 06:56:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 21 ms returned sat
[2023-03-13 06:56:15] [INFO ] Deduced a trap composed of 29 places in 226 ms of which 8 ms to minimize.
[2023-03-13 06:56:15] [INFO ] Deduced a trap composed of 29 places in 182 ms of which 1 ms to minimize.
[2023-03-13 06:56:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 555 ms
[2023-03-13 06:56:15] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 73 ms.
[2023-03-13 06:56:16] [INFO ] Added : 20 causal constraints over 4 iterations in 256 ms. Result :sat
Minimization took 61 ms.
[2023-03-13 06:56:16] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-13 06:56:16] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-13 06:56:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 06:56:16] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2023-03-13 06:56:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 06:56:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-13 06:56:16] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-13 06:56:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 06:56:16] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2023-03-13 06:56:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 14 ms returned sat
[2023-03-13 06:56:16] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 2 ms to minimize.
[2023-03-13 06:56:16] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2023-03-13 06:56:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 145 ms
[2023-03-13 06:56:16] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 34 ms.
[2023-03-13 06:56:16] [INFO ] Added : 16 causal constraints over 4 iterations in 130 ms. Result :sat
Minimization took 32 ms.
[2023-03-13 06:56:16] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-13 06:56:16] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-13 06:56:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 06:56:17] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2023-03-13 06:56:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 06:56:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-13 06:56:17] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-13 06:56:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 06:56:17] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2023-03-13 06:56:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-13 06:56:17] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 2 ms to minimize.
[2023-03-13 06:56:17] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 1 ms to minimize.
[2023-03-13 06:56:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 265 ms
[2023-03-13 06:56:17] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 31 ms.
[2023-03-13 06:56:17] [INFO ] Added : 10 causal constraints over 2 iterations in 95 ms. Result :sat
Minimization took 31 ms.
[2023-03-13 06:56:17] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-13 06:56:17] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-13 06:56:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 06:56:17] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2023-03-13 06:56:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 06:56:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-13 06:56:17] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-13 06:56:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 06:56:18] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2023-03-13 06:56:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 06:56:18] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 42 ms.
[2023-03-13 06:56:18] [INFO ] Added : 10 causal constraints over 2 iterations in 118 ms. Result :sat
Minimization took 29 ms.
[2023-03-13 06:56:18] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-13 06:56:18] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-13 06:56:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 06:56:18] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2023-03-13 06:56:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 06:56:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-13 06:56:18] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-13 06:56:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 06:56:18] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2023-03-13 06:56:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-13 06:56:18] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2023-03-13 06:56:18] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2023-03-13 06:56:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 167 ms
[2023-03-13 06:56:18] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 28 ms.
[2023-03-13 06:56:18] [INFO ] Added : 14 causal constraints over 3 iterations in 124 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA HealthRecord-PT-08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 300/300 transitions.
Graph (trivial) has 234 edges and 156 vertex of which 12 / 156 are part of one of the 6 SCC in 9 ms
Free SCC test removed 6 places
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Graph (complete) has 650 edges and 150 vertex of which 118 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Discarding 32 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Drop transitions removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 0 with 108 rules applied. Total rules applied 110 place count 118 transition count 149
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 185 place count 43 transition count 74
Iterating global reduction 1 with 75 rules applied. Total rules applied 260 place count 43 transition count 74
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 260 place count 43 transition count 71
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 266 place count 40 transition count 71
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 278 place count 28 transition count 57
Iterating global reduction 1 with 12 rules applied. Total rules applied 290 place count 28 transition count 57
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 299 place count 28 transition count 48
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 301 place count 26 transition count 45
Iterating global reduction 2 with 2 rules applied. Total rules applied 303 place count 26 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 304 place count 26 transition count 44
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 305 place count 25 transition count 43
Iterating global reduction 3 with 1 rules applied. Total rules applied 306 place count 25 transition count 43
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 309 place count 25 transition count 40
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 317 place count 21 transition count 36
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 318 place count 21 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 319 place count 20 transition count 34
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 10 edges and 18 vertex of which 2 / 18 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 323 place count 17 transition count 33
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 329 place count 16 transition count 28
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 329 place count 16 transition count 25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 335 place count 13 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 336 place count 13 transition count 24
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 6 with 2 rules applied. Total rules applied 338 place count 12 transition count 23
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 341 place count 12 transition count 20
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 342 place count 12 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 343 place count 11 transition count 19
Applied a total of 343 rules in 119 ms. Remains 11 /156 variables (removed 145) and now considering 19/300 (removed 281) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 11/156 places, 19/300 transitions.
Normalized transition count is 15 out of 19 initially.
// Phase 1: matrix 15 rows 11 cols
[2023-03-13 06:56:19] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 867 ms. (steps per millisecond=1153 ) properties (out of 3) seen :2
FORMULA HealthRecord-PT-08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 459 ms. (steps per millisecond=2178 ) properties (out of 1) seen :1
FORMULA HealthRecord-PT-08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 6994 ms.
ITS solved all properties within timeout

BK_STOP 1678690581657

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is HealthRecord-PT-08, 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 r202-smll-167840348500293"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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