fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r185-tall-167838871600058
Last Updated
May 14, 2023

About the Execution of Smart+red for Echo-PT-d03r05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
561.075 20877.00 29805.00 440.90 F normal

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.r185-tall-167838871600058.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 Echo-PT-d03r05, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r185-tall-167838871600058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.6K Feb 25 14:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 14:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 14:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 14:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 25 14:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 14:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 25 14:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 716K 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 1679418499465

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=Echo-PT-d03r05
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 17:08:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-21 17:08:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 17:08:21] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2023-03-21 17:08:21] [INFO ] Transformed 1445 places.
[2023-03-21 17:08:21] [INFO ] Transformed 1190 transitions.
[2023-03-21 17:08:21] [INFO ] Found NUPN structural information;
[2023-03-21 17:08:21] [INFO ] Parsed PT model containing 1445 places and 1190 transitions and 8260 arcs in 211 ms.
Structural test allowed to assert that 8 places are NOT stable. Took 17 ms.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 652 ms. (steps per millisecond=15 ) properties (out of 1437) seen :1425
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1190 rows 1445 cols
[2023-03-21 17:08:22] [INFO ] Computed 725 place invariants in 77 ms
[2023-03-21 17:08:23] [INFO ] After 625ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 17:08:23] [INFO ] [Nat]Absence check using 108 positive place invariants in 37 ms returned sat
[2023-03-21 17:08:23] [INFO ] [Nat]Absence check using 108 positive and 617 generalized place invariants in 139 ms returned sat
[2023-03-21 17:08:26] [INFO ] After 2297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 17:08:26] [INFO ] Deduced a trap composed of 10 places in 262 ms of which 6 ms to minimize.
[2023-03-21 17:08:26] [INFO ] Deduced a trap composed of 19 places in 261 ms of which 1 ms to minimize.
[2023-03-21 17:08:27] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 2 ms to minimize.
[2023-03-21 17:08:27] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 1 ms to minimize.
[2023-03-21 17:08:27] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 1 ms to minimize.
[2023-03-21 17:08:27] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 0 ms to minimize.
[2023-03-21 17:08:28] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 1 ms to minimize.
[2023-03-21 17:08:28] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 1 ms to minimize.
[2023-03-21 17:08:28] [INFO ] Deduced a trap composed of 53 places in 252 ms of which 0 ms to minimize.
[2023-03-21 17:08:28] [INFO ] Deduced a trap composed of 20 places in 216 ms of which 1 ms to minimize.
[2023-03-21 17:08:29] [INFO ] Deduced a trap composed of 16 places in 212 ms of which 0 ms to minimize.
[2023-03-21 17:08:29] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 1 ms to minimize.
[2023-03-21 17:08:29] [INFO ] Deduced a trap composed of 29 places in 218 ms of which 1 ms to minimize.
[2023-03-21 17:08:30] [INFO ] Deduced a trap composed of 61 places in 238 ms of which 1 ms to minimize.
[2023-03-21 17:08:30] [INFO ] Deduced a trap composed of 67 places in 233 ms of which 0 ms to minimize.
[2023-03-21 17:08:30] [INFO ] Deduced a trap composed of 28 places in 211 ms of which 0 ms to minimize.
[2023-03-21 17:08:30] [INFO ] Deduced a trap composed of 40 places in 221 ms of which 1 ms to minimize.
[2023-03-21 17:08:31] [INFO ] Deduced a trap composed of 33 places in 231 ms of which 0 ms to minimize.
[2023-03-21 17:08:31] [INFO ] Deduced a trap composed of 56 places in 240 ms of which 0 ms to minimize.
[2023-03-21 17:08:31] [INFO ] Deduced a trap composed of 57 places in 229 ms of which 1 ms to minimize.
[2023-03-21 17:08:32] [INFO ] Deduced a trap composed of 50 places in 221 ms of which 1 ms to minimize.
[2023-03-21 17:08:32] [INFO ] Deduced a trap composed of 54 places in 231 ms of which 0 ms to minimize.
[2023-03-21 17:08:32] [INFO ] Deduced a trap composed of 55 places in 228 ms of which 0 ms to minimize.
[2023-03-21 17:08:32] [INFO ] Deduced a trap composed of 52 places in 228 ms of which 1 ms to minimize.
[2023-03-21 17:08:33] [INFO ] Deduced a trap composed of 59 places in 228 ms of which 1 ms to minimize.
[2023-03-21 17:08:34] [INFO ] Deduced a trap composed of 10 places in 257 ms of which 1 ms to minimize.
[2023-03-21 17:08:34] [INFO ] Deduced a trap composed of 17 places in 253 ms of which 1 ms to minimize.
[2023-03-21 17:08:34] [INFO ] Deduced a trap composed of 12 places in 246 ms of which 1 ms to minimize.
[2023-03-21 17:08:35] [INFO ] Deduced a trap composed of 10 places in 241 ms of which 0 ms to minimize.
[2023-03-21 17:08:35] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 1 ms to minimize.
[2023-03-21 17:08:36] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 0 ms to minimize.
[2023-03-21 17:08:36] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 0 ms to minimize.
[2023-03-21 17:08:36] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 1 ms to minimize.
[2023-03-21 17:08:37] [INFO ] Deduced a trap composed of 11 places in 291 ms of which 3 ms to minimize.
[2023-03-21 17:08:37] [INFO ] Deduced a trap composed of 15 places in 308 ms of which 1 ms to minimize.
[2023-03-21 17:08:37] [INFO ] Deduced a trap composed of 12 places in 291 ms of which 0 ms to minimize.
[2023-03-21 17:08:38] [INFO ] Deduced a trap composed of 13 places in 284 ms of which 0 ms to minimize.
[2023-03-21 17:08:38] [INFO ] Deduced a trap composed of 16 places in 279 ms of which 1 ms to minimize.
[2023-03-21 17:08:38] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 12432 ms
[2023-03-21 17:08:39] [INFO ] Deduced a trap composed of 30 places in 291 ms of which 1 ms to minimize.
[2023-03-21 17:08:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 406 ms
[2023-03-21 17:08:39] [INFO ] After 15317ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 150 ms.
[2023-03-21 17:08:39] [INFO ] After 16020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 98 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=24 )
Parikh walk visited 3 properties in 6 ms.
Able to resolve query StableMarking after proving 1438 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 18298 ms.
ITS solved all properties within timeout

BK_STOP 1679418520342

--------------------
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="Echo-PT-d03r05"
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 Echo-PT-d03r05, 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 r185-tall-167838871600058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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