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

About the Execution of Smart+red for ParamProductionCell-PT-1

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
260.352 12878.00 21955.00 513.30 T 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.r281-smll-167863550900233.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 ParamProductionCell-PT-1, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r281-smll-167863550900233
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 720K
-rw-r--r-- 1 mcc users 7.6K Feb 26 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 17:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 26 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K Feb 26 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 26 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 174K 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 booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678920105537

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=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ParamProductionCell-PT-1
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-15 22:41:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-15 22:41:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:41:48] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2023-03-15 22:41:48] [INFO ] Transformed 231 places.
[2023-03-15 22:41:48] [INFO ] Transformed 202 transitions.
[2023-03-15 22:41:48] [INFO ] Found NUPN structural information;
[2023-03-15 22:41:48] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 252 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 763 ms. (steps per millisecond=13 ) properties (out of 231) seen :207
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 202 rows 231 cols
[2023-03-15 22:41:50] [INFO ] Computed 59 place invariants in 29 ms
[2023-03-15 22:41:50] [INFO ] After 592ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-15 22:41:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 27 ms returned sat
[2023-03-15 22:41:51] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 21 ms returned sat
[2023-03-15 22:41:51] [INFO ] After 547ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-03-15 22:41:51] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:41:52] [INFO ] After 558ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-03-15 22:41:52] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 11 ms to minimize.
[2023-03-15 22:41:52] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 2 ms to minimize.
[2023-03-15 22:41:52] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 1 ms to minimize.
[2023-03-15 22:41:53] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 2 ms to minimize.
[2023-03-15 22:41:53] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 2 ms to minimize.
[2023-03-15 22:41:53] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 1 ms to minimize.
[2023-03-15 22:41:53] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 0 ms to minimize.
[2023-03-15 22:41:53] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2023-03-15 22:41:53] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2023-03-15 22:41:53] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 0 ms to minimize.
[2023-03-15 22:41:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 1359 ms
[2023-03-15 22:41:53] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2023-03-15 22:41:54] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 0 ms to minimize.
[2023-03-15 22:41:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 217 ms
[2023-03-15 22:41:54] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2023-03-15 22:41:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 118 ms
[2023-03-15 22:41:54] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2023-03-15 22:41:54] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 9 ms to minimize.
[2023-03-15 22:41:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 228 ms
[2023-03-15 22:41:54] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2023-03-15 22:41:54] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 1 ms to minimize.
[2023-03-15 22:41:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 236 ms
[2023-03-15 22:41:54] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 4 ms to minimize.
[2023-03-15 22:41:54] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 1 ms to minimize.
[2023-03-15 22:41:55] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2023-03-15 22:41:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 305 ms
[2023-03-15 22:41:55] [INFO ] Deduced a trap composed of 88 places in 71 ms of which 1 ms to minimize.
[2023-03-15 22:41:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 98 ms
[2023-03-15 22:41:55] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 1 ms to minimize.
[2023-03-15 22:41:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 102 ms
[2023-03-15 22:41:55] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2023-03-15 22:41:55] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 0 ms to minimize.
[2023-03-15 22:41:55] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2023-03-15 22:41:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 246 ms
[2023-03-15 22:41:55] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 0 ms to minimize.
[2023-03-15 22:41:56] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2023-03-15 22:41:56] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 0 ms to minimize.
[2023-03-15 22:41:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 225 ms
[2023-03-15 22:41:56] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2023-03-15 22:41:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 121 ms
[2023-03-15 22:41:56] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
[2023-03-15 22:41:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 89 ms
[2023-03-15 22:41:56] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 1 ms to minimize.
[2023-03-15 22:41:56] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 0 ms to minimize.
[2023-03-15 22:41:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 248 ms
[2023-03-15 22:41:57] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 1 ms to minimize.
[2023-03-15 22:41:57] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 14 ms to minimize.
[2023-03-15 22:41:57] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2023-03-15 22:41:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 365 ms
[2023-03-15 22:41:57] [INFO ] After 5400ms SMT Verify possible using trap constraints in natural domain returned unsat :24 sat :0
[2023-03-15 22:41:57] [INFO ] After 6538ms SMT Verify possible using all constraints in natural domain returned unsat :24 sat :0
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Total runtime 8992 ms.
ITS solved all properties within timeout

BK_STOP 1678920118415

--------------------
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 StableMarking -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="ParamProductionCell-PT-1"
export BK_EXAMINATION="StableMarking"
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 ParamProductionCell-PT-1, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r281-smll-167863550900233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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