Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r439-tajo-167905985900058.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldRVs-PT-010B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r439-tajo-167905985900058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 5.7K Feb 26 18:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 26 18:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 18:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 18:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 18:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 18:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 122K 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 booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1679552761169

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=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVs-PT-010B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 06:26:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-23 06:26:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 06:26:02] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-23 06:26:02] [INFO ] Transformed 403 places.
[2023-03-23 06:26:02] [INFO ] Transformed 453 transitions.
[2023-03-23 06:26:02] [INFO ] Found NUPN structural information;
[2023-03-23 06:26:02] [INFO ] Parsed PT model containing 403 places and 453 transitions and 1440 arcs in 115 ms.
Structural test allowed to assert that 191 places are NOT stable. Took 9 ms.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 452 ms. (steps per millisecond=22 ) properties (out of 212) seen :199
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 453 rows 403 cols
[2023-03-23 06:26:03] [INFO ] Computed 41 place invariants in 20 ms
[2023-03-23 06:26:04] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-23 06:26:04] [INFO ] [Nat]Absence check using 41 positive place invariants in 11 ms returned sat
[2023-03-23 06:26:04] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-23 06:26:04] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 6 ms to minimize.
[2023-03-23 06:26:04] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
[2023-03-23 06:26:04] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 0 ms to minimize.
[2023-03-23 06:26:05] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2023-03-23 06:26:05] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2023-03-23 06:26:05] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 0 ms to minimize.
[2023-03-23 06:26:05] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2023-03-23 06:26:05] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 4 ms to minimize.
[2023-03-23 06:26:05] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2023-03-23 06:26:05] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 1 ms to minimize.
[2023-03-23 06:26:05] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 1 ms to minimize.
[2023-03-23 06:26:05] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 0 ms to minimize.
[2023-03-23 06:26:05] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2023-03-23 06:26:06] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 0 ms to minimize.
[2023-03-23 06:26:06] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 0 ms to minimize.
[2023-03-23 06:26:06] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 0 ms to minimize.
[2023-03-23 06:26:06] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 0 ms to minimize.
[2023-03-23 06:26:06] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2023-03-23 06:26:06] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2023-03-23 06:26:06] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2023-03-23 06:26:06] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2023-03-23 06:26:07] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2023-03-23 06:26:07] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 1 ms to minimize.
[2023-03-23 06:26:07] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2023-03-23 06:26:07] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 0 ms to minimize.
[2023-03-23 06:26:07] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2023-03-23 06:26:07] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 2843 ms
[2023-03-23 06:26:07] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 0 ms to minimize.
[2023-03-23 06:26:07] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2023-03-23 06:26:07] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 0 ms to minimize.
[2023-03-23 06:26:07] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2023-03-23 06:26:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 268 ms
[2023-03-23 06:26:07] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2023-03-23 06:26:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-23 06:26:08] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 0 ms to minimize.
[2023-03-23 06:26:08] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 0 ms to minimize.
[2023-03-23 06:26:08] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2023-03-23 06:26:08] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 1 ms to minimize.
[2023-03-23 06:26:08] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 1 ms to minimize.
[2023-03-23 06:26:08] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2023-03-23 06:26:08] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 0 ms to minimize.
[2023-03-23 06:26:08] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 1 ms to minimize.
[2023-03-23 06:26:09] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 1 ms to minimize.
[2023-03-23 06:26:09] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 0 ms to minimize.
[2023-03-23 06:26:09] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 0 ms to minimize.
[2023-03-23 06:26:09] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 2 ms to minimize.
[2023-03-23 06:26:09] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 0 ms to minimize.
[2023-03-23 06:26:09] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 1 ms to minimize.
[2023-03-23 06:26:09] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 0 ms to minimize.
[2023-03-23 06:26:09] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 0 ms to minimize.
[2023-03-23 06:26:10] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 0 ms to minimize.
[2023-03-23 06:26:10] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 0 ms to minimize.
[2023-03-23 06:26:10] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 0 ms to minimize.
[2023-03-23 06:26:10] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 0 ms to minimize.
[2023-03-23 06:26:10] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 1 ms to minimize.
[2023-03-23 06:26:10] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 0 ms to minimize.
[2023-03-23 06:26:10] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 0 ms to minimize.
[2023-03-23 06:26:10] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2023-03-23 06:26:11] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 0 ms to minimize.
[2023-03-23 06:26:11] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 4 ms to minimize.
[2023-03-23 06:26:11] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2023-03-23 06:26:11] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 0 ms to minimize.
[2023-03-23 06:26:11] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2023-03-23 06:26:11] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 3392 ms
[2023-03-23 06:26:11] [INFO ] After 7075ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 156 ms.
[2023-03-23 06:26:11] [INFO ] After 7460ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 1 properties in 7853 ms.
Support contains 9 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 453/453 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 403 transition count 412
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 362 transition count 412
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 82 place count 362 transition count 362
Deduced a syphon composed of 50 places in 3 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 182 place count 312 transition count 362
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 244 place count 250 transition count 300
Iterating global reduction 2 with 62 rules applied. Total rules applied 306 place count 250 transition count 300
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 306 place count 250 transition count 270
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 366 place count 220 transition count 270
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 2 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 504 place count 151 transition count 201
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 2 with 22 rules applied. Total rules applied 526 place count 151 transition count 201
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 527 place count 150 transition count 200
Applied a total of 527 rules in 128 ms. Remains 150 /403 variables (removed 253) and now considering 200/453 (removed 253) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 150/403 places, 200/453 transitions.
Finished random walk after 1444 steps, including 10 resets, run visited all 9 properties in 13 ms. (steps per millisecond=111 )
Able to resolve query StableMarking after proving 213 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 16724 ms.
ITS solved all properties within timeout

BK_STOP 1679552779855

--------------------
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 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="ShieldRVs-PT-010B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldRVs-PT-010B, 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 r439-tajo-167905985900058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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