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.r121-tall-167814499400253.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 DES-PT-05b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-167814499400253
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.5K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 15:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 15:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K 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 73K 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 booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678393277664

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=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DES-PT-05b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 20:21:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-09 20:21:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 20:21:19] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2023-03-09 20:21:19] [INFO ] Transformed 300 places.
[2023-03-09 20:21:19] [INFO ] Transformed 251 transitions.
[2023-03-09 20:21:19] [INFO ] Found NUPN structural information;
[2023-03-09 20:21:19] [INFO ] Parsed PT model containing 300 places and 251 transitions and 747 arcs in 121 ms.
Structural test allowed to assert that 87 places are NOT stable. Took 7 ms.
Incomplete random walk after 10000 steps, including 82 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 213) seen :203
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 251 rows 300 cols
[2023-03-09 20:21:20] [INFO ] Computed 65 place invariants in 18 ms
[2023-03-09 20:21:20] [INFO ] After 285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-09 20:21:20] [INFO ] [Nat]Absence check using 40 positive place invariants in 13 ms returned sat
[2023-03-09 20:21:20] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 20:21:21] [INFO ] After 292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-09 20:21:21] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 3 ms to minimize.
[2023-03-09 20:21:21] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2023-03-09 20:21:21] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2023-03-09 20:21:21] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2023-03-09 20:21:21] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2023-03-09 20:21:21] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2023-03-09 20:21:21] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2023-03-09 20:21:21] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2023-03-09 20:21:21] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 0 ms to minimize.
[2023-03-09 20:21:21] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2023-03-09 20:21:21] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2023-03-09 20:21:21] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2023-03-09 20:21:21] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 879 ms
[2023-03-09 20:21:22] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 0 ms to minimize.
[2023-03-09 20:21:22] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 0 ms to minimize.
[2023-03-09 20:21:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2023-03-09 20:21:22] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 0 ms to minimize.
[2023-03-09 20:21:22] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2023-03-09 20:21:22] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2023-03-09 20:21:22] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2023-03-09 20:21:22] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2023-03-09 20:21:22] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2023-03-09 20:21:22] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2023-03-09 20:21:22] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2023-03-09 20:21:22] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2023-03-09 20:21:22] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 597 ms
[2023-03-09 20:21:22] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2023-03-09 20:21:23] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2023-03-09 20:21:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 146 ms
[2023-03-09 20:21:23] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2023-03-09 20:21:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-09 20:21:23] [INFO ] After 2401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 165 ms.
[2023-03-09 20:21:23] [INFO ] After 2795ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 3 properties in 8647 ms.
Support contains 7 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 251/251 transitions.
Graph (complete) has 561 edges and 300 vertex of which 294 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 294 transition count 224
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 273 transition count 224
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 273 transition count 215
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 264 transition count 215
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 245 transition count 196
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 245 transition count 196
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 245 transition count 195
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 244 transition count 195
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 229 transition count 180
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 229 transition count 180
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 148 place count 229 transition count 165
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 151 place count 227 transition count 164
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 227 transition count 161
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 157 place count 224 transition count 161
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 147 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 145 transition count 86
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 145 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 144 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 143 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 142 transition count 84
Applied a total of 319 rules in 93 ms. Remains 142 /300 variables (removed 158) and now considering 84/251 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 142/300 places, 84/251 transitions.
Incomplete random walk after 1000000 steps, including 48019 resets, run finished after 9692 ms. (steps per millisecond=103 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 1000001 steps, including 9048 resets, run finished after 2000 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9228 resets, run finished after 2948 ms. (steps per millisecond=339 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9130 resets, run finished after 3313 ms. (steps per millisecond=301 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9101 resets, run finished after 2227 ms. (steps per millisecond=449 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 84 rows 142 cols
[2023-03-09 20:21:52] [INFO ] Computed 64 place invariants in 5 ms
[2023-03-09 20:21:52] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 20:21:52] [INFO ] [Nat]Absence check using 39 positive place invariants in 4 ms returned sat
[2023-03-09 20:21:52] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-09 20:21:52] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 20:21:52] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-09 20:21:52] [INFO ] After 223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 1255 ms.
Support contains 4 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 84/84 transitions.
Applied a total of 0 rules in 5 ms. Remains 142 /142 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 142/142 places, 84/84 transitions.
Incomplete random walk after 1000000 steps, including 47568 resets, run finished after 7882 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9358 resets, run finished after 3157 ms. (steps per millisecond=316 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9228 resets, run finished after 3264 ms. (steps per millisecond=306 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9117 resets, run finished after 3334 ms. (steps per millisecond=299 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9098 resets, run finished after 3159 ms. (steps per millisecond=316 ) properties (out of 4) seen :0
Finished probabilistic random walk after 68176 steps, run visited all 4 properties in 365 ms. (steps per millisecond=186 )
Probabilistic random walk after 68176 steps, saw 18151 distinct states, run finished after 365 ms. (steps per millisecond=186 ) properties seen :4
Able to resolve query StableMarking after proving 214 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 55766 ms.
ITS solved all properties within timeout

BK_STOP 1678393336202

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 StableMarking -timeout 180 -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-05b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 DES-PT-05b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r121-tall-167814499400253"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-05b.tgz
mv DES-PT-05b execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;