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.r522-tall-171662354200547.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 ltsminxred
Input is ResAllocation-PT-R050C002, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-171662354200547
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 23:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 11 23:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 23:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 23:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 212K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717224811132

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ResAllocation-PT-R050C002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:53:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 06:53:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:53:32] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2024-06-01 06:53:32] [INFO ] Transformed 200 places.
[2024-06-01 06:53:32] [INFO ] Transformed 102 transitions.
[2024-06-01 06:53:32] [INFO ] Found NUPN structural information;
[2024-06-01 06:53:32] [INFO ] Parsed PT model containing 200 places and 102 transitions and 500 arcs in 239 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 200/200 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 197 transition count 100
Applied a total of 5 rules in 35 ms. Remains 197 /200 variables (removed 3) and now considering 100/102 (removed 2) transitions.
// Phase 1: matrix 100 rows 197 cols
[2024-06-01 06:53:32] [INFO ] Computed 99 invariants in 20 ms
[2024-06-01 06:53:33] [INFO ] Implicit Places using invariants in 421 ms returned [100, 102, 104, 106, 108, 110, 112, 114, 116, 118, 120, 122, 124, 126, 128, 130, 132, 134, 136, 138, 140, 142, 144, 146, 148, 150, 152, 154, 156, 158, 160, 162, 164, 166, 168, 170, 172, 174, 176, 178, 180, 182, 184, 186, 188, 190, 192, 194, 196]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 458 ms to find 49 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 148/200 places, 100/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 517 ms. Remains : 148/200 places, 100/102 transitions.
Discarding 2 transitions out of 100. Remains 98
RANDOM walk for 40000 steps (60 resets) in 1682 ms. (23 steps per ms) remains 35/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 35/35 properties
// Phase 1: matrix 100 rows 148 cols
[2024-06-01 06:53:34] [INFO ] Computed 50 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 39/109 variables, 37/107 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 39/146 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 76/185 variables, 109/255 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 10/195 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 6/267 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 10/205 variables, 6/275 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 6/281 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 15 (OVERLAPS) 10/215 variables, 6/289 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/215 variables, 6/295 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/215 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/215 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 19 (OVERLAPS) 10/225 variables, 6/303 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/225 variables, 6/309 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/225 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/225 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 23 (OVERLAPS) 10/235 variables, 6/317 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/235 variables, 6/323 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/235 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/235 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 27 (OVERLAPS) 10/245 variables, 6/331 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/245 variables, 6/337 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/245 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/245 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 31 (OVERLAPS) 3/248 variables, 3/342 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/248 variables, 3/345 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/248 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/248 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 35 (OVERLAPS) 0/248 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 346 constraints, problems are : Problem set: 0 solved, 35 unsolved in 3696 ms.
Refiners :[Domain max(s): 148/148 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 39/109 variables, 37/107 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 39/146 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 76/185 variables, 109/255 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 33/288 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 10/195 variables, 6/294 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 6/300 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/195 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 13 (OVERLAPS) 10/205 variables, 6/310 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 6/316 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/205 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 17 (OVERLAPS) 10/215 variables, 6/324 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/215 variables, 6/330 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/215 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/215 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 21 (OVERLAPS) 10/225 variables, 6/338 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/225 variables, 6/344 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/225 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/225 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 25 (OVERLAPS) 10/235 variables, 6/352 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/235 variables, 6/358 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/235 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/235 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 29 (OVERLAPS) 10/245 variables, 6/366 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/245 variables, 6/372 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/245 variables, 2/374 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/245 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 33 (OVERLAPS) 3/248 variables, 3/377 constraints. Problems are: Problem set: 0 solved, 35 unsolved
SMT process timed out in 8753ms, After SMT, problems are : Problem set: 0 solved, 35 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 70 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 100/100 transitions.
Applied a total of 0 rules in 14 ms. Remains 148 /148 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 148/148 places, 100/100 transitions.
RANDOM walk for 4000000 steps (6026 resets) in 21853 ms. (183 steps per ms) remains 25/35 properties
BEST_FIRST walk for 400003 steps (48 resets) in 860 ms. (464 steps per ms) remains 24/25 properties
BEST_FIRST walk for 400004 steps (45 resets) in 729 ms. (547 steps per ms) remains 23/24 properties
BEST_FIRST walk for 400004 steps (44 resets) in 520 ms. (767 steps per ms) remains 22/23 properties
BEST_FIRST walk for 400003 steps (41 resets) in 510 ms. (782 steps per ms) remains 21/22 properties
BEST_FIRST walk for 400004 steps (40 resets) in 497 ms. (803 steps per ms) remains 20/21 properties
BEST_FIRST walk for 400004 steps (36 resets) in 494 ms. (808 steps per ms) remains 19/20 properties
BEST_FIRST walk for 400004 steps (36 resets) in 487 ms. (819 steps per ms) remains 18/19 properties
BEST_FIRST walk for 400004 steps (32 resets) in 473 ms. (843 steps per ms) remains 17/18 properties
BEST_FIRST walk for 400004 steps (32 resets) in 459 ms. (869 steps per ms) remains 16/17 properties
BEST_FIRST walk for 400004 steps (30 resets) in 453 ms. (881 steps per ms) remains 15/16 properties
BEST_FIRST walk for 400003 steps (28 resets) in 452 ms. (883 steps per ms) remains 14/15 properties
BEST_FIRST walk for 400004 steps (28 resets) in 395 ms. (1010 steps per ms) remains 2/14 properties
BEST_FIRST walk for 400004 steps (26 resets) in 373 ms. (1069 steps per ms) remains 1/2 properties
BEST_FIRST walk for 15784 steps (0 resets) in 24 ms. (631 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 98 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 18872 ms.
ITS solved all properties within timeout

BK_STOP 1717224831274

--------------------
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 QuasiLiveness -timeout 180 -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="ResAllocation-PT-R050C002"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 ltsminxred"
echo " Input is ResAllocation-PT-R050C002, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r522-tall-171662354200547"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R050C002.tgz
mv ResAllocation-PT-R050C002 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;