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

About the Execution of Smart+red for DLCshifumi-PT-4a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
277.903 4129.00 9105.00 295.40 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.r121-tall-167814499700516.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 DLCshifumi-PT-4a, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-167814499700516
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 6.0K Feb 26 08:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 08:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 08:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 08:05 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:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 15:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 09:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 09:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 08:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 08:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.9M 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 ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1678397862981

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=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DLCshifumi-PT-4a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 21:37:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-09 21:37:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 21:37:44] [INFO ] Load time of PNML (sax parser for PT used): 244 ms
[2023-03-09 21:37:44] [INFO ] Transformed 1178 places.
[2023-03-09 21:37:44] [INFO ] Transformed 7504 transitions.
[2023-03-09 21:37:44] [INFO ] Found NUPN structural information;
[2023-03-09 21:37:44] [INFO ] Parsed PT model containing 1178 places and 7504 transitions and 28610 arcs in 422 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 5 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 924 transitions
Reduce redundant transitions removed 924 transitions.
Built sparse matrix representations for Structural reductions in 10 ms.33192KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 1178/1178 places, 6580/6580 transitions.
Graph (trivial) has 735 edges and 1178 vertex of which 166 / 1178 are part of one of the 79 SCC in 12 ms
Free SCC test removed 87 places
Ensure Unique test removed 1094 transitions
Reduce isomorphic transitions removed 1094 transitions.
Computed a total of 613 stabilizing places and 1 stable transitions
Computed a total of 613 stabilizing places and 1 stable transitions
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 1091 transition count 5411
Reduce places removed 75 places and 0 transitions.
Computed a total of 613 stabilizing places and 1 stable transitions
Iterating post reduction 1 with 75 rules applied. Total rules applied 151 place count 1016 transition count 5411
Computed a total of 613 stabilizing places and 1 stable transitions
Discarding 83 places :
Symmetric choice reduction at 2 with 83 rule applications. Total rules 234 place count 933 transition count 4396
Iterating global reduction 2 with 83 rules applied. Total rules applied 317 place count 933 transition count 4396
Ensure Unique test removed 387 transitions
Reduce isomorphic transitions removed 387 transitions.
Computed a total of 613 stabilizing places and 1 stable transitions
Iterating post reduction 2 with 387 rules applied. Total rules applied 704 place count 933 transition count 4009
Computed a total of 613 stabilizing places and 1 stable transitions
Performed 154 Post agglomeration using F-continuation condition.Transition count delta: 154
Deduced a syphon composed of 154 places in 2 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 1012 place count 779 transition count 3855
Ensure Unique test removed 612 transitions
Reduce isomorphic transitions removed 612 transitions.
Computed a total of 613 stabilizing places and 1 stable transitions
Iterating post reduction 3 with 612 rules applied. Total rules applied 1624 place count 779 transition count 3243
Computed a total of 613 stabilizing places and 1 stable transitions
Computed a total of 613 stabilizing places and 1 stable transitions
Drop transitions removed 1536 transitions
Redundant transition composition rules discarded 1536 transitions
Iterating global reduction 4 with 1536 rules applied. Total rules applied 3160 place count 779 transition count 1707
Computed a total of 613 stabilizing places and 1 stable transitions
Discarding 233 places :
Symmetric choice reduction at 4 with 233 rule applications. Total rules 3393 place count 546 transition count 1458
Iterating global reduction 4 with 233 rules applied. Total rules applied 3626 place count 546 transition count 1458
Computed a total of 380 stabilizing places and 1 stable transitions
Computed a total of 380 stabilizing places and 1 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3627 place count 545 transition count 1457
Reduce places removed 379 places and 0 transitions.
Ensure Unique test removed 1125 transitions
Reduce isomorphic transitions removed 1125 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (trivial) has 332 edges and 166 vertex of which 166 / 166 are part of one of the 79 SCC in 0 ms
Free SCC test removed 87 places
Iterating post reduction 4 with 1505 rules applied. Total rules applied 5132 place count 79 transition count 332
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 331 transitions
Reduce isomorphic transitions removed 331 transitions.
Found a source transition so no deadlocks exist. place count 0 transition count 1
FORMULA ReachabilityDeadlock FALSE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION
Total runtime 1446 ms.
ITS solved all properties within timeout

BK_STOP 1678397867110

--------------------
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 ReachabilityDeadlock -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="DLCshifumi-PT-4a"
export BK_EXAMINATION="ReachabilityDeadlock"
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 DLCshifumi-PT-4a, examination is ReachabilityDeadlock"
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-167814499700516"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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