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.r267-smll-167863541800429.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 Parking-PT-416, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-167863541800429
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.2K Feb 26 15:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 15:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 14:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 14:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 26 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 107K 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 Parking-PT-416-UpperBounds-00
FORMULA_NAME Parking-PT-416-UpperBounds-01
FORMULA_NAME Parking-PT-416-UpperBounds-02
FORMULA_NAME Parking-PT-416-UpperBounds-03
FORMULA_NAME Parking-PT-416-UpperBounds-04
FORMULA_NAME Parking-PT-416-UpperBounds-05
FORMULA_NAME Parking-PT-416-UpperBounds-06
FORMULA_NAME Parking-PT-416-UpperBounds-07
FORMULA_NAME Parking-PT-416-UpperBounds-08
FORMULA_NAME Parking-PT-416-UpperBounds-09
FORMULA_NAME Parking-PT-416-UpperBounds-10
FORMULA_NAME Parking-PT-416-UpperBounds-11
FORMULA_NAME Parking-PT-416-UpperBounds-12
FORMULA_NAME Parking-PT-416-UpperBounds-13
FORMULA_NAME Parking-PT-416-UpperBounds-14
FORMULA_NAME Parking-PT-416-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678874758100

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=Parking-PT-416
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-15 10:06:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-15 10:06:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 10:06:02] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2023-03-15 10:06:02] [INFO ] Transformed 305 places.
[2023-03-15 10:06:02] [INFO ] Transformed 433 transitions.
[2023-03-15 10:06:02] [INFO ] Found NUPN structural information;
[2023-03-15 10:06:02] [INFO ] Parsed PT model containing 305 places and 433 transitions and 1289 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 176 transitions
Reduce redundant transitions removed 176 transitions.
// Phase 1: matrix 257 rows 305 cols
[2023-03-15 10:06:02] [INFO ] Computed 76 place invariants in 22 ms
Incomplete random walk after 10000 steps, including 127 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 16) seen :13
FORMULA Parking-PT-416-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
[2023-03-15 10:06:02] [INFO ] Invariant cache hit.
[2023-03-15 10:06:02] [INFO ] [Real]Absence check using 72 positive place invariants in 56 ms returned sat
[2023-03-15 10:06:02] [INFO ] [Real]Absence check using 72 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-15 10:06:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:03] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2023-03-15 10:06:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:03] [INFO ] [Nat]Absence check using 72 positive place invariants in 24 ms returned sat
[2023-03-15 10:06:03] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:03] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2023-03-15 10:06:03] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-15 10:06:03] [INFO ] [Nat]Added 60 Read/Feed constraints in 40 ms returned sat
[2023-03-15 10:06:03] [INFO ] Computed and/alt/rep : 256/848/256 causal constraints (skipped 0 transitions) in 40 ms.
[2023-03-15 10:06:04] [INFO ] Added : 163 causal constraints over 33 iterations in 1230 ms. Result :sat
Minimization took 110 ms.
[2023-03-15 10:06:05] [INFO ] [Real]Absence check using 72 positive place invariants in 25 ms returned sat
[2023-03-15 10:06:05] [INFO ] [Real]Absence check using 72 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:05] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2023-03-15 10:06:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:05] [INFO ] [Nat]Absence check using 72 positive place invariants in 33 ms returned sat
[2023-03-15 10:06:05] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-15 10:06:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:05] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2023-03-15 10:06:05] [INFO ] [Nat]Added 60 Read/Feed constraints in 58 ms returned sat
[2023-03-15 10:06:05] [INFO ] Computed and/alt/rep : 256/848/256 causal constraints (skipped 0 transitions) in 46 ms.
[2023-03-15 10:06:07] [INFO ] Added : 159 causal constraints over 32 iterations in 1382 ms. Result :sat
Minimization took 188 ms.
[2023-03-15 10:06:07] [INFO ] [Real]Absence check using 72 positive place invariants in 39 ms returned sat
[2023-03-15 10:06:07] [INFO ] [Real]Absence check using 72 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-15 10:06:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:07] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2023-03-15 10:06:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 10:06:08] [INFO ] [Nat]Absence check using 72 positive place invariants in 40 ms returned sat
[2023-03-15 10:06:08] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-15 10:06:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 10:06:08] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2023-03-15 10:06:08] [INFO ] [Nat]Added 60 Read/Feed constraints in 22 ms returned sat
[2023-03-15 10:06:08] [INFO ] Computed and/alt/rep : 256/848/256 causal constraints (skipped 0 transitions) in 36 ms.
[2023-03-15 10:06:09] [INFO ] Added : 154 causal constraints over 32 iterations in 1288 ms. Result :sat
Minimization took 190 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA Parking-PT-416-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Parking-PT-416-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Parking-PT-416-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 7931 ms.
ITS solved all properties within timeout

BK_STOP 1678874770930

--------------------
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="Parking-PT-416"
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 Parking-PT-416, 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 r267-smll-167863541800429"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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