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

About the Execution of Smart+red for PermAdmissibility-PT-50

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
268.388 7556.00 13464.00 360.20 50 100 50 50 100 50 100 100 50 50 50 50 50 50 50 50 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.r267-smll-167863542000549.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 PermAdmissibility-PT-50, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-167863542000549
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 11K Feb 26 01:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 01:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 76K Feb 26 01:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 407K Feb 26 01:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Feb 26 01:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 190K Feb 26 01:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 36K Feb 26 01:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 166K Feb 26 01:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 340K Mar 5 18:23 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 PermAdmissibility-PT-50-UpperBounds-00
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-01
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-02
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-03
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-04
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-05
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-06
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-07
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-08
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-09
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-10
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-11
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-12
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-13
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-14
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678924897629

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=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-50
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-16 00:01:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-16 00:01:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 00:01:40] [INFO ] Load time of PNML (sax parser for PT used): 334 ms
[2023-03-16 00:01:40] [INFO ] Transformed 168 places.
[2023-03-16 00:01:40] [INFO ] Transformed 592 transitions.
[2023-03-16 00:01:40] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 621 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
// Phase 1: matrix 592 rows 168 cols
[2023-03-16 00:01:41] [INFO ] Computed 32 place invariants in 58 ms
Incomplete random walk after 10010 steps, including 12 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 16) seen :1000
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :395
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 16) seen :379
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 16) seen :377
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 16) seen :377
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 16) seen :397
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 16) seen :379
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :381
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 16) seen :391
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :384
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :380
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 16) seen :419
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :377
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 16) seen :395
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 16) seen :387
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 16) seen :383
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 16) seen :371
[2023-03-16 00:01:42] [INFO ] Invariant cache hit.
[2023-03-16 00:01:42] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 23 ms returned unsat
[2023-03-16 00:01:42] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 19 ms returned unsat
[2023-03-16 00:01:42] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 51 ms returned unsat
[2023-03-16 00:01:42] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 91 ms returned unsat
[2023-03-16 00:01:42] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 11 ms returned unsat
[2023-03-16 00:01:43] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 10 ms returned unsat
[2023-03-16 00:01:43] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 34 ms returned unsat
[2023-03-16 00:01:43] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 13 ms returned unsat
[2023-03-16 00:01:43] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 10 ms returned unsat
[2023-03-16 00:01:43] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 22 ms returned unsat
[2023-03-16 00:01:43] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 24 ms returned unsat
[2023-03-16 00:01:43] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 19 ms returned unsat
[2023-03-16 00:01:43] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 11 ms returned unsat
[2023-03-16 00:01:43] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 17 ms returned unsat
[2023-03-16 00:01:43] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 32 ms returned unsat
[2023-03-16 00:01:44] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 20 ms returned unsat
Current structural bounds on expressions (after SMT) : [50, 100, 50, 50, 100, 50, 100, 100, 50, 50, 50, 50, 50, 50, 50, 50] Max seen :[50, 100, 50, 50, 100, 50, 100, 100, 50, 50, 50, 50, 50, 50, 50, 50]
FORMULA PermAdmissibility-PT-50-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-10 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-09 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-07 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-06 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-04 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-03 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-02 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-01 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 3739 ms.
ITS solved all properties within timeout

BK_STOP 1678924905185

--------------------
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="PermAdmissibility-PT-50"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is PermAdmissibility-PT-50, 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 r267-smll-167863542000549"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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