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

About the Execution of LTSMin+red for BART-COL-060

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
431.575 7924.00 19552.00 72.70 6 60 230 230 36 36 36 36 60 36 60 60 60 60 60 60 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.r009-oct2-167813598300749.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BART-COL-060, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598300749
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 8.2K Feb 26 07:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 07:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 05:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 05:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 12:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 26 12:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 08:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 08:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 219K 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BART-COL-060-UpperBounds-00
FORMULA_NAME BART-COL-060-UpperBounds-01
FORMULA_NAME BART-COL-060-UpperBounds-02
FORMULA_NAME BART-COL-060-UpperBounds-03
FORMULA_NAME BART-COL-060-UpperBounds-04
FORMULA_NAME BART-COL-060-UpperBounds-05
FORMULA_NAME BART-COL-060-UpperBounds-06
FORMULA_NAME BART-COL-060-UpperBounds-07
FORMULA_NAME BART-COL-060-UpperBounds-08
FORMULA_NAME BART-COL-060-UpperBounds-09
FORMULA_NAME BART-COL-060-UpperBounds-10
FORMULA_NAME BART-COL-060-UpperBounds-11
FORMULA_NAME BART-COL-060-UpperBounds-12
FORMULA_NAME BART-COL-060-UpperBounds-13
FORMULA_NAME BART-COL-060-UpperBounds-14
FORMULA_NAME BART-COL-060-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678644609954

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=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-COL-060
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 18:10:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 18:10:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 18:10:13] [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.
[2023-03-12 18:10:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 18:10:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1493 ms
[2023-03-12 18:10:14] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2023-03-12 18:10:14] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 25133 PT places and 8.443377072E10 transition bindings in 81 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
[2023-03-12 18:10:14] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 5 ms.
[2023-03-12 18:10:14] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce redundant transitions removed 5 transitions.
// Phase 1: matrix 2 rows 1 cols
[2023-03-12 18:10:14] [INFO ] Computed 0 place invariants in 3 ms
FORMULA BART-COL-060-UpperBounds-09 36 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BART-COL-060-UpperBounds-07 36 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BART-COL-060-UpperBounds-06 36 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BART-COL-060-UpperBounds-05 36 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BART-COL-060-UpperBounds-04 36 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BART-COL-060-UpperBounds-03 230 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BART-COL-060-UpperBounds-02 230 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BART-COL-060-UpperBounds-00 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-12 18:10:14] [INFO ] Invariant cache hit.
[2023-03-12 18:10:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:10:15] [INFO ] [Real]Absence check using state equation in 54 ms returned unsat
[2023-03-12 18:10:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:10:15] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
[2023-03-12 18:10:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:10:15] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2023-03-12 18:10:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:10:15] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2023-03-12 18:10:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:10:15] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2023-03-12 18:10:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:10:15] [INFO ] [Real]Absence check using state equation in 23 ms returned unsat
[2023-03-12 18:10:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:10:15] [INFO ] [Real]Absence check using state equation in 27 ms returned unsat
[2023-03-12 18:10:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:10:15] [INFO ] [Real]Absence check using state equation in 36 ms returned unsat
Current structural bounds on expressions (after SMT) : [60, 60, 60, 60, 60, 60, 60, 60]
FORMULA BART-COL-060-UpperBounds-15 60 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA BART-COL-060-UpperBounds-14 60 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA BART-COL-060-UpperBounds-13 60 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA BART-COL-060-UpperBounds-12 60 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA BART-COL-060-UpperBounds-11 60 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA BART-COL-060-UpperBounds-10 60 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA BART-COL-060-UpperBounds-08 60 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA BART-COL-060-UpperBounds-01 60 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Symmetric sort wr.t. initial and guards and successors and join/free detected :trainid
Symmetric sort wr.t. initial detected :trainid
Symmetric sort wr.t. initial and guards detected :trainid
Applying symmetric unfolding of full symmetric sort :trainid domain size was 60
Domain [distance(41), speed(6), distance(41)] of place NewDistTable breaks symmetries in sort distance
Arc [3:1*[$db, (MOD (ADD $tsp 1) 6), $da2]] contains successor/predecessor on variables of sort speed
[2023-03-12 18:10:17] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 1867 ms.
[2023-03-12 18:10:17] [INFO ] Unfolded 0 HLPN properties in 0 ms.
Deduced a syphon composed of 10215 places in 2 ms
Reduce places removed 10487 places and 121 transitions.
Incomplete random walk after 10054 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1256 ) properties (out of 0) seen :0
All properties solved without resorting to model-checking.
Total runtime 4577 ms.
ITS solved all properties within timeout

BK_STOP 1678644617878

--------------------
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 UpperBounds -timeout 360 -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="BART-COL-060"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 BART-COL-060, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r009-oct2-167813598300749"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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