About the Execution of LTSMin+red for Diffusion2D-PT-D10N150
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r488-tall-171631132200221.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Diffusion2D-PT-D10N150, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132200221
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 14:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 14:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 14:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 11 14:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 255K May 18 16:42 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 Diffusion2D-PT-D10N150-UpperBounds-00
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-01
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-02
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-03
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-04
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-05
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-06
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-07
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-08
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-09
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-10
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-11
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-12
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-13
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-14
FORMULA_NAME Diffusion2D-PT-D10N150-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717187878054
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D10N150
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:37:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 20:37:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:37:59] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-05-31 20:37:59] [INFO ] Transformed 100 places.
[2024-05-31 20:37:59] [INFO ] Transformed 684 transitions.
[2024-05-31 20:37:59] [INFO ] Parsed PT model containing 100 places and 684 transitions and 1368 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 684 rows 100 cols
[2024-05-31 20:37:59] [INFO ] Computed 1 invariants in 30 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150]
RANDOM walk for 10121 steps (2 resets) in 5 ms. (1686 steps per ms)
FORMULA Diffusion2D-PT-D10N150-UpperBounds-12 150 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D10N150-UpperBounds-09 150 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D10N150-UpperBounds-07 150 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D10N150-UpperBounds-04 150 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D10N150-UpperBounds-02 150 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D10N150-UpperBounds-01 150 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D10N150-UpperBounds-00 150 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90009 steps (18 resets) in 65 ms. (1363 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 3, 3, 5, 1, 1, 1, 1, 1] Max Struct:[150, 150, 150, 150, 150, 150, 150, 150, 150]
[2024-05-31 20:37:59] [INFO ] Invariant cache hit.
[2024-05-31 20:37:59] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-31 20:37:59] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2024-05-31 20:38:00] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 63 ms.
[2024-05-31 20:38:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:00] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2024-05-31 20:38:00] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 57 ms.
[2024-05-31 20:38:05] [INFO ] Added : 370 causal constraints over 74 iterations in 4844 ms. Result :unknown
[2024-05-31 20:38:05] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:05] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-05-31 20:38:05] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 54 ms.
[2024-05-31 20:38:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:38:05] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-31 20:38:05] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 56 ms.
[2024-05-31 20:38:10] [INFO ] Added : 395 causal constraints over 79 iterations in 4881 ms. Result :unknown
[2024-05-31 20:38:10] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-31 20:38:10] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-05-31 20:38:10] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 47 ms.
[2024-05-31 20:38:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:10] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-31 20:38:10] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 45 ms.
[2024-05-31 20:38:15] [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 2
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 20:38:15] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:15] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-05-31 20:38:16] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 37 ms.
[2024-05-31 20:38:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:38:16] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-31 20:38:16] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 39 ms.
[2024-05-31 20:38:21] [INFO ] Added : 380 causal constraints over 76 iterations in 4883 ms. Result :unknown
[2024-05-31 20:38:21] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:21] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-05-31 20:38:21] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 40 ms.
[2024-05-31 20:38:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:21] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-05-31 20:38:21] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 39 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2024-05-31 20:38:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:38:26] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-31 20:38:26] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 39 ms.
[2024-05-31 20:38:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:38:26] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-31 20:38:26] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 36 ms.
[2024-05-31 20:38:31] [INFO ] Added : 370 causal constraints over 74 iterations in 4894 ms. Result :unknown
[2024-05-31 20:38:31] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 20:38:31] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-31 20:38:31] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 40 ms.
[2024-05-31 20:38:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:32] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-05-31 20:38:32] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 38 ms.
[2024-05-31 20:38:36] [INFO ] Added : 405 causal constraints over 81 iterations in 4876 ms. Result :unknown
[2024-05-31 20:38:37] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 20:38:37] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-05-31 20:38:37] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 37 ms.
[2024-05-31 20:38:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:37] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-05-31 20:38:37] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 47 ms.
[2024-05-31 20:38:42] [INFO ] Added : 375 causal constraints over 75 iterations in 4876 ms. Result :unknown
[2024-05-31 20:38:42] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:42] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-05-31 20:38:42] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 36 ms.
[2024-05-31 20:38:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:38:42] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-05-31 20:38:42] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 42 ms.
[2024-05-31 20:38:47] [INFO ] Added : 385 causal constraints over 77 iterations in 4877 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1, 3, 3, 5, 1, 1, 1, 1, 1] Max Struct:[150, 150, 150, 150, 150, 150, 150, 150, 150]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[146, 5, 138, 6, 3, 6, 6, 3, 3] Max Struct:[150, 150, 150, 150, 150, 150, 150, 150, 150]
Support contains 9 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 684/684 transitions.
Graph (trivial) has 578 edges and 100 vertex of which 91 / 100 are part of one of the 1 SCC in 4 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 578 transitions
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 662 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 10 transition count 16
Applied a total of 7 rules in 46 ms. Remains 10 /100 variables (removed 90) and now considering 16/684 (removed 668) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 10/100 places, 16/684 transitions.
// Phase 1: matrix 16 rows 10 cols
[2024-05-31 20:38:52] [INFO ] Computed 1 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[146, 5, 138, 6, 3, 6, 6, 3, 3] Max Struct:[150, 150, 150, 150, 150, 150, 150, 150, 150]
RANDOM walk for 1000109 steps (2 resets) in 98 ms. (10102 steps per ms)
FORMULA Diffusion2D-PT-D10N150-UpperBounds-15 150 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D10N150-UpperBounds-14 150 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D10N150-UpperBounds-13 150 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D10N150-UpperBounds-11 150 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D10N150-UpperBounds-10 150 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D10N150-UpperBounds-08 150 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D10N150-UpperBounds-06 150 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D10N150-UpperBounds-05 150 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D10N150-UpperBounds-03 150 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 218 ms. (4566 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 53461 ms.
ITS solved all properties within timeout
BK_STOP 1717187932777
--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="Diffusion2D-PT-D10N150"
export BK_EXAMINATION="UpperBounds"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is Diffusion2D-PT-D10N150, 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 r488-tall-171631132200221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D10N150.tgz
mv Diffusion2D-PT-D10N150 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 '
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 ;