Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r276-smll-165307353200287.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Vasy2003-PT-none, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-165307353200287
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 6.6K Apr 29 11:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 29 11:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 11:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 29 11:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 09:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 09:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 09:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 29 11:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 29 11:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 29 11:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 29 11:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 09:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 207K May 10 09:34 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 Vasy2003-PT-none-ReachabilityFireability-00
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-01
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-02
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-03
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-04
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-05
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-06
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-07
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-08
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-09
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-10
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-11
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-12
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-13
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-14
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654265808756

Running Version 202205111006
[2022-06-03 14:16:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-03 14:16:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 14:16:51] [INFO ] Load time of PNML (sax parser for PT used): 260 ms
[2022-06-03 14:16:51] [INFO ] Transformed 485 places.
[2022-06-03 14:16:51] [INFO ] Transformed 776 transitions.
[2022-06-03 14:16:51] [INFO ] Found NUPN structural information;
[2022-06-03 14:16:51] [INFO ] Parsed PT model containing 485 places and 776 transitions in 498 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1057 ms. (steps per millisecond=9 ) properties (out of 16) seen :5
FORMULA Vasy2003-PT-none-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2022-06-03 14:16:53] [INFO ] Flow matrix only has 696 transitions (discarded 56 similar events)
// Phase 1: matrix 696 rows 485 cols
[2022-06-03 14:16:53] [INFO ] Computed 66 place invariants in 62 ms
[2022-06-03 14:16:54] [INFO ] [Real]Absence check using 59 positive place invariants in 31 ms returned sat
[2022-06-03 14:16:54] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 11 ms returned sat
[2022-06-03 14:16:55] [INFO ] After 688ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-06-03 14:16:55] [INFO ] [Nat]Absence check using 59 positive place invariants in 37 ms returned sat
[2022-06-03 14:16:55] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 11 ms returned sat
[2022-06-03 14:16:57] [INFO ] After 2254ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2022-06-03 14:16:57] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-06-03 14:17:00] [INFO ] After 2573ms SMT Verify possible using 73 Read/Feed constraints in natural domain returned unsat :2 sat :9
[2022-06-03 14:17:02] [INFO ] After 4951ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 2413 ms.
[2022-06-03 14:17:05] [INFO ] After 10240ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
FORMULA Vasy2003-PT-none-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Vasy2003-PT-none-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 3361 ms.
Support contains 113 out of 485 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 485/485 places, 752/752 transitions.
Graph (trivial) has 100 edges and 485 vertex of which 2 / 485 are part of one of the 1 SCC in 15 ms
Free SCC test removed 1 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1557 edges and 484 vertex of which 482 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 482 transition count 741
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 481 transition count 741
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 7 place count 481 transition count 736
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 17 place count 476 transition count 736
Discarding 113 places :
Symmetric choice reduction at 2 with 113 rule applications. Total rules 130 place count 363 transition count 623
Iterating global reduction 2 with 113 rules applied. Total rules applied 243 place count 363 transition count 623
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 272 place count 363 transition count 594
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 321 place count 314 transition count 531
Iterating global reduction 3 with 49 rules applied. Total rules applied 370 place count 314 transition count 531
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 404 place count 314 transition count 497
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 425 place count 293 transition count 465
Iterating global reduction 4 with 21 rules applied. Total rules applied 446 place count 293 transition count 465
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 456 place count 293 transition count 455
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 464 place count 285 transition count 443
Iterating global reduction 5 with 8 rules applied. Total rules applied 472 place count 285 transition count 443
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 475 place count 285 transition count 440
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 483 place count 281 transition count 436
Graph (complete) has 945 edges and 281 vertex of which 265 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Iterating post reduction 6 with 1 rules applied. Total rules applied 484 place count 265 transition count 432
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 492 place count 265 transition count 424
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 495 place count 262 transition count 420
Iterating global reduction 8 with 3 rules applied. Total rules applied 498 place count 262 transition count 420
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 502 place count 262 transition count 416
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 504 place count 260 transition count 413
Iterating global reduction 9 with 2 rules applied. Total rules applied 506 place count 260 transition count 413
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 509 place count 260 transition count 410
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 510 place count 260 transition count 409
Applied a total of 510 rules in 240 ms. Remains 260 /485 variables (removed 225) and now considering 409/752 (removed 343) transitions.
Finished structural reductions, in 1 iterations. Remains : 260/485 places, 409/752 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 10316 ms. (steps per millisecond=96 ) properties (out of 9) seen :8
FORMULA Vasy2003-PT-none-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2552 ms. (steps per millisecond=391 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-03 14:17:21] [INFO ] Flow matrix only has 377 transitions (discarded 32 similar events)
// Phase 1: matrix 377 rows 260 cols
[2022-06-03 14:17:21] [INFO ] Computed 57 place invariants in 5 ms
[2022-06-03 14:17:21] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 14:17:21] [INFO ] [Nat]Absence check using 50 positive place invariants in 13 ms returned sat
[2022-06-03 14:17:21] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 10 ms returned sat
[2022-06-03 14:17:22] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 14:17:22] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-06-03 14:17:22] [INFO ] After 89ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 14:17:22] [INFO ] After 169ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2022-06-03 14:17:22] [INFO ] After 633ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 102 ms.
Support contains 23 out of 260 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 260/260 places, 409/409 transitions.
Graph (complete) has 879 edges and 260 vertex of which 215 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.5 ms
Discarding 45 places :
Also discarding 33 output transitions
Drop transitions removed 33 transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 215 transition count 364
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 13 place count 215 transition count 361
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 212 transition count 361
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 57 place count 174 transition count 315
Ensure Unique test removed 1 places
Iterating global reduction 1 with 39 rules applied. Total rules applied 96 place count 173 transition count 315
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 113 place count 173 transition count 298
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 131 place count 155 transition count 274
Iterating global reduction 2 with 18 rules applied. Total rules applied 149 place count 155 transition count 274
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 159 place count 155 transition count 264
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 164 place count 150 transition count 254
Iterating global reduction 3 with 5 rules applied. Total rules applied 169 place count 150 transition count 254
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 172 place count 150 transition count 251
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 184 place count 144 transition count 245
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 189 place count 139 transition count 239
Iterating global reduction 4 with 5 rules applied. Total rules applied 194 place count 139 transition count 239
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 206 place count 139 transition count 227
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 209 place count 136 transition count 222
Iterating global reduction 5 with 3 rules applied. Total rules applied 212 place count 136 transition count 222
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 216 place count 136 transition count 218
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 222 place count 136 transition count 212
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 224 place count 136 transition count 210
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 226 place count 134 transition count 210
Applied a total of 226 rules in 95 ms. Remains 134 /260 variables (removed 126) and now considering 210/409 (removed 199) transitions.
Finished structural reductions, in 1 iterations. Remains : 134/260 places, 210/409 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2381 ms. (steps per millisecond=419 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2036 ms. (steps per millisecond=491 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3098582 steps, run visited all 1 properties in 7901 ms. (steps per millisecond=392 )
Probabilistic random walk after 3098582 steps, saw 1922733 distinct states, run finished after 7902 ms. (steps per millisecond=392 ) properties seen :1
FORMULA Vasy2003-PT-none-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 43705 ms.

BK_STOP 1654265855093

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="Vasy2003-PT-none"
export BK_EXAMINATION="ReachabilityFireability"
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-4028"
echo " Executing tool itstools"
echo " Input is Vasy2003-PT-none, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r276-smll-165307353200287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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