fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r524-tall-171679081000757
Last Updated
July 7, 2024

About the Execution of LTSMin+red for SharedMemory-COL-001000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16203.632 366337.00 822611.00 1279.50 1000 1000 ? ? 1000 1 1 ? 1000 1000 ? 1000 1000 ? 1 1000 normal

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.r524-tall-171679081000757.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 SharedMemory-COL-001000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679081000757
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 5.3K Apr 12 14:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 12 14:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 14:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 14:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 14:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 12 14:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 14:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 14:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 55K May 18 16:43 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 SharedMemory-COL-001000-UpperBounds-00
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-01
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-02
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-03
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-04
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-05
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-06
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-07
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-08
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-09
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-10
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-11
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-12
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-13
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-14
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717238537088

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SharedMemory-COL-001000
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:42:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 10:42:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:42:18] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 10:42:18] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 10:42:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 612 ms
[2024-06-01 10:42:19] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 1004001 PT places and 3002000.0 transition bindings in 41 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Reduction of identical properties reduced properties to check from 16 to 6
[2024-06-01 10:42:19] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 16 arcs in 4 ms.
[2024-06-01 10:42:19] [INFO ] Skeletonized 6 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 6 cols
[2024-06-01 10:42:19] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[1000, 0, 1, 0, 1000, 0] Max Struct:[1000, 1000, 1, 1, 1000, 1000]
FORMULA SharedMemory-COL-001000-UpperBounds-09 1000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-001000-UpperBounds-15 1000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-001000-UpperBounds-08 1000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-001000-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-001000-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-001000-UpperBounds-01 1000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-001000-UpperBounds-04 1000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-001000-UpperBounds-11 1000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-001000-UpperBounds-12 1000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-001000-UpperBounds-00 1000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-06-01 10:42:19] [INFO ] Invariant cache hit.
[2024-06-01 10:42:19] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-06-01 10:42:19] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:42:19] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 10:42:19] [INFO ] Added : 0 causal constraints over 0 iterations in 54 ms. Result :sat
Minimization took 11 ms.
[2024-06-01 10:42:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 10:42:19] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 10:42:19] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:42:19] [INFO ] Added : 1 causal constraints over 1 iterations in 28 ms. Result :sat
Minimization took 4 ms.
[2024-06-01 10:42:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 10:42:19] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 10:42:19] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:42:19] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0] Max Struct:[1000, 1, 1000]
Domain [P(1000), P(1000)] of place Ext_Mem_Acc breaks symmetries in sort P
[2024-06-01 10:42:25] [INFO ] Unfolded HLPN to a Petri net with 1004001 places and 2002000 transitions 8004000 arcs in 5610 ms.
[2024-06-01 10:42:25] [INFO ] Unfolded 3 HLPN properties in 44 ms.
Deduced a syphon composed of 1000 places in 729 ms
Reduce places removed 1000 places and 1000 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0] Max Struct:[1000, 1, 1000]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[1000, 1, 1000]
// Phase 1: matrix 2001000 rows 1003001 cols
[2024-06-01 10:44:43] [WARNING] Invariant computation timed out after 120 seconds.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1000, 1, 1000]
RANDOM walk for 948 steps (0 resets) in 30002 ms. (0 steps per ms)
FORMULA SharedMemory-COL-001000-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (4 resets) in 1445 ms. (13 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[397, 270] Max Struct:[1000, 1000]
// Phase 1: matrix 2001000 rows 1003001 cols
[2024-06-01 10:47:17] [WARNING] Invariant computation timed out after 120 seconds.
[2024-06-01 10:47:22] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:826)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
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-06-01 10:47:28] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:826)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
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)
Current structural bounds on expressions (after SMT) : Max Seen:[397, 270] Max Struct:[1000, 1000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[397, 270] Max Struct:[1000, 1000]
Support contains 2000 out of 1003001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003001/1003001 places, 2001000/2001000 transitions.
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : SharedMemory-COL-001000-UpperBounds-00
Could not compute solution for formula : SharedMemory-COL-001000-UpperBounds-01
Could not compute solution for formula : SharedMemory-COL-001000-UpperBounds-02
Could not compute solution for formula : SharedMemory-COL-001000-UpperBounds-03
Could not compute solution for formula : SharedMemory-COL-001000-UpperBounds-04
Could not compute solution for formula : SharedMemory-COL-001000-UpperBounds-05
Could not compute solution for formula : SharedMemory-COL-001000-UpperBounds-06
Could not compute solution for formula : SharedMemory-COL-001000-UpperBounds-07
Could not compute solution for formula : SharedMemory-COL-001000-UpperBounds-08
Could not compute solution for formula : SharedMemory-COL-001000-UpperBounds-09
Could not compute solution for formula : SharedMemory-COL-001000-UpperBounds-10
Could not compute solution for formula : SharedMemory-COL-001000-UpperBounds-11
Could not compute solution for formula : SharedMemory-COL-001000-UpperBounds-12
Could not compute solution for formula : SharedMemory-COL-001000-UpperBounds-13
Could not compute solution for formula : SharedMemory-COL-001000-UpperBounds-14
Could not compute solution for formula : SharedMemory-COL-001000-UpperBounds-15

BK_STOP 1717238903425

--------------------
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
mcc2024
ub formula name SharedMemory-COL-001000-UpperBounds-00
ub formula formula --maxsum=/tmp/518/ub_0_
ub formula name SharedMemory-COL-001000-UpperBounds-01
ub formula formula --maxsum=/tmp/518/ub_1_
ub formula name SharedMemory-COL-001000-UpperBounds-02
ub formula formula --maxsum=/tmp/518/ub_2_
ub formula name SharedMemory-COL-001000-UpperBounds-03
ub formula formula --maxsum=/tmp/518/ub_3_
ub formula name SharedMemory-COL-001000-UpperBounds-04
ub formula formula --maxsum=/tmp/518/ub_4_
ub formula name SharedMemory-COL-001000-UpperBounds-05
ub formula formula --maxsum=/tmp/518/ub_5_
ub formula name SharedMemory-COL-001000-UpperBounds-06
ub formula formula --maxsum=/tmp/518/ub_6_
ub formula name SharedMemory-COL-001000-UpperBounds-07
ub formula formula --maxsum=/tmp/518/ub_7_
ub formula name SharedMemory-COL-001000-UpperBounds-08
ub formula formula --maxsum=/tmp/518/ub_8_
ub formula name SharedMemory-COL-001000-UpperBounds-09
ub formula formula --maxsum=/tmp/518/ub_9_
ub formula name SharedMemory-COL-001000-UpperBounds-10
ub formula formula --maxsum=/tmp/518/ub_10_
ub formula name SharedMemory-COL-001000-UpperBounds-11
ub formula formula --maxsum=/tmp/518/ub_11_
ub formula name SharedMemory-COL-001000-UpperBounds-12
ub formula formula --maxsum=/tmp/518/ub_12_
ub formula name SharedMemory-COL-001000-UpperBounds-13
ub formula formula --maxsum=/tmp/518/ub_13_
ub formula name SharedMemory-COL-001000-UpperBounds-14
ub formula formula --maxsum=/tmp/518/ub_14_
ub formula name SharedMemory-COL-001000-UpperBounds-15
ub formula formula --maxsum=/tmp/518/ub_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="SharedMemory-COL-001000"
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 SharedMemory-COL-001000, 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 r524-tall-171679081000757"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SharedMemory-COL-001000.tgz
mv SharedMemory-COL-001000 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 ;