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.r246-tall-171654352000614.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 NoC3x3-PT-4B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654352000614
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 07:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 12 07:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 07:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 07:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 608K 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 NoC3x3-PT-4B-ReachabilityCardinality-2024-00
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-2024-01
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-2024-02
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-2024-03
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-2024-04
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-2024-05
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-2024-06
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-2024-07
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-2024-08
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-2024-09
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-2024-10
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-2024-11
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-2024-12
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-2024-13
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-2024-14
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716700079125

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-4B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-26 05:08:00] [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-26 05:08:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 05:08:00] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2024-05-26 05:08:00] [INFO ] Transformed 2328 places.
[2024-05-26 05:08:00] [INFO ] Transformed 2701 transitions.
[2024-05-26 05:08:00] [INFO ] Found NUPN structural information;
[2024-05-26 05:08:00] [INFO ] Parsed PT model containing 2328 places and 2701 transitions and 6091 arcs in 281 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (20 resets) in 1375 ms. (29 steps per ms) remains 3/13 properties
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 380 ms. (104 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 422 ms. (94 steps per ms) remains 3/3 properties
// Phase 1: matrix 2701 rows 2328 cols
[2024-05-26 05:08:01] [INFO ] Computed 66 invariants in 59 ms
[2024-05-26 05:08:01] [INFO ] Flatten gal took : 454 ms
[2024-05-26 05:08:01] [INFO ] Flatten gal took : 138 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 05:08:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13971888943694829060.gal : 59 ms
[2024-05-26 05:08:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4010855430222860268.prop : 2 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/ReachabilityCardinality13971888943694829060.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4010855430222860268.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 ...329
At refinement iteration 2 (OVERLAPS) 980/1003 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 980/1023 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Loading property file /tmp/ReachabilityCardinality4010855430222860268.prop.
At refinement iteration 5 (OVERLAPS) 1325/2328 variables, 46/1069 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2328 variables, 1325/2394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2328 variables, 0/2394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2701/5029 variables, 2328/4722 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5029 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/5029 variables, 0/4722 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5029/5029 variables, and 4722 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1840 ms.
Refiners :[Domain max(s): 2328/2328 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 2328/2328 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 980/1003 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 980/1023 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1325/2328 variables, 46/1069 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2328 variables, 1325/2394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 05:08:04] [INFO ] Deduced a trap composed of 75 places in 283 ms of which 38 ms to minimize.
[2024-05-26 05:08:04] [INFO ] Deduced a trap composed of 75 places in 321 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2328 variables, 2/2396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2328 variables, 0/2396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :7 after 13
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :13 after 14
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :14 after 258
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :258 after 742
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :742 after 1011
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1011 after 1810
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1810 after 197821
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :197821 after 242292
At refinement iteration 9 (OVERLAPS) 2701/5029 variables, 2328/4724 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5029 variables, 3/4727 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :242292 after 465474
At refinement iteration 11 (INCLUDED_ONLY) 0/5029 variables, 0/4727 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 05:08:06] [INFO ] Deduced a trap composed of 108 places in 213 ms of which 4 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/5029 variables, 1/4728 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5029 variables, 0/4728 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/5029 variables, 0/4728 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5029/5029 variables, and 4728 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4157 ms.
Refiners :[Domain max(s): 2328/2328 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 2328/2328 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 6159ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES PARIKH_WALK
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 465 ms.
Support contains 2 out of 2328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2328/2328 places, 2701/2701 transitions.
Graph (trivial) has 2322 edges and 2328 vertex of which 1399 / 2328 are part of one of the 33 SCC in 9 ms
Free SCC test removed 1366 places
Drop transitions (Empty/Sink Transition effects.) removed 1653 transitions
Reduce isomorphic transitions removed 1653 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 962 transition count 1015
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 929 transition count 1015
Discarding 325 places :
Symmetric choice reduction at 2 with 325 rule applications. Total rules 392 place count 604 transition count 690
Iterating global reduction 2 with 325 rules applied. Total rules applied 717 place count 604 transition count 690
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 717 place count 604 transition count 622
Deduced a syphon composed of 68 places in 4 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 853 place count 536 transition count 622
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 908 place count 481 transition count 534
Iterating global reduction 2 with 55 rules applied. Total rules applied 963 place count 481 transition count 534
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 1161 place count 382 transition count 435
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1163 place count 381 transition count 449
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1165 place count 381 transition count 447
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 1171 place count 381 transition count 441
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1173 place count 380 transition count 452
Free-agglomeration rule applied 200 times.
Iterating global reduction 3 with 200 rules applied. Total rules applied 1373 place count 380 transition count 252
Reduce places removed 200 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (complete) has 491 edges and 180 vertex of which 26 are kept as prefixes of interest. Removing 154 places using SCC suffix rule.1 ms
Discarding 154 places :
Also discarding 142 output transitions
Drop transitions (Output transitions of discarded places.) removed 142 transitions
Iterating post reduction 3 with 237 rules applied. Total rules applied 1610 place count 26 transition count 74
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 4 with 51 rules applied. Total rules applied 1661 place count 26 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1662 place count 25 transition count 22
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 17 edges and 16 vertex of which 12 / 16 are part of one of the 2 SCC in 0 ms
Free SCC test removed 10 places
Iterating post reduction 5 with 10 rules applied. Total rules applied 1672 place count 6 transition count 22
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 1689 place count 6 transition count 5
Applied a total of 1689 rules in 319 ms. Remains 6 /2328 variables (removed 2322) and now considering 5/2701 (removed 2696) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 329 ms. Remains : 6/2328 places, 5/2701 transitions.
RANDOM walk for 14 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 8246 ms.

BK_STOP 1716700088606

--------------------
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="NoC3x3-PT-4B"
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 NoC3x3-PT-4B, 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 r246-tall-171654352000614"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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