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.r106-tall-167814482400189.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 marciexred
Input is DBSingleClientW-PT-d0m05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482400189
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.5K Feb 26 15:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 15:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 15:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 15:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 15:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Feb 26 15:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 15:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 15:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 119K 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 DBSingleClientW-PT-d0m05-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678349238155

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m05
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 08:07:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 08:07:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:07:19] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-09 08:07:19] [INFO ] Transformed 553 places.
[2023-03-09 08:07:19] [INFO ] Transformed 150 transitions.
[2023-03-09 08:07:19] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 118 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 150 rows 109 cols
[2023-03-09 08:07:19] [INFO ] Computed 6 place invariants in 22 ms
Incomplete random walk after 10000 steps, including 2280 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 10000 steps, including 1024 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 979 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 971 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 10001 steps, including 1011 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :2
[2023-03-09 08:07:20] [INFO ] Invariant cache hit.
[2023-03-09 08:07:20] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:07:20] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-09 08:07:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:07:20] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-09 08:07:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:07:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 08:07:20] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-09 08:07:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:07:20] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-09 08:07:20] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-09 08:07:20] [INFO ] [Nat]Added 74 Read/Feed constraints in 10 ms returned sat
[2023-03-09 08:07:20] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 17 ms.
[2023-03-09 08:07:20] [INFO ] Added : 2 causal constraints over 1 iterations in 39 ms. Result :sat
Minimization took 19 ms.
[2023-03-09 08:07:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 08:07:20] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned unsat
[2023-03-09 08:07:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 08:07:20] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned unsat
[2023-03-09 08:07:20] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 08:07:20] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : [53, 1, 1, 1] Max seen :[1, 1, 1, 1]
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 150/150 transitions.
Graph (complete) has 332 edges and 109 vertex of which 101 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 101 transition count 137
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 38 place count 77 transition count 95
Iterating global reduction 1 with 24 rules applied. Total rules applied 62 place count 77 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 77 transition count 94
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 75 place count 65 transition count 82
Iterating global reduction 2 with 12 rules applied. Total rules applied 87 place count 65 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 65 transition count 80
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 92 place count 62 transition count 74
Iterating global reduction 3 with 3 rules applied. Total rules applied 95 place count 62 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 98 place count 60 transition count 70
Iterating global reduction 4 with 2 rules applied. Total rules applied 100 place count 60 transition count 70
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 102 place count 58 transition count 68
Iterating global reduction 4 with 2 rules applied. Total rules applied 104 place count 58 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 106 place count 58 transition count 66
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 107 place count 57 transition count 65
Iterating global reduction 5 with 1 rules applied. Total rules applied 108 place count 57 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 110 place count 57 transition count 63
Applied a total of 110 rules in 44 ms. Remains 57 /109 variables (removed 52) and now considering 63/150 (removed 87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 57/109 places, 63/150 transitions.
// Phase 1: matrix 63 rows 57 cols
[2023-03-09 08:07:20] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 228963 resets, run finished after 679 ms. (steps per millisecond=1472 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 101105 resets, run finished after 370 ms. (steps per millisecond=2702 ) properties (out of 1) seen :2
[2023-03-09 08:07:21] [INFO ] Invariant cache hit.
[2023-03-09 08:07:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:07:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:07:21] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-09 08:07:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:07:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:07:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:07:21] [INFO ] [Nat]Absence check using state equation in 16 ms returned unsat
Current structural bounds on expressions (after SMT) : [2] Max seen :[2]
FORMULA DBSingleClientW-PT-d0m05-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 2137 ms.
ITS solved all properties within timeout

BK_STOP 1678349242637

--------------------
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="DBSingleClientW-PT-d0m05"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is DBSingleClientW-PT-d0m05, 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 r106-tall-167814482400189"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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