About the Execution of GreatSPN+red for HealthRecord-PT-10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
302.260 | 6141.00 | 12549.00 | 41.90 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
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.r179-tall-171640602300773.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 greatspnxred
Input is HealthRecord-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640602300773
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 20:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 12 20:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 20:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 20:29 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 69K 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-10-UpperBounds-00
FORMULA_NAME HealthRecord-PT-10-UpperBounds-01
FORMULA_NAME HealthRecord-PT-10-UpperBounds-02
FORMULA_NAME HealthRecord-PT-10-UpperBounds-03
FORMULA_NAME HealthRecord-PT-10-UpperBounds-04
FORMULA_NAME HealthRecord-PT-10-UpperBounds-05
FORMULA_NAME HealthRecord-PT-10-UpperBounds-06
FORMULA_NAME HealthRecord-PT-10-UpperBounds-07
FORMULA_NAME HealthRecord-PT-10-UpperBounds-08
FORMULA_NAME HealthRecord-PT-10-UpperBounds-09
FORMULA_NAME HealthRecord-PT-10-UpperBounds-10
FORMULA_NAME HealthRecord-PT-10-UpperBounds-11
FORMULA_NAME HealthRecord-PT-10-UpperBounds-12
FORMULA_NAME HealthRecord-PT-10-UpperBounds-13
FORMULA_NAME HealthRecord-PT-10-UpperBounds-14
FORMULA_NAME HealthRecord-PT-10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716490901078
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 19:01:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-23 19:01:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 19:01:42] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-05-23 19:01:42] [INFO ] Transformed 158 places.
[2024-05-23 19:01:42] [INFO ] Transformed 333 transitions.
[2024-05-23 19:01:42] [INFO ] Found NUPN structural information;
[2024-05-23 19:01:42] [INFO ] Parsed PT model containing 158 places and 333 transitions and 875 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-23 19:01:42] [INFO ] Flow matrix only has 294 transitions (discarded 12 similar events)
// Phase 1: matrix 294 rows 158 cols
[2024-05-23 19:01:42] [INFO ] Computed 18 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (630 resets) in 37 ms. (263 steps per ms)
FORMULA HealthRecord-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (319 resets) in 34 ms. (1142 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-05-23 19:01:42] [INFO ] Flow matrix only has 294 transitions (discarded 12 similar events)
[2024-05-23 19:01:42] [INFO ] Invariant cache hit.
[2024-05-23 19:01:42] [INFO ] [Real]Absence check using 10 positive place invariants in 25 ms returned sat
[2024-05-23 19:01:42] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 16 ms returned sat
[2024-05-23 19:01:42] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-05-23 19:01:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 19:01:43] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2024-05-23 19:01:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:01:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-05-23 19:01:43] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2024-05-23 19:01:43] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-23 19:01:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 19:01:43] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 62 ms.
[2024-05-23 19:01:43] [INFO ] Added : 11 causal constraints over 3 iterations in 210 ms. Result :sat
Minimization took 103 ms.
[2024-05-23 19:01:43] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-05-23 19:01:43] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-23 19:01:43] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-05-23 19:01:43] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 19:01:43] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 25 ms.
[2024-05-23 19:01:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:01:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-05-23 19:01:44] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-23 19:01:44] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-23 19:01:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 19:01:44] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 18 ms.
[2024-05-23 19:01:44] [INFO ] Added : 14 causal constraints over 4 iterations in 89 ms. Result :sat
Minimization took 109 ms.
[2024-05-23 19:01:44] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-05-23 19:01:44] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 16 ms returned sat
[2024-05-23 19:01:44] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-05-23 19:01:44] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2024-05-23 19:01:44] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 13 ms to minimize.
[2024-05-23 19:01:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:01:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-23 19:01:44] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-23 19:01:44] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-23 19:01:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 19:01:44] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 2 ms to minimize.
[2024-05-23 19:01:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2024-05-23 19:01:44] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 39 ms.
[2024-05-23 19:01:45] [INFO ] Added : 20 causal constraints over 5 iterations in 124 ms. Result :sat
Minimization took 107 ms.
[2024-05-23 19:01:45] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-23 19:01:45] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-23 19:01:45] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2024-05-23 19:01:45] [INFO ] [Real]Added 1 Read/Feed constraints in 36 ms returned sat
[2024-05-23 19:01:45] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 22 ms.
[2024-05-23 19:01:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:01:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-23 19:01:45] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-23 19:01:45] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-23 19:01:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-23 19:01:45] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 20 ms.
[2024-05-23 19:01:45] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:01:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2024-05-23 19:01:45] [INFO ] Added : 31 causal constraints over 7 iterations in 209 ms. Result :sat
Minimization took 107 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA HealthRecord-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Graph (trivial) has 237 edges and 158 vertex of which 10 / 158 are part of one of the 5 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Graph (complete) has 664 edges and 153 vertex of which 123 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Drop transitions (Empty/Sink Transition effects.) removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 0 with 112 rules applied. Total rules applied 114 place count 123 transition count 156
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 192 place count 45 transition count 78
Iterating global reduction 1 with 78 rules applied. Total rules applied 270 place count 45 transition count 78
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 270 place count 45 transition count 74
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 278 place count 41 transition count 74
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 290 place count 29 transition count 58
Iterating global reduction 1 with 12 rules applied. Total rules applied 302 place count 29 transition count 58
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 311 place count 29 transition count 49
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 313 place count 27 transition count 46
Iterating global reduction 2 with 2 rules applied. Total rules applied 315 place count 27 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 316 place count 27 transition count 45
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 317 place count 26 transition count 44
Iterating global reduction 3 with 1 rules applied. Total rules applied 318 place count 26 transition count 44
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 321 place count 26 transition count 41
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 329 place count 22 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 330 place count 22 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 331 place count 21 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 332 place count 20 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 336 place count 20 transition count 31
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 338 place count 19 transition count 30
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 339 place count 18 transition count 29
Iterating global reduction 5 with 1 rules applied. Total rules applied 340 place count 18 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 343 place count 18 transition count 26
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 344 place count 18 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 345 place count 17 transition count 25
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 346 place count 17 transition count 25
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 347 place count 17 transition count 24
Applied a total of 347 rules in 53 ms. Remains 17 /158 variables (removed 141) and now considering 24/306 (removed 282) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 17/158 places, 24/306 transitions.
[2024-05-23 19:01:46] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
// Phase 1: matrix 21 rows 17 cols
[2024-05-23 19:01:46] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
FORMULA HealthRecord-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (70048 resets) in 689 ms. (1449 steps per ms)
FORMULA HealthRecord-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (24060 resets) in 301 ms. (3311 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 4926 ms.
ITS solved all properties within timeout
BK_STOP 1716490907219
--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is HealthRecord-PT-10, 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 r179-tall-171640602300773"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-10.tgz
mv HealthRecord-PT-10 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 '
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 ;