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.r523-tall-167987247800221.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 smartxred
Input is EisenbergMcGuire-PT-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r523-tall-167987247800221
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.7K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Mar 23 15:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Mar 23 15:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 121K Mar 31 16:48 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 EisenbergMcGuire-PT-03-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-03-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-03-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-03-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-03-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-03-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-03-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-03-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-03-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-03-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-03-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-03-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-03-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-03-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-03-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1680811324294

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-03
Applying reductions before tool smart
Invoking reducer
Running Version 202304061127
[2023-04-06 20:02:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-04-06 20:02:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 20:02:06] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-04-06 20:02:06] [INFO ] Transformed 117 places.
[2023-04-06 20:02:06] [INFO ] Transformed 216 transitions.
[2023-04-06 20:02:06] [INFO ] Found NUPN structural information;
[2023-04-06 20:02:06] [INFO ] Parsed PT model containing 117 places and 216 transitions and 900 arcs in 163 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
FORMULA EisenbergMcGuire-PT-03-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 153 out of 216 initially.
// Phase 1: matrix 153 rows 117 cols
[2023-04-06 20:02:06] [INFO ] Computed 10 invariants in 14 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 15) seen :12
FORMULA EisenbergMcGuire-PT-03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-03-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-03-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-03-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-03-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-03-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-03-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-03-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-03-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
[2023-04-06 20:02:06] [INFO ] Flow matrix only has 153 transitions (discarded 63 similar events)
// Phase 1: matrix 153 rows 117 cols
[2023-04-06 20:02:06] [INFO ] Computed 10 invariants in 12 ms
[2023-04-06 20:02:06] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2023-04-06 20:02:06] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 2 ms returned sat
[2023-04-06 20:02:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 20:02:06] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2023-04-06 20:02:06] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 20:02:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-04-06 20:02:06] [INFO ] [Nat]Absence check using 7 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-06 20:02:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 20:02:06] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-04-06 20:02:06] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-06 20:02:06] [INFO ] [Nat]Added 56 Read/Feed constraints in 7 ms returned sat
[2023-04-06 20:02:06] [INFO ] Computed and/alt/rep : 156/398/138 causal constraints (skipped 12 transitions) in 12 ms.
[2023-04-06 20:02:07] [INFO ] Added : 64 causal constraints over 13 iterations in 175 ms. Result :sat
Minimization took 32 ms.
[2023-04-06 20:02:07] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-04-06 20:02:07] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 2 ms returned sat
[2023-04-06 20:02:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 20:02:07] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-04-06 20:02:07] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 20:02:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-04-06 20:02:07] [INFO ] [Nat]Absence check using 7 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-06 20:02:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 20:02:07] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-04-06 20:02:07] [INFO ] [Nat]Added 56 Read/Feed constraints in 6 ms returned sat
[2023-04-06 20:02:07] [INFO ] Deduced a trap composed of 62 places in 44 ms of which 4 ms to minimize.
[2023-04-06 20:02:07] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2023-04-06 20:02:07] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-04-06 20:02:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 141 ms
[2023-04-06 20:02:07] [INFO ] Computed and/alt/rep : 156/398/138 causal constraints (skipped 12 transitions) in 12 ms.
[2023-04-06 20:02:07] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2023-04-06 20:02:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-04-06 20:02:07] [INFO ] Added : 87 causal constraints over 18 iterations in 344 ms. Result :sat
Minimization took 35 ms.
[2023-04-06 20:02:07] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-04-06 20:02:07] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 2 ms returned sat
[2023-04-06 20:02:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 20:02:08] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-04-06 20:02:08] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 20:02:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-04-06 20:02:08] [INFO ] [Nat]Absence check using 7 positive and 3 generalized place invariants in 13 ms returned sat
[2023-04-06 20:02:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 20:02:08] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-04-06 20:02:08] [INFO ] [Nat]Added 56 Read/Feed constraints in 7 ms returned sat
[2023-04-06 20:02:08] [INFO ] Computed and/alt/rep : 156/398/138 causal constraints (skipped 12 transitions) in 25 ms.
[2023-04-06 20:02:08] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2023-04-06 20:02:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-04-06 20:02:08] [INFO ] Added : 79 causal constraints over 17 iterations in 311 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA EisenbergMcGuire-PT-03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-03-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 2486 ms.
ITS solved all properties within timeout

BK_STOP 1680811329547

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="EisenbergMcGuire-PT-03"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is EisenbergMcGuire-PT-03, 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 r523-tall-167987247800221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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