Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r011-oct2-167813600500669.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is AutonomousCar-PT-09b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813600500669
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 12:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 12:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 12:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 12:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 865K Mar 5 18:22 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 AutonomousCar-PT-09b-UpperBounds-00
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-01
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-02
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-03
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-04
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-05
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-06
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-07
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-08
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-09
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-10
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-11
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-12
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-13
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-14
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678741442097

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-09b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 21:04:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 21:04:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 21:04:04] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2023-03-13 21:04:04] [INFO ] Transformed 391 places.
[2023-03-13 21:04:04] [INFO ] Transformed 1554 transitions.
[2023-03-13 21:04:04] [INFO ] Found NUPN structural information;
[2023-03-13 21:04:04] [INFO ] Parsed PT model containing 391 places and 1554 transitions and 16243 arcs in 235 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 1554 rows 391 cols
[2023-03-13 21:04:04] [INFO ] Computed 14 place invariants in 53 ms
Incomplete random walk after 10000 steps, including 82 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 16) seen :14
FORMULA AutonomousCar-PT-09b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
[2023-03-13 21:04:04] [INFO ] Invariant cache hit.
[2023-03-13 21:04:05] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2023-03-13 21:04:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 21:04:05] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2023-03-13 21:04:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 21:04:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-13 21:04:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 21:04:06] [INFO ] [Nat]Absence check using state equation in 674 ms returned sat
[2023-03-13 21:04:07] [INFO ] Deduced a trap composed of 31 places in 805 ms of which 8 ms to minimize.
[2023-03-13 21:04:08] [INFO ] Deduced a trap composed of 43 places in 662 ms of which 1 ms to minimize.
[2023-03-13 21:04:08] [INFO ] Deduced a trap composed of 43 places in 517 ms of which 6 ms to minimize.
[2023-03-13 21:04:09] [INFO ] Deduced a trap composed of 41 places in 496 ms of which 0 ms to minimize.
[2023-03-13 21:04:09] [INFO ] Deduced a trap composed of 41 places in 434 ms of which 1 ms to minimize.
[2023-03-13 21:04:10] [INFO ] Deduced a trap composed of 26 places in 644 ms of which 0 ms to minimize.
[2023-03-13 21:04:11] [INFO ] Deduced a trap composed of 35 places in 683 ms of which 0 ms to minimize.
[2023-03-13 21:04: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 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2023-03-13 21:04:11] [INFO ] [Real]Absence check using 14 positive place invariants in 63 ms returned sat
[2023-03-13 21:04:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 21:04:12] [INFO ] [Real]Absence check using state equation in 538 ms returned sat
[2023-03-13 21:04:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 21:04:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 26 ms returned sat
[2023-03-13 21:04:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 21:04:12] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2023-03-13 21:04:13] [INFO ] Deduced a trap composed of 15 places in 695 ms of which 14 ms to minimize.
[2023-03-13 21:04:14] [INFO ] Deduced a trap composed of 25 places in 593 ms of which 5 ms to minimize.
[2023-03-13 21:04:14] [INFO ] Deduced a trap composed of 16 places in 504 ms of which 1 ms to minimize.
[2023-03-13 21:04:15] [INFO ] Deduced a trap composed of 24 places in 576 ms of which 1 ms to minimize.
[2023-03-13 21:04:16] [INFO ] Deduced a trap composed of 48 places in 783 ms of which 0 ms to minimize.
[2023-03-13 21:04:16] [INFO ] Deduced a trap composed of 39 places in 532 ms of which 0 ms to minimize.
[2023-03-13 21:04:17] [INFO ] Deduced a trap composed of 29 places in 564 ms of which 1 ms to minimize.
[2023-03-13 21:04:17] [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 1
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 391 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 391/391 places, 1554/1554 transitions.
Graph (trivial) has 372 edges and 391 vertex of which 4 / 391 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1699 edges and 389 vertex of which 382 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.15 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 171 transitions
Trivial Post-agglo rules discarded 171 transitions
Performed 171 trivial Post agglomeration. Transition count delta: 171
Iterating post reduction 0 with 173 rules applied. Total rules applied 175 place count 382 transition count 1372
Reduce places removed 171 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 1 with 223 rules applied. Total rules applied 398 place count 211 transition count 1320
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 31 rules applied. Total rules applied 429 place count 181 transition count 1319
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 430 place count 180 transition count 1319
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 430 place count 180 transition count 1314
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 440 place count 175 transition count 1314
Discarding 34 places :
Symmetric choice reduction at 4 with 34 rule applications. Total rules 474 place count 141 transition count 1280
Iterating global reduction 4 with 34 rules applied. Total rules applied 508 place count 141 transition count 1280
Ensure Unique test removed 325 transitions
Reduce isomorphic transitions removed 325 transitions.
Iterating post reduction 4 with 325 rules applied. Total rules applied 833 place count 141 transition count 955
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 833 place count 141 transition count 953
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 837 place count 139 transition count 953
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 847 place count 129 transition count 871
Iterating global reduction 5 with 10 rules applied. Total rules applied 857 place count 129 transition count 871
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 5 with 18 rules applied. Total rules applied 875 place count 129 transition count 853
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 884 place count 120 transition count 853
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 7 with 86 rules applied. Total rules applied 970 place count 77 transition count 810
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 978 place count 69 transition count 730
Iterating global reduction 7 with 8 rules applied. Total rules applied 986 place count 69 transition count 730
Free-agglomeration rule applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 996 place count 69 transition count 720
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1006 place count 59 transition count 720
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1007 place count 59 transition count 720
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1008 place count 58 transition count 719
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1009 place count 57 transition count 719
Applied a total of 1009 rules in 376 ms. Remains 57 /391 variables (removed 334) and now considering 719/1554 (removed 835) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 376 ms. Remains : 57/391 places, 719/1554 transitions.
// Phase 1: matrix 719 rows 57 cols
[2023-03-13 21:04:17] [INFO ] Computed 13 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 3243 resets, run finished after 7527 ms. (steps per millisecond=132 ) properties (out of 2) seen :2
FORMULA AutonomousCar-PT-09b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 20876 ms.
ITS solved all properties within timeout

BK_STOP 1678741465474

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-09b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is AutonomousCar-PT-09b, 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 r011-oct2-167813600500669"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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