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-167814482600373.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 DES-PT-01b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482600373
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 5.9K Feb 26 15:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 15:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 15:43 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 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 26 15:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 15:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 68K 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 DES-PT-01b-UpperBounds-00
FORMULA_NAME DES-PT-01b-UpperBounds-01
FORMULA_NAME DES-PT-01b-UpperBounds-02
FORMULA_NAME DES-PT-01b-UpperBounds-03
FORMULA_NAME DES-PT-01b-UpperBounds-04
FORMULA_NAME DES-PT-01b-UpperBounds-05
FORMULA_NAME DES-PT-01b-UpperBounds-06
FORMULA_NAME DES-PT-01b-UpperBounds-07
FORMULA_NAME DES-PT-01b-UpperBounds-08
FORMULA_NAME DES-PT-01b-UpperBounds-09
FORMULA_NAME DES-PT-01b-UpperBounds-10
FORMULA_NAME DES-PT-01b-UpperBounds-11
FORMULA_NAME DES-PT-01b-UpperBounds-12
FORMULA_NAME DES-PT-01b-UpperBounds-13
FORMULA_NAME DES-PT-01b-UpperBounds-14
FORMULA_NAME DES-PT-01b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678378683900

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=DES-PT-01b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 16:18:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 16:18:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 16:18:05] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-09 16:18:05] [INFO ] Transformed 284 places.
[2023-03-09 16:18:05] [INFO ] Transformed 235 transitions.
[2023-03-09 16:18:05] [INFO ] Found NUPN structural information;
[2023-03-09 16:18:05] [INFO ] Parsed PT model containing 284 places and 235 transitions and 683 arcs in 113 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 235 rows 284 cols
[2023-03-09 16:18:05] [INFO ] Computed 65 place invariants in 26 ms
Incomplete random walk after 10000 steps, including 100 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :14
FORMULA DES-PT-01b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
FORMULA DES-PT-01b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-09 16:18:05] [INFO ] Invariant cache hit.
[2023-03-09 16:18:05] [INFO ] [Real]Absence check using 40 positive place invariants in 21 ms returned sat
[2023-03-09 16:18:06] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 7 ms returned sat
[2023-03-09 16:18:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 16:18:06] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2023-03-09 16:18:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 16:18:06] [INFO ] [Nat]Absence check using 40 positive place invariants in 15 ms returned sat
[2023-03-09 16:18:06] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-09 16:18:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 16:18:06] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2023-03-09 16:18:06] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 45 ms to minimize.
[2023-03-09 16:18:06] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2023-03-09 16:18:06] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2023-03-09 16:18:06] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2023-03-09 16:18:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 436 ms
[2023-03-09 16:18:06] [INFO ] Computed and/alt/rep : 233/391/233 causal constraints (skipped 1 transitions) in 18 ms.
[2023-03-09 16:18:07] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 1 ms to minimize.
[2023-03-09 16:18:07] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2023-03-09 16:18:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2023-03-09 16:18:07] [INFO ] Added : 209 causal constraints over 43 iterations in 1198 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 284 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 234/234 transitions.
Graph (complete) has 511 edges and 284 vertex of which 272 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 271 transition count 203
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 50 place count 248 transition count 203
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 50 place count 248 transition count 193
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 70 place count 238 transition count 193
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 88 place count 220 transition count 175
Iterating global reduction 2 with 18 rules applied. Total rules applied 106 place count 220 transition count 175
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 106 place count 220 transition count 174
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 219 transition count 174
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 123 place count 204 transition count 159
Iterating global reduction 2 with 15 rules applied. Total rules applied 138 place count 204 transition count 159
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 153 place count 204 transition count 144
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 156 place count 202 transition count 143
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 156 place count 202 transition count 140
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 162 place count 199 transition count 140
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 310 place count 125 transition count 66
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 316 place count 122 transition count 74
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 317 place count 122 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 318 place count 121 transition count 73
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 320 place count 121 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 321 place count 120 transition count 72
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 323 place count 118 transition count 72
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 324 place count 118 transition count 72
Applied a total of 324 rules in 116 ms. Remains 118 /284 variables (removed 166) and now considering 72/234 (removed 162) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 118/284 places, 72/234 transitions.
// Phase 1: matrix 72 rows 118 cols
[2023-03-09 16:18:08] [INFO ] Computed 58 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 80758 resets, run finished after 1660 ms. (steps per millisecond=602 ) properties (out of 1) seen :1
FORMULA DES-PT-01b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 4553 ms.
ITS solved all properties within timeout

BK_STOP 1678378690902

--------------------
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.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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="DES-PT-01b"
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 DES-PT-01b, 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-167814482600373"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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