About the Execution of Smart+red for Szymanski-PT-b06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
638.020 | 232695.00 | 257978.00 | 952.70 | TFT??FT??FF??FFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r491-tall-167912710500471.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is Szymanski-PT-b06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r491-tall-167912710500471
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 6.1K Feb 26 17:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 17:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 16:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 16:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.7M Mar 5 18:23 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 Szymanski-PT-b06-ReachabilityFireability-00
FORMULA_NAME Szymanski-PT-b06-ReachabilityFireability-01
FORMULA_NAME Szymanski-PT-b06-ReachabilityFireability-02
FORMULA_NAME Szymanski-PT-b06-ReachabilityFireability-03
FORMULA_NAME Szymanski-PT-b06-ReachabilityFireability-04
FORMULA_NAME Szymanski-PT-b06-ReachabilityFireability-05
FORMULA_NAME Szymanski-PT-b06-ReachabilityFireability-06
FORMULA_NAME Szymanski-PT-b06-ReachabilityFireability-07
FORMULA_NAME Szymanski-PT-b06-ReachabilityFireability-08
FORMULA_NAME Szymanski-PT-b06-ReachabilityFireability-09
FORMULA_NAME Szymanski-PT-b06-ReachabilityFireability-10
FORMULA_NAME Szymanski-PT-b06-ReachabilityFireability-11
FORMULA_NAME Szymanski-PT-b06-ReachabilityFireability-12
FORMULA_NAME Szymanski-PT-b06-ReachabilityFireability-13
FORMULA_NAME Szymanski-PT-b06-ReachabilityFireability-14
FORMULA_NAME Szymanski-PT-b06-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1679257230259
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b06
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-19 20:20:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 20:20:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 20:20:32] [INFO ] Load time of PNML (sax parser for PT used): 299 ms
[2023-03-19 20:20:32] [INFO ] Transformed 568 places.
[2023-03-19 20:20:32] [INFO ] Transformed 8320 transitions.
[2023-03-19 20:20:32] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 505 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 260 places in 27 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b06-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 13) seen :1
FORMULA Szymanski-PT-b06-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 12) seen :1
FORMULA Szymanski-PT-b06-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :1
FORMULA Szymanski-PT-b06-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :1
FORMULA Szymanski-PT-b06-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-19 20:20:33] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2023-03-19 20:20:33] [INFO ] Computed 3 place invariants in 41 ms
[2023-03-19 20:20:34] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 20:20:34] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 20:20:37] [INFO ] After 3688ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-19 20:20:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 20:20:38] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 20:20:43] [INFO ] After 5435ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :6
[2023-03-19 20:20:43] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:21:02] [INFO ] After 19397ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :3 sat :4
[2023-03-19 20:21:02] [INFO ] After 19399ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-19 20:21:02] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
FORMULA Szymanski-PT-b06-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-b06-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-b06-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 96 ms.
Support contains 50 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 306 transition count 7964
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 305 transition count 7836
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 305 transition count 7836
Applied a total of 103 rules in 502 ms. Remains 305 /308 variables (removed 3) and now considering 7836/8064 (removed 228) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 504 ms. Remains : 305/308 places, 7836/8064 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 147422 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 147422 steps, saw 77648 distinct states, run finished after 3002 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-19 20:21:06] [INFO ] Flow matrix only has 2632 transitions (discarded 5204 similar events)
// Phase 1: matrix 2632 rows 305 cols
[2023-03-19 20:21:07] [INFO ] Computed 1 place invariants in 29 ms
[2023-03-19 20:21:07] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:21:07] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 20:21:07] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:21:15] [INFO ] After 8368ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 20:21:15] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:21:32] [INFO ] After 16496ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 20:21:32] [INFO ] After 16498ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-19 20:21:32] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 91 ms.
Support contains 50 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7836/7836 transitions.
Applied a total of 0 rules in 216 ms. Remains 305 /305 variables (removed 0) and now considering 7836/7836 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 305/305 places, 7836/7836 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7836/7836 transitions.
Applied a total of 0 rules in 295 ms. Remains 305 /305 variables (removed 0) and now considering 7836/7836 (removed 0) transitions.
[2023-03-19 20:21:32] [INFO ] Flow matrix only has 2632 transitions (discarded 5204 similar events)
[2023-03-19 20:21:32] [INFO ] Invariant cache hit.
[2023-03-19 20:21:33] [INFO ] Implicit Places using invariants in 380 ms returned []
[2023-03-19 20:21:33] [INFO ] Flow matrix only has 2632 transitions (discarded 5204 similar events)
[2023-03-19 20:21:33] [INFO ] Invariant cache hit.
[2023-03-19 20:21:33] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:21:38] [INFO ] Implicit Places using invariants and state equation in 5254 ms returned []
Implicit Place search using SMT with State Equation took 5643 ms to find 0 implicit places.
[2023-03-19 20:21:39] [INFO ] Redundant transitions in 884 ms returned []
[2023-03-19 20:21:39] [INFO ] Flow matrix only has 2632 transitions (discarded 5204 similar events)
[2023-03-19 20:21:39] [INFO ] Invariant cache hit.
[2023-03-19 20:21:41] [INFO ] Dead Transitions using invariants and state equation in 2522 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9355 ms. Remains : 305/305 places, 7836/7836 transitions.
Graph (trivial) has 1112 edges and 305 vertex of which 6 / 305 are part of one of the 3 SCC in 6 ms
Free SCC test removed 3 places
Drop transitions removed 576 transitions
Ensure Unique test removed 4634 transitions
Reduce isomorphic transitions removed 5210 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 302 transition count 2623
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 299 transition count 2623
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 298 transition count 2622
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 298 transition count 2620
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 298 transition count 2620
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 298 transition count 2619
Applied a total of 14 rules in 350 ms. Remains 298 /305 variables (removed 7) and now considering 2619/7836 (removed 5217) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 2619 rows 298 cols
[2023-03-19 20:21:42] [INFO ] Computed 1 place invariants in 23 ms
[2023-03-19 20:21:42] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:21:42] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 20:21:42] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:21:47] [INFO ] After 4876ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 20:21:53] [INFO ] After 11181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 12031 ms.
[2023-03-19 20:22:05] [INFO ] After 23326ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-19 20:22:05] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-19 20:22:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 305 places, 7836 transitions and 31416 arcs took 35 ms.
[2023-03-19 20:22:06] [INFO ] Flatten gal took : 454 ms
Total runtime 94380 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Szymanski (PT), instance b06
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart
GOT IT HERE. BS
Petri model created: 305 places, 7836 transitions, 31416 arcs.
Final Score: 92608.132
Took : 134 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
BK_STOP 1679257462954
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 39565:
syntax error
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="Szymanski-PT-b06"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is Szymanski-PT-b06, 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 r491-tall-167912710500471"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b06.tgz
mv Szymanski-PT-b06 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 '
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 ;