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.r325-tall-167889197600765.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 itstools
Input is ResAllocation-PT-R050C002, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r325-tall-167889197600765
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 6.6K Feb 25 15:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 15:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 15:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 15:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 15:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Feb 25 15:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 15:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 15:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 212K Mar 5 18:23 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 ResAllocation-PT-R050C002-UpperBounds-00
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-01
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-02
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-03
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-04
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-05
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-06
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-07
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-08
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-09
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-10
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-11
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-12
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-13
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-14
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679034790997

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R050C002
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-17 06:33:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-17 06:33:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 06:33:12] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2023-03-17 06:33:12] [INFO ] Transformed 200 places.
[2023-03-17 06:33:12] [INFO ] Transformed 102 transitions.
[2023-03-17 06:33:12] [INFO ] Parsed PT model containing 200 places and 102 transitions and 500 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 102 rows 200 cols
[2023-03-17 06:33:12] [INFO ] Computed 100 place invariants in 18 ms
FORMULA ResAllocation-PT-R050C002-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 15 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :3
FORMULA ResAllocation-PT-R050C002-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :1
FORMULA ResAllocation-PT-R050C002-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-17 06:33:13] [INFO ] Invariant cache hit.
[2023-03-17 06:33:13] [INFO ] [Real]Absence check using 100 positive place invariants in 22 ms returned sat
[2023-03-17 06:33:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 06:33:13] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-17 06:33:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 06:33:13] [INFO ] [Nat]Absence check using 100 positive place invariants in 24 ms returned sat
[2023-03-17 06:33:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 06:33:13] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2023-03-17 06:33:13] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 3 ms to minimize.
[2023-03-17 06:33:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-17 06:33:13] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-17 06:33:13] [INFO ] Added : 94 causal constraints over 19 iterations in 213 ms. Result :sat
Minimization took 24 ms.
[2023-03-17 06:33:13] [INFO ] [Real]Absence check using 100 positive place invariants in 21 ms returned sat
[2023-03-17 06:33:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 06:33:13] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-17 06:33:13] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2023-03-17 06:33:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-03-17 06:33:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 06:33:14] [INFO ] [Nat]Absence check using 100 positive place invariants in 12 ms returned sat
[2023-03-17 06:33:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 06:33:14] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-17 06:33:14] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-17 06:33:14] [INFO ] Added : 47 causal constraints over 10 iterations in 90 ms. Result :sat
Minimization took 18 ms.
[2023-03-17 06:33:14] [INFO ] [Real]Absence check using 100 positive place invariants in 15 ms returned sat
[2023-03-17 06:33:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 06:33:14] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-17 06:33:14] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-17 06:33:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-17 06:33:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 06:33:14] [INFO ] [Nat]Absence check using 100 positive place invariants in 12 ms returned sat
[2023-03-17 06:33:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 06:33:14] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-17 06:33:14] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-17 06:33:14] [INFO ] Added : 47 causal constraints over 10 iterations in 91 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA ResAllocation-PT-R050C002-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ResAllocation-PT-R050C002-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ResAllocation-PT-R050C002-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 1950 ms.

BK_STOP 1679034796266

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ResAllocation-PT-R050C002"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ResAllocation-PT-R050C002, 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 r325-tall-167889197600765"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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