fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r043-tajo-167813696800439
Last Updated
May 14, 2023

About the Execution of Smart+red for BugTracking-PT-q8m128

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
843.512 127695.00 171466.00 222.80 FTF?FTFTFTFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r043-tajo-167813696800439.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is BugTracking-PT-q8m128, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813696800439
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.3K Feb 26 06:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 06:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 06:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 06:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 07:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 07:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 07:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 26 07:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q8m128-ReachabilityFireability-00
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityFireability-01
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityFireability-02
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityFireability-03
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityFireability-04
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityFireability-05
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityFireability-06
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityFireability-07
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityFireability-08
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityFireability-09
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityFireability-10
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityFireability-11
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityFireability-12
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityFireability-13
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityFireability-14
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678789260600

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=BugTracking-PT-q8m128
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 10:21:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 10:21:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 10:21:05] [INFO ] Load time of PNML (sax parser for PT used): 1162 ms
[2023-03-14 10:21:05] [INFO ] Transformed 754 places.
[2023-03-14 10:21:05] [INFO ] Transformed 27370 transitions.
[2023-03-14 10:21:05] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1439 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 86 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 474 places in 129 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m128-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10012 steps, including 5 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 92431 steps, run timeout after 3009 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92431 steps, saw 43897 distinct states, run finished after 3023 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-14 10:21:09] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2023-03-14 10:21:09] [INFO ] Computed 10 place invariants in 100 ms
[2023-03-14 10:21:10] [INFO ] [Real]Absence check using 10 positive place invariants in 34 ms returned sat
[2023-03-14 10:21:12] [INFO ] After 2477ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-14 10:21:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-14 10:21:13] [INFO ] After 1248ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-14 10:21:13] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-14 10:21:14] [INFO ] After 416ms SMT Verify possible using 303 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-14 10:21:15] [INFO ] Deduced a trap composed of 34 places in 970 ms of which 12 ms to minimize.
[2023-03-14 10:21:16] [INFO ] Deduced a trap composed of 12 places in 970 ms of which 2 ms to minimize.
[2023-03-14 10:21:17] [INFO ] Deduced a trap composed of 85 places in 923 ms of which 2 ms to minimize.
[2023-03-14 10:21:18] [INFO ] Deduced a trap composed of 23 places in 671 ms of which 3 ms to minimize.
[2023-03-14 10:21:19] [INFO ] Deduced a trap composed of 14 places in 769 ms of which 2 ms to minimize.
[2023-03-14 10:21:19] [INFO ] Deduced a trap composed of 52 places in 566 ms of which 1 ms to minimize.
[2023-03-14 10:21:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 5697 ms
[2023-03-14 10:21:20] [INFO ] After 6265ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 146 ms.
[2023-03-14 10:21:20] [INFO ] After 7779ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA BugTracking-PT-q8m128-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.31 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 19 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 807 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 811 ms. Remains : 269/280 places, 3871/3904 transitions.
Incomplete random walk after 10026 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1253 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 116169 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 116169 steps, saw 45505 distinct states, run finished after 3002 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 10:21:24] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:21:24] [INFO ] Computed 8 place invariants in 24 ms
[2023-03-14 10:21:24] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2023-03-14 10:21:25] [INFO ] After 1016ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 10:21:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-14 10:21:26] [INFO ] After 1200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 10:21:26] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:21:26] [INFO ] After 315ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 10:21:27] [INFO ] Deduced a trap composed of 35 places in 691 ms of which 14 ms to minimize.
[2023-03-14 10:21:28] [INFO ] Deduced a trap composed of 8 places in 655 ms of which 1 ms to minimize.
[2023-03-14 10:21:28] [INFO ] Deduced a trap composed of 23 places in 342 ms of which 1 ms to minimize.
[2023-03-14 10:21:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2047 ms
[2023-03-14 10:21:29] [INFO ] After 2486ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 166 ms.
[2023-03-14 10:21:29] [INFO ] After 3987ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 132 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 181 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-14 10:21:29] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:21:29] [INFO ] Invariant cache hit.
[2023-03-14 10:21:30] [INFO ] Implicit Places using invariants in 1065 ms returned []
[2023-03-14 10:21:30] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:21:30] [INFO ] Invariant cache hit.
[2023-03-14 10:21:31] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:21:33] [INFO ] Implicit Places using invariants and state equation in 2890 ms returned []
Implicit Place search using SMT with State Equation took 3959 ms to find 0 implicit places.
[2023-03-14 10:21:33] [INFO ] Redundant transitions in 428 ms returned []
[2023-03-14 10:21:33] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:21:33] [INFO ] Invariant cache hit.
[2023-03-14 10:21:35] [INFO ] Dead Transitions using invariants and state equation in 2025 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6632 ms. Remains : 269/269 places, 3871/3871 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 177 place count 267 transition count 3696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 267 transition count 3695
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 267 transition count 3691
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 381 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3691 rows 263 cols
[2023-03-14 10:21:36] [INFO ] Computed 9 place invariants in 15 ms
[2023-03-14 10:21:36] [INFO ] [Real]Absence check using 9 positive place invariants in 79 ms returned sat
[2023-03-14 10:21:39] [INFO ] After 2960ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 10:21:39] [INFO ] After 3196ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 10:21:39] [INFO ] After 3475ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 10:21:39] [INFO ] [Nat]Absence check using 9 positive place invariants in 12 ms returned sat
[2023-03-14 10:21:41] [INFO ] After 1142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 10:21:41] [INFO ] After 1316ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-14 10:21:41] [INFO ] After 1522ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-14 10:21:41] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-14 10:21:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 269 places, 3871 transitions and 19045 arcs took 39 ms.
[2023-03-14 10:21:42] [INFO ] Flatten gal took : 590 ms
Total runtime 38504 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BugTracking (PT), instance q8m128
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: 269 places, 3871 transitions, 19045 arcs.
Final Score: 55254.055
Took : 84 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678789388295

--------------------
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 23201:
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="BugTracking-PT-q8m128"
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 BugTracking-PT-q8m128, 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 r043-tajo-167813696800439"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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