fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r312-tall-171662337700070
Last Updated
July 7, 2024

About the Execution of ITS-Tools for QuasiCertifProtocol-PT-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
391.168 7313.00 20552.00 52.90 FTFTTTFTFFTTTFFT 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.r312-tall-171662337700070.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 itstools
Input is QuasiCertifProtocol-PT-06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662337700070
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 14K Apr 13 03:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 13 03:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 03:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 13 03:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 13 03:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 13 03:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 03:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 13 03:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 78K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-00
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-01
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-02
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-03
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-04
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-05
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-06
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-07
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-08
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-09
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-10
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-11
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-12
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-13
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-14
FORMULA_NAME QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716664227271

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-25 19:10:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 19:10:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 19:10:28] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-05-25 19:10:28] [INFO ] Transformed 270 places.
[2024-05-25 19:10:28] [INFO ] Transformed 116 transitions.
[2024-05-25 19:10:28] [INFO ] Parsed PT model containing 270 places and 116 transitions and 659 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 19:10:29] [INFO ] Flatten gal took : 101 ms
[2024-05-25 19:10:29] [INFO ] Flatten gal took : 46 ms
[2024-05-25 19:10:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11880295689004346262.gal : 24 ms
[2024-05-25 19:10:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14841480900486001988.prop : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11880295689004346262.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14841480900486001988.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 40000 steps (3931 resets) in 1990 ms. (20 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (88 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
Loading property file /tmp/ReachabilityCardinality14841480900486001988.prop.
BEST_FIRST walk for 4004 steps (59 resets) in 207 ms. (19 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (52 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (72 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (70 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (68 resets) in 81 ms. (48 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :8 after 42
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :42 after 134
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :134 after 236
BEST_FIRST walk for 4004 steps (88 resets) in 213 ms. (18 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :236 after 8320
BEST_FIRST walk for 4003 steps (72 resets) in 213 ms. (18 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (68 resets) in 45 ms. (87 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (71 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (67 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (71 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (67 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (66 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (65 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (66 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 545905 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :3 out of 16
Probabilistic random walk after 545905 steps, saw 90597 distinct states, run finished after 3010 ms. (steps per millisecond=181 ) properties seen :3
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 116 rows 270 cols
[2024-05-25 19:10:32] [INFO ] Computed 155 invariants in 16 ms
Problem QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-01 is UNSAT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-03 is UNSAT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-06 is UNSAT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Problem QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-04 is UNSAT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-05 is UNSAT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 152/154 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/154 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/270 variables, 1/155 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/155 constraints. Problems are: Problem set: 5 solved, 8 unsolved
Reachability property QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-07 is true.
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :8320 after 8576
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :8576 after 9278
Problem QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-02 is UNSAT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-08 is UNSAT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :9278 after 11844
Problem QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-11 is UNSAT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-12 is UNSAT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-13 is UNSAT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-14 is UNSAT
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 116/386 variables, 270/425 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/425 constraints. Problems are: Problem set: 11 solved, 2 unsolved
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :11844 after 16072
At refinement iteration 7 (OVERLAPS) 0/386 variables, 0/425 constraints. Problems are: Problem set: 11 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 425 constraints, problems are : Problem set: 11 solved, 2 unsolved in 631 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 152/152 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/60 variables, 1/1 constraints. Problems are: Problem set: 11 solved, 2 unsolved
Invariant property QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-09 does not hold.
Invariant property QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-00 does not hold.
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :16072 after 34126
[2024-05-25 19:10:33] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 10 ms to minimize.
[2024-05-25 19:10:33] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
SDD proceeding with computation,13 properties remain. new max is 1024
SDD size :34126 after 36036
[2024-05-25 19:10:33] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 3 ms to minimize.
[2024-05-25 19:10:33] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-25 19:10:33] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-25 19:10:33] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 6/7 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2/62 variables, 1/8 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/8 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 79/141 variables, 60/68 constraints. Problems are: Problem set: 11 solved, 2 unsolved
SDD proceeding with computation,13 properties remain. new max is 2048
SDD size :36036 after 41884
[2024-05-25 19:10:34] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-25 19:10:34] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 2/70 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/70 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 93/234 variables, 80/150 constraints. Problems are: Problem set: 11 solved, 2 unsolved
[2024-05-25 19:10:34] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-25 19:10:34] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-25 19:10:34] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-25 19:10:34] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 4/154 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/154 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 107/341 variables, 234/388 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/341 variables, 1/389 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/341 variables, 0/389 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 38/379 variables, 31/420 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/379 variables, 12/432 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/379 variables, 1/433 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/379 variables, 0/433 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 5/384 variables, 1/434 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/384 variables, 2/436 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/384 variables, 0/436 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/386 variables, 3/439 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/386 variables, 0/439 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/386 variables, 0/439 constraints. Problems are: Problem set: 11 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 439 constraints, problems are : Problem set: 11 solved, 2 unsolved in 901 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 152/152 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 2/13 constraints, Known Traps: 12/12 constraints]
After SMT, in 1697ms problems are : Problem set: 11 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 39 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=19 )
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-15 TRUE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-06-ReachabilityCardinality-2024-10 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 7 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 6124 ms.

BK_STOP 1716664234584

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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="QuasiCertifProtocol-PT-06"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-PT-06, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r312-tall-171662337700070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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