fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r178-tajo-158987881800046
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for DLCshifumi-PT-4b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15741.320 3600000.00 73964.00 129.80 FFTTFFFTFFFFFTFT 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/mcc2020-input.r178-tajo-158987881800046.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DLCshifumi-PT-4b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987881800046
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.3M
-rw-r--r-- 1 mcc users 4.1K Mar 30 23:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 30 23:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 29 12:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 29 12:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 08:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 28 08:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 27 02:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 27 02:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 5.1M Mar 24 05:37 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 DLCshifumi-PT-4b-ReachabilityCardinality-00
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-01
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-02
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-03
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-04
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-05
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-06
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-07
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-08
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-09
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-10
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-11
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-12
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-13
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-14
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591199306607

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 15:48:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 15:48:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 15:48:30] [INFO ] Load time of PNML (sax parser for PT used): 768 ms
[2020-06-03 15:48:30] [INFO ] Transformed 15015 places.
[2020-06-03 15:48:30] [INFO ] Transformed 21341 transitions.
[2020-06-03 15:48:30] [INFO ] Found NUPN structural information;
[2020-06-03 15:48:30] [INFO ] Parsed PT model containing 15015 places and 21341 transitions in 1417 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 866 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 313 ms. (steps per millisecond=31 ) properties seen :[1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1]
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 21341 rows 15015 cols
[2020-06-03 15:48:33] [INFO ] Computed 691 place invariants in 972 ms
[2020-06-03 15:48:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 15:48:38] [INFO ] [Real]Absence check using 691 positive place invariants in 3051 ms returned (error "Failed to check-sat")
[2020-06-03 15:48:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 0
[2020-06-03 15:48:43] [INFO ] [Real]Absence check using 691 positive place invariants in 2159 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 15:48:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 1
[2020-06-03 15:48:48] [INFO ] [Real]Absence check using 691 positive place invariants in 3296 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 15:48:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 2
[2020-06-03 15:48:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 15:48:53] [INFO ] [Real]Absence check using 691 positive place invariants in 2928 ms returned (error "Failed to check-sat")
[2020-06-03 15:48:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 3
[2020-06-03 15:48:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 15:48:58] [INFO ] [Real]Absence check using 691 positive place invariants in 3050 ms returned (error "Failed to check-sat")
[2020-06-03 15:48:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 4
[2020-06-03 15:49:03] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 15:49:03] [INFO ] [Real]Absence check using 691 positive place invariants in 2760 ms returned (error "Failed to check-sat")
[2020-06-03 15:49:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe") while checking expression at index 5
[2020-06-03 15:49:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (= 1 (+ s0 s8284 s8285 s8286 s8287 s8288 s8289 s8290 s8291 s8292 s8293 s8294 s8295 s8296 s8297 s8298 s8299 s8300 s8301 s8302 s8303 s8304 s8305 s8306 s8307 s8308 s8309 s8310 s8311 s8312 s8313 s8314 s8315 s8316 s8317 s8318 s8319 s8320 s8321 s8322 s8323 s8324 s8325 s8326 s8327 s8328 s8329 s8330 s8331 s14535 s14536 s14537 s14538 s14539 s14540 s14541 s14542 s14543 s14544))") while checking expression at index 6
Support contains 23 out of 15015 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15015/15015 places, 21341/21341 transitions.
Graph (trivial) has 14144 edges and 15015 vertex of which 1395 / 15015 are part of one of the 91 SCC in 78 ms
Free SCC test removed 1304 places
Drop transitions removed 1476 transitions
Reduce isomorphic transitions removed 1476 transitions.
Performed 7296 Post agglomeration using F-continuation condition.Transition count delta: 7296
Iterating post reduction 0 with 8772 rules applied. Total rules applied 8773 place count 13711 transition count 12569
Reduce places removed 7296 places and 0 transitions.
Ensure Unique test removed 235 transitions
Reduce isomorphic transitions removed 235 transitions.
Performed 231 Post agglomeration using F-continuation condition.Transition count delta: 231
Iterating post reduction 1 with 7762 rules applied. Total rules applied 16535 place count 6415 transition count 12103
Reduce places removed 231 places and 0 transitions.
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Iterating post reduction 2 with 379 rules applied. Total rules applied 16914 place count 6184 transition count 11955
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 3 with 73 rules applied. Total rules applied 16987 place count 6111 transition count 11955
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 87 Pre rules applied. Total rules applied 16987 place count 6111 transition count 11868
Deduced a syphon composed of 87 places in 234 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 17161 place count 6024 transition count 11868
Symmetric choice reduction at 4 with 1703 rule applications. Total rules 18864 place count 6024 transition count 11868
Deduced a syphon composed of 1703 places in 295 ms
Reduce places removed 1703 places and 1703 transitions.
Iterating global reduction 4 with 3406 rules applied. Total rules applied 22270 place count 4321 transition count 10165
Performed 687 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 687 Pre rules applied. Total rules applied 22270 place count 4321 transition count 9478
Deduced a syphon composed of 687 places in 155 ms
Reduce places removed 687 places and 0 transitions.
Iterating global reduction 4 with 1374 rules applied. Total rules applied 23644 place count 3634 transition count 9478
Symmetric choice reduction at 4 with 172 rule applications. Total rules 23816 place count 3634 transition count 9478
Deduced a syphon composed of 172 places in 164 ms
Reduce places removed 172 places and 2464 transitions.
Iterating global reduction 4 with 344 rules applied. Total rules applied 24160 place count 3462 transition count 7014
Ensure Unique test removed 153 transitions
Reduce isomorphic transitions removed 153 transitions.
Iterating post reduction 4 with 153 rules applied. Total rules applied 24313 place count 3462 transition count 6861
Performed 869 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 869 places in 2 ms
Reduce places removed 869 places and 0 transitions.
Iterating global reduction 5 with 1738 rules applied. Total rules applied 26051 place count 2593 transition count 5988
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 26054 place count 2593 transition count 5985
Renaming transitions due to excessive name length > 1024 char.
Symmetric choice reduction at 6 with 2 rule applications. Total rules 26056 place count 2593 transition count 5985
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 156 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 26060 place count 2591 transition count 5829
Performed 101 Post agglomeration using F-continuation condition with reduction of 128 identical transitions.
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 6 with 202 rules applied. Total rules applied 26262 place count 2490 transition count 6168
Performed 101 Post agglomeration using F-continuation condition with reduction of 124 identical transitions.
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 6 with 202 rules applied. Total rules applied 26464 place count 2389 transition count 6508
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 26465 place count 2389 transition count 6507
Performed 28 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 26521 place count 2361 transition count 6621
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 26531 place count 2361 transition count 6611
Free-agglomeration rule applied 1448 times with reduction of 900 identical transitions.
Iterating global reduction 8 with 1448 rules applied. Total rules applied 27979 place count 2361 transition count 4263
Reduce places removed 1448 places and 0 transitions.
Drop transitions removed 1790 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 1798 transitions.
Discarding 425 places :
Also discarding 687 output transitions
Drop transitions removed 687 transitions
Graph (complete) has 3190 edges and 913 vertex of which 488 are kept as prefixes of interest. Removing 425 places using SCC suffix rule.14 ms
Iterating post reduction 8 with 3247 rules applied. Total rules applied 31226 place count 488 transition count 1778
Drop transitions removed 525 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 540 transitions.
Iterating post reduction 9 with 540 rules applied. Total rules applied 31766 place count 488 transition count 1238
Symmetric choice reduction at 10 with 10 rule applications. Total rules 31776 place count 488 transition count 1238
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 40 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 31796 place count 478 transition count 1198
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 10 with 36 rules applied. Total rules applied 31832 place count 478 transition count 1162
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 11 with 8 rules applied. Total rules applied 31840 place count 478 transition count 1770
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 624 transitions
Reduce isomorphic transitions removed 624 transitions.
Iterating post reduction 11 with 632 rules applied. Total rules applied 32472 place count 470 transition count 1146
Symmetric choice reduction at 12 with 4 rule applications. Total rules 32476 place count 470 transition count 1146
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 32484 place count 466 transition count 1142
Ensure Unique test removed 234 transitions
Reduce isomorphic transitions removed 234 transitions.
Iterating post reduction 12 with 234 rules applied. Total rules applied 32718 place count 466 transition count 908
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 32726 place count 462 transition count 904
Drop transitions removed 312 transitions
Reduce isomorphic transitions removed 312 transitions.
Discarding 61 places :
Also discarding 0 output transitions
Graph (complete) has 1040 edges and 462 vertex of which 401 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.1 ms
Iterating post reduction 13 with 313 rules applied. Total rules applied 33039 place count 401 transition count 592
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 33040 place count 401 transition count 592
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 14 with 7 rules applied. Total rules applied 33047 place count 401 transition count 585
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 33049 place count 399 transition count 585
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 33050 place count 399 transition count 584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 33051 place count 398 transition count 584
Applied a total of 33051 rules in 5902 ms. Remains 398 /15015 variables (removed 14617) and now considering 584/21341 (removed 20757) transitions.
Finished structural reductions, in 1 iterations. Remains : 398/15015 places, 584/21341 transitions.
Finished random walk after 346 steps, including 0 resets, run visited all 7 properties in 4 ms. (steps per millisecond=86 )
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

--------------------
content from stderr:

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="DLCshifumi-PT-4b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itslola"
echo " Input is DLCshifumi-PT-4b, 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 r178-tajo-158987881800046"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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