About the Execution of Smart+red for FunctionPointer-PT-a064
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16224.415 | 539065.00 | 556269.00 | 21798.10 | ?TTFTTT?FFTTFT?T | 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.r171-tall-167838858900646.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 FunctionPointer-PT-a064, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r171-tall-167838858900646
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 7.2K Feb 25 11:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 11:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 11:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 11:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 34K Mar 5 18:22 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 FunctionPointer-PT-a064-ReachabilityCardinality-00
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-01
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-02
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-03
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-04
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-05
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-06
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-07
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-08
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-09
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-10
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-11
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-12
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-13
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-14
FORMULA_NAME FunctionPointer-PT-a064-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679491588522
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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-a064
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 13:26:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 13:26:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 13:26:30] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2023-03-22 13:26:30] [INFO ] Transformed 40 places.
[2023-03-22 13:26:30] [INFO ] Transformed 70 transitions.
[2023-03-22 13:26:30] [INFO ] Parsed PT model containing 40 places and 70 transitions and 284 arcs in 94 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 4 transitions.
FORMULA FunctionPointer-PT-a064-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a064-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a064-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a064-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10038 steps, including 22 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 12) seen :3
FORMULA FunctionPointer-PT-a064-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a064-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a064-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :2
FORMULA FunctionPointer-PT-a064-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a064-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-22 13:26:31] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 34 cols
[2023-03-22 13:26:31] [INFO ] Computed 4 place invariants in 8 ms
[2023-03-22 13:26:31] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 13:26:31] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 13:26:31] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:5
[2023-03-22 13:26:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 13:26:31] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 13:26:31] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :3
[2023-03-22 13:26:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 13:26:31] [INFO ] After 20ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :4 sat :3
[2023-03-22 13:26:31] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :3
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-22 13:26:31] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :3
FORMULA FunctionPointer-PT-a064-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-a064-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-a064-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-a064-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 24 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 66/66 transitions.
Graph (complete) has 118 edges and 34 vertex of which 32 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 32 transition count 64
Applied a total of 3 rules in 13 ms. Remains 32 /34 variables (removed 2) and now considering 64/66 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 32/34 places, 64/66 transitions.
Incomplete random walk after 10003 steps, including 21 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 361652 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :{}
Probabilistic random walk after 361652 steps, saw 289996 distinct states, run finished after 3003 ms. (steps per millisecond=120 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-22 13:26:34] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
// Phase 1: matrix 45 rows 32 cols
[2023-03-22 13:26:34] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-22 13:26:34] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 13:26:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 13:26:34] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 13:26:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 13:26:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 13:26:34] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 13:26:34] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 13:26:34] [INFO ] After 16ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 13:26:34] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-22 13:26:34] [INFO ] After 121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 36 ms.
Support contains 24 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 32/32 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-22 13:26:34] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
[2023-03-22 13:26:34] [INFO ] Invariant cache hit.
[2023-03-22 13:26:34] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-22 13:26:34] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
[2023-03-22 13:26:34] [INFO ] Invariant cache hit.
[2023-03-22 13:26:34] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 13:26:34] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-22 13:26:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 13:26:34] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
[2023-03-22 13:26:34] [INFO ] Invariant cache hit.
[2023-03-22 13:26:34] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 32/32 places, 64/64 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 32 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 31 transition count 44
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 31 transition count 43
Applied a total of 22 rules in 6 ms. Remains 31 /32 variables (removed 1) and now considering 43/64 (removed 21) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 43 rows 31 cols
[2023-03-22 13:26:34] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-22 13:26:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 13:26:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 13:26:35] [INFO ] After 25ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-22 13:26:35] [INFO ] After 31ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 13:26:35] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 13:26:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 13:26:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 13:26:35] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 13:26:35] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-22 13:26:35] [INFO ] After 104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-22 13:26:35] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-22 13:26:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32 places, 64 transitions and 258 arcs took 1 ms.
[2023-03-22 13:26:35] [INFO ] Flatten gal took : 25 ms
Total runtime 5116 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running FunctionPointer (PT), instance a064
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart
GOT IT HERE. BS
Petri model created: 32 places, 64 transitions, 258 arcs.
Final Score: 379.739
Took : 1 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: FunctionPointer-PT-a064-ReachabilityCardinality-00 (reachable &!potential( ( ( ( (! ( ( 30 ) <= (tk(P21)) )) | (! ( (tk(P10)) <= ( 12 ) )) ) | ( ( (tk(P32)) <= ( 59 ) ) | (! ( (tk(P19)) <= (tk(P6)) )) ) ) | ( ( ( (tk(P26)) <= ( 33 ) ) | ( ( (tk(P24)) <= (tk(P25)) ) & (! ( (tk(P13)) <= ( 61 ) )) ) ) | ( ( (! ( (tk(P11)) <= (tk(P3)) )) & ( (! ( (tk(P25)) <= ( 14 ) )) | ( (! ( ( 58 ) <= (tk(P19)) )) & (! ( (tk(P15)) <= ( 2 ) )) ) ) ) | ( ( (! ( (tk(P31)) <= ( 23 ) )) & ( (tk(P15)) <= ( 36 ) ) ) | ( ( (tk(P4)) <= (tk(P2)) ) & ( ( ( 49 ) <= (tk(P5)) ) | ( ( ( ( (tk(P1)) <= ( 41 ) ) | ( (tk(P30)) <= ( 48 ) ) ) & ( ( (tk(P20)) <= (tk(P28)) ) | ( (tk(P21)) <= ( 0 ) ) ) ) | ( (! ( (tk(P17)) <= ( 4 ) )) & ( ( (tk(P22)) <= ( 42 ) ) | ( (! ( (tk(P4)) <= ( 53 ) )) & (! ( ( 25 ) <= (tk(P14)) )) ) ) ) ) ) ) ) ) ) )))
PROPERTY: FunctionPointer-PT-a064-ReachabilityCardinality-07 (reachable &!potential( ( ( (tk(P11)) <= ( 33 ) ) | ( (! ( (tk(P19)) <= (tk(P23)) )) | ( ( (tk(P24)) <= ( 15 ) ) & (! ( ( 39 ) <= (tk(P24)) )) ) ) )))
PROPERTY: FunctionPointer-PT-a064-ReachabilityCardinality-14 (reachable &!potential( ( (tk(P32)) <= ( 30 ) )))
BK_STOP 1679492127587
--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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 ReachabilityCardinality -timeout 360 -rebuildPNML
/home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//smart.sh: line 116: 523 Killed ${SMART}/smart ${INPUT_SM}
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="FunctionPointer-PT-a064"
export BK_EXAMINATION="ReachabilityCardinality"
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 FunctionPointer-PT-a064, 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 r171-tall-167838858900646"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-a064.tgz
mv FunctionPointer-PT-a064 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 '
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 ;