About the Execution of LTSMin+red for AutoFlight-PT-24b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
7176.008 | 3600000.00 | 14322375.00 | 62.10 | FTFFFFTFTTFFTTFT | normal |
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.r009-oct2-167813598000494.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 ltsminxred
Input is AutoFlight-PT-24b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598000494
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 892K
-rw-r--r-- 1 mcc users 6.1K Feb 25 18:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 18:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 18:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 18:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 18:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 18:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 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 538K 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 booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-00
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-01
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-02
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-03
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-04
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-05
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-06
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-07
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-08
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-09
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-10
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-11
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-12
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-13
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-14
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678632557708
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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-24b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 14:49:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 14:49:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 14:49:20] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2023-03-12 14:49:20] [INFO ] Transformed 2230 places.
[2023-03-12 14:49:20] [INFO ] Transformed 2228 transitions.
[2023-03-12 14:49:20] [INFO ] Found NUPN structural information;
[2023-03-12 14:49:20] [INFO ] Parsed PT model containing 2230 places and 2228 transitions and 5186 arcs in 271 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 9 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 11) seen :6
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2228 rows 2230 cols
[2023-03-12 14:49:21] [INFO ] Computed 148 place invariants in 33 ms
[2023-03-12 14:49:22] [INFO ] After 872ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 14:49:22] [INFO ] [Nat]Absence check using 147 positive place invariants in 94 ms returned sat
[2023-03-12 14:49:22] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-12 14:49:26] [INFO ] After 3011ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-12 14:49:27] [INFO ] Deduced a trap composed of 19 places in 825 ms of which 16 ms to minimize.
[2023-03-12 14:49:28] [INFO ] Deduced a trap composed of 25 places in 914 ms of which 17 ms to minimize.
[2023-03-12 14:49:29] [INFO ] Deduced a trap composed of 35 places in 1214 ms of which 2 ms to minimize.
[2023-03-12 14:49:30] [INFO ] Deduced a trap composed of 28 places in 710 ms of which 1 ms to minimize.
[2023-03-12 14:49:31] [INFO ] Deduced a trap composed of 63 places in 964 ms of which 14 ms to minimize.
[2023-03-12 14:49:32] [INFO ] Deduced a trap composed of 34 places in 883 ms of which 1 ms to minimize.
[2023-03-12 14:49:33] [INFO ] Deduced a trap composed of 38 places in 795 ms of which 27 ms to minimize.
[2023-03-12 14:49:34] [INFO ] Deduced a trap composed of 273 places in 976 ms of which 4 ms to minimize.
[2023-03-12 14:49:35] [INFO ] Deduced a trap composed of 220 places in 616 ms of which 2 ms to minimize.
[2023-03-12 14:49:36] [INFO ] Deduced a trap composed of 266 places in 724 ms of which 2 ms to minimize.
[2023-03-12 14:49:37] [INFO ] Deduced a trap composed of 45 places in 1161 ms of which 2 ms to minimize.
[2023-03-12 14:49:38] [INFO ] Deduced a trap composed of 38 places in 958 ms of which 2 ms to minimize.
[2023-03-12 14:49:39] [INFO ] Deduced a trap composed of 28 places in 790 ms of which 2 ms to minimize.
[2023-03-12 14:49:40] [INFO ] Deduced a trap composed of 100 places in 561 ms of which 1 ms to minimize.
[2023-03-12 14:49:41] [INFO ] Deduced a trap composed of 59 places in 958 ms of which 1 ms to minimize.
[2023-03-12 14:49:41] [INFO ] Deduced a trap composed of 203 places in 618 ms of which 1 ms to minimize.
[2023-03-12 14:49:42] [INFO ] Deduced a trap composed of 76 places in 694 ms of which 2 ms to minimize.
[2023-03-12 14:49:43] [INFO ] Deduced a trap composed of 78 places in 681 ms of which 1 ms to minimize.
[2023-03-12 14:49:44] [INFO ] Deduced a trap composed of 49 places in 733 ms of which 15 ms to minimize.
[2023-03-12 14:49:45] [INFO ] Deduced a trap composed of 48 places in 688 ms of which 1 ms to minimize.
[2023-03-12 14:49:45] [INFO ] Deduced a trap composed of 116 places in 773 ms of which 2 ms to minimize.
[2023-03-12 14:49:46] [INFO ] Deduced a trap composed of 80 places in 777 ms of which 2 ms to minimize.
[2023-03-12 14:49:47] [INFO ] Deduced a trap composed of 68 places in 711 ms of which 2 ms to minimize.
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.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
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-12 14:49:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 14:49:47] [INFO ] After 25323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 177 ms.
Support contains 22 out of 2230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2230/2230 places, 2228/2228 transitions.
Drop transitions removed 866 transitions
Trivial Post-agglo rules discarded 866 transitions
Performed 866 trivial Post agglomeration. Transition count delta: 866
Iterating post reduction 0 with 866 rules applied. Total rules applied 866 place count 2230 transition count 1362
Reduce places removed 866 places and 0 transitions.
Ensure Unique test removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 1 with 1020 rules applied. Total rules applied 1886 place count 1364 transition count 1208
Reduce places removed 41 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 49 rules applied. Total rules applied 1935 place count 1323 transition count 1200
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 1943 place count 1315 transition count 1200
Performed 291 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 291 Pre rules applied. Total rules applied 1943 place count 1315 transition count 909
Deduced a syphon composed of 291 places in 9 ms
Reduce places removed 291 places and 0 transitions.
Iterating global reduction 4 with 582 rules applied. Total rules applied 2525 place count 1024 transition count 909
Discarding 213 places :
Symmetric choice reduction at 4 with 213 rule applications. Total rules 2738 place count 811 transition count 696
Iterating global reduction 4 with 213 rules applied. Total rules applied 2951 place count 811 transition count 696
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 71 Pre rules applied. Total rules applied 2951 place count 811 transition count 625
Deduced a syphon composed of 71 places in 6 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 3093 place count 740 transition count 625
Performed 174 Post agglomeration using F-continuation condition.Transition count delta: 174
Deduced a syphon composed of 174 places in 0 ms
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 4 with 348 rules applied. Total rules applied 3441 place count 566 transition count 451
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 3448 place count 566 transition count 444
Free-agglomeration rule applied 92 times.
Iterating global reduction 4 with 92 rules applied. Total rules applied 3540 place count 566 transition count 352
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 4 with 92 rules applied. Total rules applied 3632 place count 474 transition count 352
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3633 place count 473 transition count 351
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 3646 place count 460 transition count 351
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 13 Pre rules applied. Total rules applied 3646 place count 460 transition count 338
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 3672 place count 447 transition count 338
Applied a total of 3672 rules in 367 ms. Remains 447 /2230 variables (removed 1783) and now considering 338/2228 (removed 1890) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 368 ms. Remains : 447/2230 places, 338/2228 transitions.
Incomplete random walk after 10000 steps, including 118 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :3
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 1278 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=319 )
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 27869 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/544/inv_0_ --invariant=/tmp/544/inv_1_ --invariant=/tmp/544/inv_2_ --invariant=/tmp/544/inv_3_ --invariant=/tmp/544/inv_4_ --invariant=/tmp/544/inv_5_ --invariant=/tmp/544/inv_6_ --invariant=/tmp/544/inv_7_ --invariant=/tmp/544/inv_8_ --invariant=/tmp/544/inv_9_ --invariant=/tmp/544/inv_10_ --invariant=/tmp/544/inv_11_ --invariant=/tmp/544/inv_12_ --invariant=/tmp/544/inv_13_ --invariant=/tmp/544/inv_14_ --invariant=/tmp/544/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 8972836 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16097952 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
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="AutoFlight-PT-24b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is AutoFlight-PT-24b, 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 r009-oct2-167813598000494"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-24b.tgz
mv AutoFlight-PT-24b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;