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.r233-tall-167856418300045.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 HypertorusGrid-PT-d2k3p2b04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418300045
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.9K Feb 26 11:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 11:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 10:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 11:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 11:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 26 11:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 132K Feb 26 11:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rwxr-xr-x 1 mcc users 79K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679436439976

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=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HypertorusGrid-PT-d2k3p2b04
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 22:07:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-21 22:07:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:07:21] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2023-03-21 22:07:21] [INFO ] Transformed 117 places.
[2023-03-21 22:07:21] [INFO ] Transformed 144 transitions.
[2023-03-21 22:07:21] [INFO ] Parsed PT model containing 117 places and 144 transitions and 576 arcs in 106 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 144 rows 117 cols
[2023-03-21 22:07:21] [INFO ] Computed 46 place invariants in 23 ms
FORMULA HypertorusGrid-PT-d2k3p2b04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypertorusGrid-PT-d2k3p2b04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypertorusGrid-PT-d2k3p2b04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypertorusGrid-PT-d2k3p2b04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypertorusGrid-PT-d2k3p2b04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 11) seen :72
FORMULA HypertorusGrid-PT-d2k3p2b04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HypertorusGrid-PT-d2k3p2b04-UpperBounds-11 12 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HypertorusGrid-PT-d2k3p2b04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :37
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :33
[2023-03-21 22:07:21] [INFO ] Invariant cache hit.
[2023-03-21 22:07:22] [INFO ] [Real]Absence check using 45 positive place invariants in 14 ms returned sat
[2023-03-21 22:07:22] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 22:07:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:07:22] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-21 22:07:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:07:22] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2023-03-21 22:07:22] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-21 22:07:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:07:22] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-21 22:07:22] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-21 22:07:22] [INFO ] Added : 35 causal constraints over 7 iterations in 105 ms. Result :sat
Minimization took 21 ms.
[2023-03-21 22:07:22] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2023-03-21 22:07:22] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 22:07:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:07:22] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-21 22:07:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:07:22] [INFO ] [Nat]Absence check using 45 positive place invariants in 7 ms returned sat
[2023-03-21 22:07:22] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-21 22:07:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:07:22] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-21 22:07:22] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-21 22:07:22] [INFO ] Added : 34 causal constraints over 7 iterations in 86 ms. Result :sat
Minimization took 18 ms.
[2023-03-21 22:07:22] [INFO ] [Real]Absence check using 45 positive place invariants in 13 ms returned sat
[2023-03-21 22:07:22] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 6 ms returned unsat
[2023-03-21 22:07:22] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2023-03-21 22:07:22] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-21 22:07:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:07:22] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-21 22:07:22] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-21 22:07:22] [INFO ] Added : 34 causal constraints over 7 iterations in 86 ms. Result :sat
Minimization took 21 ms.
[2023-03-21 22:07:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:07:23] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2023-03-21 22:07:23] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 22:07:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:07:23] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-21 22:07:23] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-21 22:07:23] [INFO ] Added : 34 causal constraints over 7 iterations in 74 ms. Result :sat
Minimization took 17 ms.
[2023-03-21 22:07:23] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2023-03-21 22:07:23] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-21 22:07:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:07:23] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-21 22:07:23] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-21 22:07:23] [INFO ] Added : 34 causal constraints over 7 iterations in 87 ms. Result :sat
Minimization took 23 ms.
[2023-03-21 22:07:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:07:23] [INFO ] [Nat]Absence check using 45 positive place invariants in 15 ms returned sat
[2023-03-21 22:07:23] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 22:07:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:07:23] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-21 22:07:23] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-21 22:07:23] [INFO ] Added : 34 causal constraints over 7 iterations in 73 ms. Result :sat
Minimization took 17 ms.
[2023-03-21 22:07:23] [INFO ] [Real]Absence check using 45 positive place invariants in 6 ms returned sat
[2023-03-21 22:07:23] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 22:07:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:07:23] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-21 22:07:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:07:23] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2023-03-21 22:07:23] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 22:07:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:07:23] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-21 22:07:23] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-21 22:07:23] [INFO ] Added : 33 causal constraints over 7 iterations in 70 ms. Result :sat
Minimization took 19 ms.
[2023-03-21 22:07:23] [INFO ] [Real]Absence check using 45 positive place invariants in 6 ms returned sat
[2023-03-21 22:07:23] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 22:07:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:07:23] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-21 22:07:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:07:23] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2023-03-21 22:07:23] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 22:07:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:07:24] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-21 22:07:24] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-21 22:07:24] [INFO ] Added : 34 causal constraints over 7 iterations in 80 ms. Result :sat
Minimization took 19 ms.
[2023-03-21 22:07:24] [INFO ] [Real]Absence check using 45 positive place invariants in 6 ms returned sat
[2023-03-21 22:07:24] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 22:07:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:07:24] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-21 22:07:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:07:24] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2023-03-21 22:07:24] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 22:07:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:07:24] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-21 22:07:24] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-21 22:07:24] [INFO ] Added : 35 causal constraints over 7 iterations in 72 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [12, 72, 12, 12, 12, 72, 72, 12] Max seen :[8, 9, 12, 6, 8, 8, 7, 6]
FORMULA HypertorusGrid-PT-d2k3p2b04-UpperBounds-06 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HypertorusGrid-PT-d2k3p2b04-UpperBounds-13 12 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HypertorusGrid-PT-d2k3p2b04-UpperBounds-08 12 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HypertorusGrid-PT-d2k3p2b04-UpperBounds-07 12 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HypertorusGrid-PT-d2k3p2b04-UpperBounds-00 12 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 144/144 transitions.
Applied a total of 0 rules in 23 ms. Remains 117 /117 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 117/117 places, 144/144 transitions.
[2023-03-21 22:07:24] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 27 resets, run finished after 5474 ms. (steps per millisecond=182 ) properties (out of 3) seen :36
Incomplete Best-First random walk after 1000001 steps, including 44 resets, run finished after 1243 ms. (steps per millisecond=804 ) properties (out of 3) seen :19
Incomplete Best-First random walk after 1000001 steps, including 44 resets, run finished after 1217 ms. (steps per millisecond=821 ) properties (out of 3) seen :18
Incomplete Best-First random walk after 1000001 steps, including 45 resets, run finished after 1221 ms. (steps per millisecond=819 ) properties (out of 3) seen :20
[2023-03-21 22:07:34] [INFO ] Invariant cache hit.
[2023-03-21 22:07:34] [INFO ] [Real]Absence check using 45 positive place invariants in 5 ms returned sat
[2023-03-21 22:07:34] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned unsat
[2023-03-21 22:07:34] [INFO ] [Real]Absence check using 45 positive place invariants in 6 ms returned sat
[2023-03-21 22:07:34] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 0 ms returned unsat
[2023-03-21 22:07:34] [INFO ] [Real]Absence check using 45 positive place invariants in 6 ms returned sat
[2023-03-21 22:07:34] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 0 ms returned unsat
Current structural bounds on expressions (after SMT) : [12, 12, 12] Max seen :[12, 12, 12]
FORMULA HypertorusGrid-PT-d2k3p2b04-UpperBounds-12 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HypertorusGrid-PT-d2k3p2b04-UpperBounds-10 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HypertorusGrid-PT-d2k3p2b04-UpperBounds-01 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 12707 ms.
ITS solved all properties within timeout

BK_STOP 1679436455063

--------------------
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 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="HypertorusGrid-PT-d2k3p2b04"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is HypertorusGrid-PT-d2k3p2b04, 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 r233-tall-167856418300045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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