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.r613-tall-171774431600101.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 BlocksWorld-PT-01, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r613-tall-171774431600101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 42K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 240K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 28K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 170K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 93K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 500K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 32K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 192K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.4K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 87K Jun 7 06:26 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 ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1717746923133

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=BlocksWorld-PT-01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202405141337
[2024-06-07 07:55:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-06-07 07:55:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:55:24] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-06-07 07:55:24] [INFO ] Transformed 109 places.
[2024-06-07 07:55:24] [INFO ] Transformed 181 transitions.
[2024-06-07 07:55:24] [INFO ] Found NUPN structural information;
[2024-06-07 07:55:24] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8]
[2024-06-07 07:55:24] [INFO ] Parsed PT model containing 109 places and 181 transitions and 896 arcs in 172 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 3 ms.19323KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 109/109 places, 181/181 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 46 ms. Remains 109 /109 variables (removed 0) and now considering 181/181 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 60 ms. Remains : 109/109 places, 181/181 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 109/109 places, 181/181 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 16 ms. Remains 109 /109 variables (removed 0) and now considering 181/181 (removed 0) transitions.
// Phase 1: matrix 181 rows 109 cols
[2024-06-07 07:55:24] [INFO ] Computed 19 invariants in 8 ms
[2024-06-07 07:55:24] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-06-07 07:55:24] [INFO ] Invariant cache hit.
[2024-06-07 07:55:24] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-07 07:55:25] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2024-06-07 07:55:25] [INFO ] Redundant transitions in 4 ms returned []
Running 179 sub problems to find dead transitions.
[2024-06-07 07:55:25] [INFO ] Invariant cache hit.
[2024-06-07 07:55:25] [INFO ] State equation strengthened by 15 read => feed constraints.
Problem TDEAD28 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD178 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 15/15 constraints. Problems are: Problem set: 14 solved, 165 unsolved
[2024-06-07 07:55:26] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 12 ms to minimize.
[2024-06-07 07:55:26] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 2/17 constraints. Problems are: Problem set: 14 solved, 165 unsolved
[2024-06-07 07:55:26] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/18 constraints. Problems are: Problem set: 14 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/18 constraints. Problems are: Problem set: 14 solved, 165 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD124 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/109 variables, 4/22 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:55:27] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-06-07 07:55:27] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-07 07:55:28] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 3/25 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:55:28] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 1/26 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/26 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 180/289 variables, 109/135 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 14/149 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/149 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 11 (OVERLAPS) 1/290 variables, 1/150 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/150 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 13 (OVERLAPS) 0/290 variables, 0/150 constraints. Problems are: Problem set: 18 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 150 constraints, problems are : Problem set: 18 solved, 161 unsolved in 6454 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 18 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 6/7 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 11/109 variables, 18/25 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/26 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:55:32] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/27 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/27 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 180/289 variables, 109/136 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 14/150 constraints. Problems are: Problem set: 18 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 161/311 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:55:34] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-07 07:55:34] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:55:34] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-07 07:55:34] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:55:34] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 2 ms to minimize.
[2024-06-07 07:55:35] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-07 07:55:35] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:55:35] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:55:35] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:55:35] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:55:35] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:55:35] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:55:35] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 2 ms to minimize.
[2024-06-07 07:55:35] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 7 ms to minimize.
[2024-06-07 07:55:35] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:55:35] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:55:35] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:55:36] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 3 ms to minimize.
[2024-06-07 07:55:36] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:55:36] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 20/331 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:55:37] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:55:37] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 0 ms to minimize.
[2024-06-07 07:55:37] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:55:37] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:55:38] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:55:38] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:55:38] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:55:38] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 8/339 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:55:40] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:55:40] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:55:40] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:55:41] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 4/343 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:55:43] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:55:43] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:55:43] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 3/346 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:55:46] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:55:47] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/289 variables, 2/348 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:55:49] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:55:49] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/289 variables, 2/350 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:55:52] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/289 variables, 1/351 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:55:55] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:55:55] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/289 variables, 2/353 constraints. Problems are: Problem set: 18 solved, 161 unsolved
[2024-06-07 07:55:58] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/289 variables, 1/354 constraints. Problems are: Problem set: 18 solved, 161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/290 variables, and 354 constraints, problems are : Problem set: 18 solved, 161 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, ReadFeed: 14/15 constraints, PredecessorRefiner: 161/179 constraints, Known Traps: 51/51 constraints]
After SMT, in 36999ms problems are : Problem set: 18 solved, 161 unsolved
Search for dead transitions found 18 dead transitions in 37010ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 109/109 places, 163/181 transitions.
Computed a total of 9 stabilizing places and 0 stable transitions
Graph (complete) has 481 edges and 109 vertex of which 100 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 0 output transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 1 rules in 21 ms. Remains 100 /109 variables (removed 9) and now considering 163/163 (removed 0) transitions.
// Phase 1: matrix 163 rows 100 cols
[2024-06-07 07:56:02] [INFO ] Computed 19 invariants in 6 ms
[2024-06-07 07:56:02] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-07 07:56:02] [INFO ] Invariant cache hit.
[2024-06-07 07:56:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:56:02] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 100/109 places, 163/181 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 37766 ms. Remains : 100/109 places, 163/181 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3851 ms (no deadlock found). (steps per millisecond=324 )
Random directed walk for 1250002 steps, including 0 resets, run took 2368 ms (no deadlock found). (steps per millisecond=527 )
[2024-06-07 07:56:08] [INFO ] Invariant cache hit.
[2024-06-07 07:56:08] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-06-07 07:56:08] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-06-07 07:56:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-07 07:56:08] [INFO ] [Nat]Absence check using 19 positive place invariants in 4 ms returned sat
[2024-06-07 07:56:08] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-06-07 07:56:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:56:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-07 07:56:08] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:56:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 62 ms
FORMULA ReachabilityDeadlock FALSE TECHNIQUES TOPOLOGICAL SAT_SMT STRUCTURAL_REDUCTION
Total runtime 44572 ms.

BK_STOP 1717746968894

--------------------
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
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="BlocksWorld-PT-01"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BlocksWorld-PT-01, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r613-tall-171774431600101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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