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

About the Execution of Smart+red for GPUForwardProgress-PT-20b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
391.531 17047.00 32815.00 551.10 TTTTTTTT?FTTFFFT 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.r203-smll-167840349000079.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 GPUForwardProgress-PT-20b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r203-smll-167840349000079
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.4K Feb 25 14:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 14:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 14:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 14:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 14:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 14:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 14:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 14:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 103K 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 GPUForwardProgress-PT-20b-ReachabilityFireability-00
FORMULA_NAME GPUForwardProgress-PT-20b-ReachabilityFireability-01
FORMULA_NAME GPUForwardProgress-PT-20b-ReachabilityFireability-02
FORMULA_NAME GPUForwardProgress-PT-20b-ReachabilityFireability-03
FORMULA_NAME GPUForwardProgress-PT-20b-ReachabilityFireability-04
FORMULA_NAME GPUForwardProgress-PT-20b-ReachabilityFireability-05
FORMULA_NAME GPUForwardProgress-PT-20b-ReachabilityFireability-06
FORMULA_NAME GPUForwardProgress-PT-20b-ReachabilityFireability-07
FORMULA_NAME GPUForwardProgress-PT-20b-ReachabilityFireability-08
FORMULA_NAME GPUForwardProgress-PT-20b-ReachabilityFireability-09
FORMULA_NAME GPUForwardProgress-PT-20b-ReachabilityFireability-10
FORMULA_NAME GPUForwardProgress-PT-20b-ReachabilityFireability-11
FORMULA_NAME GPUForwardProgress-PT-20b-ReachabilityFireability-12
FORMULA_NAME GPUForwardProgress-PT-20b-ReachabilityFireability-13
FORMULA_NAME GPUForwardProgress-PT-20b-ReachabilityFireability-14
FORMULA_NAME GPUForwardProgress-PT-20b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678528767355

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=GPUForwardProgress-PT-20b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-11 09:59:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 09:59:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 09:59:31] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2023-03-11 09:59:31] [INFO ] Transformed 416 places.
[2023-03-11 09:59:31] [INFO ] Transformed 437 transitions.
[2023-03-11 09:59:31] [INFO ] Found NUPN structural information;
[2023-03-11 09:59:31] [INFO ] Parsed PT model containing 416 places and 437 transitions and 1077 arcs in 284 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 57 resets, run finished after 856 ms. (steps per millisecond=11 ) properties (out of 16) seen :9
FORMULA GPUForwardProgress-PT-20b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-20b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-20b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-20b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-20b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-20b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-20b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-20b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-20b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 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 7 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 437 rows 416 cols
[2023-03-11 09:59:32] [INFO ] Computed 22 place invariants in 26 ms
[2023-03-11 09:59:33] [INFO ] After 563ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 09:59:33] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 26 ms returned sat
[2023-03-11 09:59:34] [INFO ] After 603ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-11 09:59:34] [INFO ] After 1217ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 487 ms.
[2023-03-11 09:59:35] [INFO ] After 2177ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
FORMULA GPUForwardProgress-PT-20b-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 6 different solutions.
FORMULA GPUForwardProgress-PT-20b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-20b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-20b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-20b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-20b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 65 ms.
Support contains 19 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 437/437 transitions.
Graph (trivial) has 336 edges and 416 vertex of which 7 / 416 are part of one of the 1 SCC in 18 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 620 edges and 410 vertex of which 385 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.3 ms
Discarding 25 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 203 rules applied. Total rules applied 205 place count 385 transition count 223
Reduce places removed 202 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 228 rules applied. Total rules applied 433 place count 183 transition count 197
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 445 place count 172 transition count 196
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 445 place count 172 transition count 160
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 517 place count 136 transition count 160
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 542 place count 111 transition count 135
Iterating global reduction 3 with 25 rules applied. Total rules applied 567 place count 111 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 569 place count 111 transition count 133
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 569 place count 111 transition count 131
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 573 place count 109 transition count 131
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 671 place count 60 transition count 82
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 680 place count 51 transition count 64
Iterating global reduction 4 with 9 rules applied. Total rules applied 689 place count 51 transition count 64
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 693 place count 49 transition count 64
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 694 place count 49 transition count 63
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 696 place count 49 transition count 63
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 697 place count 48 transition count 62
Applied a total of 697 rules in 154 ms. Remains 48 /416 variables (removed 368) and now considering 62/437 (removed 375) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 48/416 places, 62/437 transitions.
Incomplete random walk after 10000 steps, including 415 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 135 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3122254 steps, run timeout after 3001 ms. (steps per millisecond=1040 ) properties seen :{}
Probabilistic random walk after 3122254 steps, saw 475394 distinct states, run finished after 3003 ms. (steps per millisecond=1039 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 09:59:38] [INFO ] Flow matrix only has 60 transitions (discarded 2 similar events)
// Phase 1: matrix 60 rows 48 cols
[2023-03-11 09:59:38] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-11 09:59:38] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 09:59:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 09:59:38] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 09:59:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 09:59:38] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 09:59:38] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-11 09:59:38] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 19 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 62/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 48/48 places, 62/62 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 62/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-11 09:59:38] [INFO ] Flow matrix only has 60 transitions (discarded 2 similar events)
[2023-03-11 09:59:38] [INFO ] Invariant cache hit.
[2023-03-11 09:59:38] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-11 09:59:38] [INFO ] Flow matrix only has 60 transitions (discarded 2 similar events)
[2023-03-11 09:59:38] [INFO ] Invariant cache hit.
[2023-03-11 09:59:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 09:59:39] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-11 09:59:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 09:59:39] [INFO ] Flow matrix only has 60 transitions (discarded 2 similar events)
[2023-03-11 09:59:39] [INFO ] Invariant cache hit.
[2023-03-11 09:59:39] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 48/48 places, 62/62 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 48 transition count 60
Applied a total of 2 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 60/62 (removed 2) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 48 cols
[2023-03-11 09:59:39] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 09:59:39] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 09:59:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 09:59:39] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 09:59:39] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-11 09:59:39] [INFO ] After 103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-11 09:59:39] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-11 09:59:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 48 places, 62 transitions and 222 arcs took 1 ms.
[2023-03-11 09:59:39] [INFO ] Flatten gal took : 45 ms
Total runtime 8681 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running GPUForwardProgress (PT), instance 20b
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: 48 places, 62 transitions, 222 arcs.
Final Score: 318.676
Took : 3 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678528784402

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 340:
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="GPUForwardProgress-PT-20b"
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 GPUForwardProgress-PT-20b, 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 r203-smll-167840349000079"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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