Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r504-tall-171649612700398.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is LeafsetExtension-PT-S64C3, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612700398
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 15K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 13:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 12 13:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 13:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 13:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 14M May 18 16:42 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 LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-00
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-01
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-02
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-03
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-04
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-05
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-06
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-07
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-08
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-09
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-10
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-11
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-12
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-13
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-14
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717229086166

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:04:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 08:04:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:04:48] [INFO ] Load time of PNML (sax parser for PT used): 733 ms
[2024-06-01 08:04:48] [INFO ] Transformed 21462 places.
[2024-06-01 08:04:48] [INFO ] Transformed 21129 transitions.
[2024-06-01 08:04:48] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 951 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 55 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1549 resets) in 3613 ms. (11 steps per ms) remains 11/16 properties
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (57 resets) in 266 ms. (149 steps per ms) remains 10/11 properties
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (55 resets) in 215 ms. (185 steps per ms) remains 9/10 properties
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (55 resets) in 306 ms. (130 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (56 resets) in 822 ms. (48 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (56 resets) in 237 ms. (168 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (55 resets) in 149 ms. (266 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (56 resets) in 146 ms. (272 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (54 resets) in 196 ms. (203 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (53 resets) in 471 ms. (84 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (57 resets) in 365 ms. (109 steps per ms) remains 9/9 properties
// Phase 1: matrix 21129 rows 21462 cols
[2024-06-01 08:04:53] [INFO ] Computed 333 invariants in 2605 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-05 is UNSAT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 20023/20170 variables, 128/129 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20170/42591 variables, and 129 constraints, problems are : Problem set: 1 solved, 8 unsolved in 5108 ms.
Refiners :[Positive P Invariants (semi-flows): 1/67 constraints, Generalized P Invariants (flows): 128/266 constraints, State Equation: 0/21462 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-03 is UNSAT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-10 is UNSAT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-13 is UNSAT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 20024/20170 variables, 128/129 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-06-01 08:06:31] [INFO ] Deduced a trap composed of 456 places in 87664 ms of which 913 ms to minimize.
SMT process timed out in 100576ms, After SMT, problems are : Problem set: 4 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 17 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 890 are kept as prefixes of interest. Removing 20572 places using SCC suffix rule.33 ms
Discarding 20572 places :
Also discarding 11990 output transitions
Drop transitions (Output transitions of discarded places.) removed 11990 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4234 transitions
Reduce isomorphic transitions removed 4234 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 313 transitions
Trivial Post-agglo rules discarded 313 transitions
Performed 313 trivial Post agglomeration. Transition count delta: 313
Iterating post reduction 0 with 4547 rules applied. Total rules applied 4548 place count 890 transition count 4592
Reduce places removed 315 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 324 rules applied. Total rules applied 4872 place count 575 transition count 4583
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 4881 place count 566 transition count 4583
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 4881 place count 566 transition count 4572
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 4903 place count 555 transition count 4572
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 4911 place count 555 transition count 4564
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 4919 place count 547 transition count 4564
Partial Free-agglomeration rule applied 248 times.
Drop transitions (Partial Free agglomeration) removed 248 transitions
Iterating global reduction 4 with 248 rules applied. Total rules applied 5167 place count 547 transition count 4564
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 4 with 8 rules applied. Total rules applied 5175 place count 539 transition count 4564
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 5177 place count 539 transition count 4562
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 5179 place count 537 transition count 4562
Applied a total of 5179 rules in 720 ms. Remains 537 /21462 variables (removed 20925) and now considering 4562/21129 (removed 16567) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 733 ms. Remains : 537/21462 places, 4562/21129 transitions.
RANDOM walk for 40000 steps (5165 resets) in 2121 ms. (18 steps per ms) remains 4/5 properties
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (147 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (149 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (147 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (149 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
[2024-06-01 08:06:32] [INFO ] Flow matrix only has 793 transitions (discarded 3769 similar events)
// Phase 1: matrix 793 rows 537 cols
[2024-06-01 08:06:32] [INFO ] Computed 2 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 278/294 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 725/1019 variables, 330/346 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1019 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-00 is UNSAT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-07 is UNSAT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 311/1330 variables, 191/537 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1330 variables, 2/539 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1330 variables, 0/539 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1330 variables, 0/539 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1330/1330 variables, and 539 constraints, problems are : Problem set: 2 solved, 2 unsolved in 408 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 537/537 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 241/254 variables, 13/13 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 694/948 variables, 296/309 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/948 variables, 1/310 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/948 variables, 0/310 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 382/1330 variables, 228/538 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1330 variables, 2/540 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1330 variables, 1/541 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1330 variables, 0/541 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1330 variables, 0/541 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1330/1330 variables, and 541 constraints, problems are : Problem set: 2 solved, 2 unsolved in 523 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 537/537 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 957ms problems are : Problem set: 2 solved, 2 unsolved
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-12 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 20 ms.
All properties solved without resorting to model-checking.
Total runtime 106557 ms.
ITS solved all properties within timeout

BK_STOP 1717229193980

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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="LeafsetExtension-PT-S64C3"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is LeafsetExtension-PT-S64C3, 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 r504-tall-171649612700398"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S64C3.tgz
mv LeafsetExtension-PT-S64C3 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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;