fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r117-csrt-158961278200181
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for NeoElection-PT-4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15740.070 3713.00 6594.00 85.90 T normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r117-csrt-158961278200181.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is NeoElection-PT-4, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r117-csrt-158961278200181
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 98K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 239K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 99K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 279K Apr 30 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 30 13:04 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 135K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 363K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 51K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 160K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 128K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 318K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 46K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 127K Apr 30 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 30 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K Apr 30 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 30 13:04 instance
-rw-r--r-- 1 mcc users 6 Apr 30 13:04 iscolored
-rw-r--r-- 1 mcc users 2.1M Apr 30 13:04 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 1590329074828

[2020-05-24 14:04:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2020-05-24 14:04:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-24 14:04:38] [INFO ] Load time of PNML (sax parser for PT used): 331 ms
[2020-05-24 14:04:38] [INFO ] Transformed 1830 places.
[2020-05-24 14:04:38] [INFO ] Transformed 2340 transitions.
[2020-05-24 14:04:38] [INFO ] Parsed PT model containing 1830 places and 2340 transitions in 427 ms.
Deduced a syphon composed of 1687 places in 9 ms
Reduce places removed 1699 places and 2213 transitions.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 35 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 3 ms.16051KB memory used
Starting structural reductions, iteration 0 : 131/131 places, 127/127 transitions.
Discarding 20 places :
Also discarding 0 output transitions
Graph (complete) has 383 edges and 131 vertex of which 111 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.8 ms
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 127
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 2 place count 110 transition count 119
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 22 place count 98 transition count 119
Symmetric choice reduction at 1 with 18 rule applications. Total rules 40 place count 98 transition count 119
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 49 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 76 place count 80 transition count 70
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 76 place count 80 transition count 66
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 84 place count 76 transition count 66
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 88 place count 72 transition count 62
Ensure Unique test removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 92 place count 68 transition count 62
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 96 place count 64 transition count 58
Ensure Unique test removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 100 place count 60 transition count 58
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 104 place count 56 transition count 54
Reduce places removed 4 places and 0 transitions.
Discarding 16 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Graph (complete) has 87 edges and 52 vertex of which 36 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 3 with 14 rules applied. Total rules applied 118 place count 36 transition count 32
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 127 place count 27 transition count 32
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 127 place count 27 transition count 31
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 129 place count 26 transition count 31
Symmetric choice reduction at 5 with 6 rule applications. Total rules 135 place count 26 transition count 31
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 9 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 147 place count 20 transition count 22
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 147 place count 20 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 151 place count 18 transition count 20
Applied a total of 151 rules in 56 ms. Remains 18 /131 variables (removed 113) and now considering 20/127 (removed 107) transitions.
Finished structural reductions, in 1 iterations. Remains : 18/131 places, 20/127 transitions.
Finished Parikh directed walk after 23 steps, including 0 resets, run found a deadlock after 1 ms. (steps per millisecond=23 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK

BK_STOP 1590329078541

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="NeoElection-PT-4"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itstools"
echo " Input is NeoElection-PT-4, 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 r117-csrt-158961278200181"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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