Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872800365.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is StigmergyElection-PT-09a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872800365
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 5.7K May 30 15:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 30 15:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 30 15:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 30 15:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 25 13:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 25 13:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 25 13:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 25 13:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 8.4K May 30 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K May 30 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 30 15:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K May 30 15:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 25 13:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 17M May 29 12:20 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-00
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-01
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-02
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-03
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-04
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-05
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-06
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-07
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-08
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-09
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-10
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-11
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-12
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-13
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-14
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654870239856

Running Version 202205111006
[2022-06-10 14:10:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 14:10:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 14:10:44] [INFO ] Load time of PNML (sax parser for PT used): 1895 ms
[2022-06-10 14:10:44] [INFO ] Transformed 128 places.
[2022-06-10 14:10:44] [INFO ] Transformed 18490 transitions.
[2022-06-10 14:10:44] [INFO ] Found NUPN structural information;
[2022-06-10 14:10:44] [INFO ] Parsed PT model containing 128 places and 18490 transitions in 2345 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Ensure Unique test removed 17295 transitions
Reduce redundant transitions removed 17295 transitions.
Normalized transition count is 1168 out of 1195 initially.
// Phase 1: matrix 1168 rows 128 cols
[2022-06-10 14:10:45] [INFO ] Computed 10 place invariants in 72 ms
Incomplete random walk after 10000 steps, including 4 resets, run finished after 841 ms. (steps per millisecond=11 ) properties (out of 16) seen :14
FORMULA StigmergyElection-PT-09a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-09a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
[2022-06-10 14:10:46] [INFO ] Flow matrix only has 1168 transitions (discarded 27 similar events)
// Phase 1: matrix 1168 rows 128 cols
[2022-06-10 14:10:46] [INFO ] Computed 10 place invariants in 12 ms
[2022-06-10 14:10:46] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2022-06-10 14:10:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 14:10:46] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2022-06-10 14:10:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 14:10:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2022-06-10 14:10:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 14:10:47] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2022-06-10 14:10:47] [INFO ] State equation strengthened by 1066 read => feed constraints.
[2022-06-10 14:10:48] [INFO ] [Nat]Added 1066 Read/Feed constraints in 394 ms returned sat
[2022-06-10 14:10:49] [INFO ] Deduced a trap composed of 13 places in 893 ms of which 6 ms to minimize.
[2022-06-10 14:10:50] [INFO ] Deduced a trap composed of 13 places in 722 ms of which 2 ms to minimize.
[2022-06-10 14:10:50] [INFO ] Deduced a trap composed of 13 places in 503 ms of which 2 ms to minimize.
[2022-06-10 14:10:51] [INFO ] Deduced a trap composed of 13 places in 494 ms of which 3 ms to minimize.
[2022-06-10 14:10:51] [INFO ] Deduced a trap composed of 12 places in 374 ms of which 1 ms to minimize.
[2022-06-10 14:10:52] [INFO ] Deduced a trap composed of 12 places in 315 ms of which 1 ms to minimize.
[2022-06-10 14:10:52] [INFO ] Deduced a trap composed of 2 places in 558 ms of which 0 ms to minimize.
[2022-06-10 14:10:52] [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 close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-06-10 14:10:52] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-06-10 14:10:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 14:10:53] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2022-06-10 14:10:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 14:10:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-06-10 14:10:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 14:10:53] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2022-06-10 14:10:53] [INFO ] [Nat]Added 1066 Read/Feed constraints in 403 ms returned sat
[2022-06-10 14:10:54] [INFO ] Deduced a trap composed of 12 places in 728 ms of which 1 ms to minimize.
[2022-06-10 14:10:55] [INFO ] Deduced a trap composed of 12 places in 504 ms of which 1 ms to minimize.
[2022-06-10 14:10:55] [INFO ] Deduced a trap composed of 12 places in 408 ms of which 1 ms to minimize.
[2022-06-10 14:10:56] [INFO ] Deduced a trap composed of 14 places in 381 ms of which 1 ms to minimize.
[2022-06-10 14:10:56] [INFO ] Deduced a trap composed of 12 places in 288 ms of which 1 ms to minimize.
[2022-06-10 14:10:56] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 2 ms to minimize.
[2022-06-10 14:10:57] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 0 ms to minimize.
[2022-06-10 14:10:57] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 1 ms to minimize.
[2022-06-10 14:10:57] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 1 ms to minimize.
[2022-06-10 14:10:57] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3893 ms
[2022-06-10 14:10:58] [INFO ] Computed and/alt/rep : 117/135/117 causal constraints (skipped 1050 transitions) in 443 ms.
[2022-06-10 14:10:58] [INFO ] Added : 0 causal constraints over 0 iterations in 446 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
FORMULA StigmergyElection-PT-09a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 128 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 128/128 places, 1194/1194 transitions.
Graph (complete) has 424 edges and 128 vertex of which 120 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.47 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 120 transition count 1141
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 102 transition count 1114
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 100 place count 93 transition count 1114
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 100 place count 93 transition count 1097
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 134 place count 76 transition count 1097
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 152 place count 58 transition count 1079
Iterating global reduction 3 with 18 rules applied. Total rules applied 170 place count 58 transition count 1079
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 188 place count 40 transition count 1061
Iterating global reduction 3 with 18 rules applied. Total rules applied 206 place count 40 transition count 1061
Ensure Unique test removed 519 transitions
Reduce isomorphic transitions removed 519 transitions.
Iterating post reduction 3 with 519 rules applied. Total rules applied 725 place count 40 transition count 542
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 743 place count 31 transition count 533
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 752 place count 22 transition count 524
Iterating global reduction 4 with 9 rules applied. Total rules applied 761 place count 22 transition count 524
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 762 place count 22 transition count 523
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 763 place count 22 transition count 523
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 764 place count 21 transition count 522
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 765 place count 20 transition count 522
Performed 9 Post agglomeration using F-continuation condition with reduction of 501 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 791 place count 3 transition count 12
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 2 edges and 3 vertex of which 2 / 3 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Iterating post reduction 5 with 10 rules applied. Total rules applied 801 place count 2 transition count 3
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 803 place count 2 transition count 1
Applied a total of 803 rules in 583 ms. Remains 2 /128 variables (removed 126) and now considering 1/1194 (removed 1193) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/128 places, 1/1194 transitions.
// Phase 1: matrix 1 rows 2 cols
[2022-06-10 14:10:58] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 500000 resets, run finished after 449 ms. (steps per millisecond=2227 ) properties (out of 1) seen :1
FORMULA StigmergyElection-PT-09a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 17091 ms.

BK_STOP 1654870259529

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="StigmergyElection-PT-09a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-09a, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r294-smll-165463872800365"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-09a.tgz
mv StigmergyElection-PT-09a execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;