fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r170-smll-158987815700302
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for FlexibleBarrier-PT-08b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.440 3600000.00 74596.00 375.60 FFFFTFTFTFFFFFTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r170-smll-158987815700302.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 FlexibleBarrier-PT-08b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815700302
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 3.9K Apr 4 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 4 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 4 06:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 4 06:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 8 14:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 3 21:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 3 21:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 3 13:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 3 13:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 241K 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 FlexibleBarrier-PT-08b-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591348300596

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 09:11:42] [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-05 09:11:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 09:11:43] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2020-06-05 09:11:43] [INFO ] Transformed 920 places.
[2020-06-05 09:11:43] [INFO ] Transformed 1057 transitions.
[2020-06-05 09:11:43] [INFO ] Found NUPN structural information;
[2020-06-05 09:11:43] [INFO ] Parsed PT model containing 920 places and 1057 transitions in 228 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 51 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 159 resets, run finished after 129 ms. (steps per millisecond=77 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0]
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1057 rows 920 cols
[2020-06-05 09:11:43] [INFO ] Computed 10 place invariants in 40 ms
[2020-06-05 09:11:44] [INFO ] [Real]Absence check using 10 positive place invariants in 91 ms returned sat
[2020-06-05 09:11:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:11:46] [INFO ] [Real]Absence check using state equation in 2213 ms returned sat
[2020-06-05 09:11:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 09:11:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 09:11:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 4794 ms returned unknown
[2020-06-05 09:11:51] [INFO ] [Real]Absence check using 10 positive place invariants in 48 ms returned sat
[2020-06-05 09:11:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:11:53] [INFO ] [Real]Absence check using state equation in 2137 ms returned sat
[2020-06-05 09:11:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 09:11:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 09:11:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 4749 ms returned (error "Solver has unexpectedly terminated")
[2020-06-05 09:11:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 09:11: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 1
[2020-06-05 09:11:59] [INFO ] [Real]Absence check using 10 positive place invariants in 45 ms returned sat
[2020-06-05 09:11:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:12:01] [INFO ] [Real]Absence check using state equation in 2103 ms returned sat
[2020-06-05 09:12:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 09:12:06] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 09:12:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 4842 ms returned unknown
[2020-06-05 09:12:06] [INFO ] [Real]Absence check using 10 positive place invariants in 48 ms returned sat
[2020-06-05 09:12:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:12:08] [INFO ] [Real]Absence check using state equation in 2069 ms returned sat
[2020-06-05 09:12:09] [INFO ] Deduced a trap composed of 339 places in 946 ms
[2020-06-05 09:12:10] [INFO ] Deduced a trap composed of 317 places in 616 ms
[2020-06-05 09:12:11] [INFO ] Deduced a trap composed of 330 places in 639 ms
[2020-06-05 09:12:11] [INFO ] Deduced a trap composed of 349 places in 586 ms
[2020-06-05 09:12:11] [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 (> (+ s0 s1 s2 s3 s4 s5 s6 s64 s65 s70 s74 s75 s76 s148 s149 s154 s158 s159 s160 s176 s177 s178 s179 s182 s183 s186 s187 s188 s189 s196 s197 s200 s201 s202 s203 s204 s205 s207 s208 s209 s210 s211 s212 s213 s215 s217 s219 s220 s221 s222 s223 s224 s225 s226 s227 s228 s232 s233 s238 s242 s243 s244 s245 s246 s247 s248 s251 s252 s253 s254 s255 s256 s257 s258 s259 s316 s317 s322 s326 s327 s328 s345 s358 s359 s360 s361 s364 s365 s366 s367 s368 s369 s372 s373 s374 s375 s377 s379 s380 s381 s382 s383 s384 s385 s386 s387 s388 s389 s390 s391 s392 s393 s394 s395 s396 s400 s401 s406 s410 s411 s412 s413 s414 s415 s416 s419 s420 s421 s422 s423 s424 s425 s426 s484 s485 s490 s494 s495 s496 s568 s569 s574 s578 s579 s580 s630 s631 s636 s640 s641 s642 s657 s658 s659 s660 s661 s663 s664 s665 s666 s667 s668 s669 s670 s671 s672 s673 s674 s675 s676 s677 s678 s679 s680 s681 s682 s683 s684 s685 s686 s687 s688 s689 s690 s691 s693 s694 s695 s696 s697 s698 s699 s700 s701 s702 s703 s704 s705 s706 s707 s708 s709 s710 s711 s712 s713 s714 s715 s716 s718 s719 s720 s721 s726 s728 s729 s730 s731 s732 s733 s734 s735 s736 s741 s746 s747 s748 s749 s750 s751 s752 s753 s754 s755 s756 s761 s766 s767 s768 s769 s770 s771 s772 s773 s774 s775 s776 s781 s782 s783 s784 s785 s786 s791 s796 s801 s806 s807 s808 s809 s810 s811 s812 s813 s814 s815 s816 s817 s818 s819 s821 s822 s823 s824 s825 s826 s827 s828 s829 s831 s832 s833 s834 s835 s836 s837 s838 s839 s840 s841 s842 s843 s844 s845 s846 s847 s848 s849 s851 s852 s853 s854 s855 s856 s861 s862 s863 s864 s865 s866 s867 s868 s869 s870 s871 s872 s873 s874 s875 s876 s881 s882 s883 s884 s885 s886 s887 s888 s889 s891 s892 s893 s894 s895 s896 s897 s898 s899 s900 s901 s902 s903 s904 s905 s909 s910 s913 s916 s917) 0)") while checking expression at index 3
[2020-06-05 09:12:11] [INFO ] [Real]Absence check using 10 positive place invariants in 45 ms returned sat
[2020-06-05 09:12:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:12:14] [INFO ] [Real]Absence check using state equation in 2151 ms returned sat
[2020-06-05 09:12:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 09:12:19] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 09:12:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 4835 ms returned unknown
[2020-06-05 09:12:19] [INFO ] [Real]Absence check using 10 positive place invariants in 45 ms returned sat
[2020-06-05 09:12:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:12:21] [INFO ] [Real]Absence check using state equation in 2071 ms returned sat
[2020-06-05 09:12:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 09:12:26] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 09:12:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 4840 ms returned unknown
[2020-06-05 09:12:26] [INFO ] [Real]Absence check using 10 positive place invariants in 67 ms returned sat
[2020-06-05 09:12:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:12:29] [INFO ] [Real]Absence check using state equation in 2835 ms returned sat
[2020-06-05 09:12:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 09:12:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 09:12:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 4837 ms returned (error "Failed to check-sat")
[2020-06-05 09:12:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 09:12:34] [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 6
[2020-06-05 09:12:34] [INFO ] [Real]Absence check using 10 positive place invariants in 44 ms returned sat
[2020-06-05 09:12:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:12:37] [INFO ] [Real]Absence check using state equation in 2415 ms returned sat
[2020-06-05 09:12:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 09:12:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 09:12:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 4837 ms returned unknown
Support contains 27 out of 920 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 920/920 places, 1057/1057 transitions.
Graph (trivial) has 861 edges and 920 vertex of which 50 / 920 are part of one of the 8 SCC in 9 ms
Free SCC test removed 42 places
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Performed 235 Post agglomeration using F-continuation condition.Transition count delta: 235
Iterating post reduction 0 with 286 rules applied. Total rules applied 287 place count 878 transition count 771
Reduce places removed 235 places and 0 transitions.
Iterating post reduction 1 with 235 rules applied. Total rules applied 522 place count 643 transition count 771
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 522 place count 643 transition count 722
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 620 place count 594 transition count 722
Symmetric choice reduction at 2 with 299 rule applications. Total rules 919 place count 594 transition count 722
Deduced a syphon composed of 299 places in 2 ms
Reduce places removed 299 places and 299 transitions.
Iterating global reduction 2 with 598 rules applied. Total rules applied 1517 place count 295 transition count 423
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1517 place count 295 transition count 420
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1523 place count 292 transition count 420
Symmetric choice reduction at 2 with 41 rule applications. Total rules 1564 place count 292 transition count 420
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 41 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 1646 place count 251 transition count 379
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 1683 place count 251 transition count 342
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1775 place count 205 transition count 296
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 1790 place count 205 transition count 281
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1797 place count 205 transition count 281
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 1811 place count 198 transition count 274
Free-agglomeration rule applied 121 times.
Iterating global reduction 4 with 121 rules applied. Total rules applied 1932 place count 198 transition count 153
Reduce places removed 121 places and 0 transitions.
Drop transitions removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 4 with 166 rules applied. Total rules applied 2098 place count 77 transition count 108
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2099 place count 77 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2100 place count 76 transition count 107
Applied a total of 2100 rules in 229 ms. Remains 76 /920 variables (removed 844) and now considering 107/1057 (removed 950) transitions.
Finished structural reductions, in 1 iterations. Remains : 76/920 places, 107/1057 transitions.
Finished random walk after 524 steps, including 9 resets, run visited all 8 properties in 3 ms. (steps per millisecond=174 )
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-00 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="FlexibleBarrier-PT-08b"
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 FlexibleBarrier-PT-08b, 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 r170-smll-158987815700302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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