About the Execution of LTSMin+red for Sudoku-COL-AN14
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2836.140 | 125613.00 | 167598.00 | 483.00 | TFFTFF??FFT?TTFF | normal |
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.r536-tall-171690532500518.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 Sudoku-COL-AN14, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532500518
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.3K Apr 12 12:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 12:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 10:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 10:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 13:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 13:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 12:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 12 12:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 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 Sudoku-COL-AN14-ReachabilityCardinality-2024-00
FORMULA_NAME Sudoku-COL-AN14-ReachabilityCardinality-2024-01
FORMULA_NAME Sudoku-COL-AN14-ReachabilityCardinality-2024-02
FORMULA_NAME Sudoku-COL-AN14-ReachabilityCardinality-2024-03
FORMULA_NAME Sudoku-COL-AN14-ReachabilityCardinality-2024-04
FORMULA_NAME Sudoku-COL-AN14-ReachabilityCardinality-2024-05
FORMULA_NAME Sudoku-COL-AN14-ReachabilityCardinality-2024-06
FORMULA_NAME Sudoku-COL-AN14-ReachabilityCardinality-2024-07
FORMULA_NAME Sudoku-COL-AN14-ReachabilityCardinality-2024-08
FORMULA_NAME Sudoku-COL-AN14-ReachabilityCardinality-2024-09
FORMULA_NAME Sudoku-COL-AN14-ReachabilityCardinality-2024-10
FORMULA_NAME Sudoku-COL-AN14-ReachabilityCardinality-2024-11
FORMULA_NAME Sudoku-COL-AN14-ReachabilityCardinality-2024-12
FORMULA_NAME Sudoku-COL-AN14-ReachabilityCardinality-2024-13
FORMULA_NAME Sudoku-COL-AN14-ReachabilityCardinality-2024-14
FORMULA_NAME Sudoku-COL-AN14-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717264005088
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:46:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 17:46:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:46:46] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 17:46:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 17:46:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 558 ms
[2024-06-01 17:46:46] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 3332 PT places and 2744.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 38 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
FORMULA Sudoku-COL-AN14-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN14-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN14-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 17:46:46] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2024-06-01 17:46:46] [INFO ] Skeletonized 13 HLPN properties in 2 ms.
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
RANDOM walk for 40388 steps (200 resets) in 97 ms. (412 steps per ms) remains 5/13 properties
BEST_FIRST walk for 40388 steps (200 resets) in 81 ms. (492 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40388 steps (200 resets) in 56 ms. (708 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40388 steps (200 resets) in 35 ms. (1121 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40388 steps (200 resets) in 71 ms. (560 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40388 steps (200 resets) in 66 ms. (602 steps per ms) remains 5/5 properties
// Phase 1: matrix 1 rows 4 cols
[2024-06-01 17:46:47] [INFO ] Computed 3 invariants in 8 ms
Problem Sudoku-COL-AN14-ReachabilityCardinality-2024-02 is UNSAT
Problem Sudoku-COL-AN14-ReachabilityCardinality-2024-03 is UNSAT
Problem Sudoku-COL-AN14-ReachabilityCardinality-2024-12 is UNSAT
Problem Sudoku-COL-AN14-ReachabilityCardinality-2024-14 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 4/7 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 0/5 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5/5 variables, and 7 constraints, problems are : Problem set: 4 solved, 1 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/5 variables, 4/7 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5 variables, 1/8 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/5 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5/5 variables, and 8 constraints, problems are : Problem set: 4 solved, 1 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 397ms problems are : Problem set: 4 solved, 1 unsolved
Finished Parikh walk after 83 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=83 )
Parikh walk visited 1 properties in 6 ms.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-06-01 17:46:47] [INFO ] Flatten gal took : 17 ms
[2024-06-01 17:46:47] [INFO ] Flatten gal took : 13 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
FORMULA Sudoku-COL-AN14-ReachabilityCardinality-2024-02 FALSE TECHNIQUES CPN_APPROX
FORMULA Sudoku-COL-AN14-ReachabilityCardinality-2024-03 TRUE TECHNIQUES CPN_APPROX
FORMULA Sudoku-COL-AN14-ReachabilityCardinality-2024-12 TRUE TECHNIQUES CPN_APPROX
FORMULA Sudoku-COL-AN14-ReachabilityCardinality-2024-14 FALSE TECHNIQUES CPN_APPROX
Domain [N(14), N(14)] of place Rows breaks symmetries in sort N
[2024-06-01 17:46:47] [INFO ] Unfolded HLPN to a Petri net with 3332 places and 2744 transitions 10976 arcs in 67 ms.
[2024-06-01 17:46:47] [INFO ] Unfolded 13 HLPN properties in 20 ms.
RANDOM walk for 40000 steps (229 resets) in 10317 ms. (3 steps per ms) remains 3/9 properties
FORMULA Sudoku-COL-AN14-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN14-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN14-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN14-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN14-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN14-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 653 ms. (61 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6894 ms. (5 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 598 ms. (66 steps per ms) remains 3/3 properties
// Phase 1: matrix 2744 rows 3332 cols
[2024-06-01 17:46:52] [INFO ] Computed 588 invariants in 40 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3332 variables, 588/588 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3332 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6076/6076 variables, and 3920 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5031 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 3332/3332 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3332/6076 variables, and 588 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3426 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 9272ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3332 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 65 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 3332/3332 places, 2744/2744 transitions.
RANDOM walk for 40000 steps (229 resets) in 8062 ms. (4 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 518 ms. (77 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6138 ms. (6 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 546 ms. (73 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 236850 steps, run timeout after 9023 ms. (steps per millisecond=26 ) properties seen :0 out of 3
Probabilistic random walk after 236850 steps, saw 236714 distinct states, run finished after 9029 ms. (steps per millisecond=26 ) properties seen :0
[2024-06-01 17:47:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3332 variables, 588/588 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3332 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2744/6076 variables, 3332/3920 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6076/6076 variables, and 3920 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45034 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 3332/3332 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3332 variables, 588/588 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3332 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2744/6076 variables, 3332/3920 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6076/6076 variables, and 3920 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45035 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 3332/3332 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 90522ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3332 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 38 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 29 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:48:45] [INFO ] Invariant cache hit.
[2024-06-01 17:48:46] [INFO ] Implicit Places using invariants in 657 ms returned []
[2024-06-01 17:48:46] [INFO ] Invariant cache hit.
[2024-06-01 17:48:49] [INFO ] Implicit Places using invariants and state equation in 3424 ms returned []
Implicit Place search using SMT with State Equation took 4104 ms to find 0 implicit places.
[2024-06-01 17:48:49] [INFO ] Redundant transitions in 132 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4279 ms. Remains : 3332/3332 places, 2744/2744 transitions.
[2024-06-01 17:48:50] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2024-06-01 17:48:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3332 places, 2744 transitions and 10976 arcs took 25 ms.
[2024-06-01 17:48:50] [INFO ] Flatten gal took : 277 ms
Total runtime 124211 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
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="Sudoku-COL-AN14"
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 Sudoku-COL-AN14, 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 r536-tall-171690532500518"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN14.tgz
mv Sudoku-COL-AN14 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 ;