fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r233-tall-171649622600156
Last Updated
July 7, 2024

About the Execution of ITS-Tools for LamportFastMutEx-COL-8

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
728.424 10957.00 18977.00 62.70 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/mcc2024-input.r233-tall-171649622600156.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is LamportFastMutEx-COL-8, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-171649622600156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.1K Apr 13 07:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 13 07:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 13 07:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 13 07:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 07:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 13 07:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 13 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 13 07:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 44K May 18 16:42 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 1716539061212

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=LamportFastMutEx-COL-8
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
ReachabilityDeadlock COL
Running Version 202405141337
[2024-05-24 08:24:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-24 08:24:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 08:24:22] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-24 08:24:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 08:24:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 587 ms
[2024-05-24 08:24:23] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 315 PT places and 837.0 transition bindings in 18 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 1 ms.
Working with output stream class java.io.PrintStream
[2024-05-24 08:24:23] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2024-05-24 08:24:23] [INFO ] Skeletonized 1 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Domain [pid(9), pid(9)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-24 08:24:23] [INFO ] Unfolded HLPN to a Petri net with 315 places and 666 transitions 2934 arcs in 38 ms.
[2024-05-24 08:24:23] [INFO ] Unfolded 1 HLPN properties in 0 ms.
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 82 transitions.
Built sparse matrix representations for Structural reductions in 2 ms.29856KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 266/266 places, 584/584 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 576
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Applied a total of 16 rules in 89 ms. Remains 258 /266 variables (removed 8) and now considering 576/584 (removed 8) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 100 ms. Remains : 258/266 places, 576/584 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2794 ms (no deadlock found). (steps per millisecond=447 )
Random directed walk for 1250002 steps, including 0 resets, run took 2166 ms (no deadlock found). (steps per millisecond=577 )
[2024-05-24 08:24:28] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 258 cols
[2024-05-24 08:24:28] [INFO ] Computed 82 invariants in 11 ms
[2024-05-24 08:24:28] [INFO ] [Real]Absence check using 82 positive place invariants in 31 ms returned sat
[2024-05-24 08:24:28] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-24 08:24:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:29] [INFO ] [Nat]Absence check using 82 positive place invariants in 26 ms returned sat
[2024-05-24 08:24:29] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2024-05-24 08:24:29] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 08:24:29] [INFO ] [Nat]Added 112 Read/Feed constraints in 33 ms returned sat
[2024-05-24 08:24:29] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 18 ms to minimize.
[2024-05-24 08:24:29] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 2 ms to minimize.
[2024-05-24 08:24:29] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 2 ms to minimize.
[2024-05-24 08:24:29] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2024-05-24 08:24:29] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 1 ms to minimize.
[2024-05-24 08:24:30] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 1 ms to minimize.
[2024-05-24 08:24:30] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:24:30] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-05-24 08:24:30] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 5 ms to minimize.
[2024-05-24 08:24:30] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-24 08:24:30] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
[2024-05-24 08:24:30] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
[2024-05-24 08:24:30] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:24:30] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-24 08:24:30] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:24:31] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-24 08:24:31] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:24:31] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-24 08:24:31] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-24 08:24:31] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2024-05-24 08:24:31] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-24 08:24:31] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 2 ms to minimize.
[2024-05-24 08:24:31] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-24 08:24:31] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-24 08:24:31] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-24 08:24:31] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-24 08:24:31] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-24 08:24:31] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-24 08:24:31] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-24 08:24:31] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-24 08:24:32] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-24 08:24:32] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-24 08:24:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 32 trap constraints in 2800 ms
FORMULA ReachabilityDeadlock FALSE TECHNIQUES TOPOLOGICAL SAT_SMT STRUCTURAL_REDUCTION
Total runtime 9757 ms.

BK_STOP 1716539072169

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="LamportFastMutEx-COL-8"
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"
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-5568"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-COL-8, 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 r233-tall-171649622600156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-8.tgz
mv LamportFastMutEx-COL-8 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 ;