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

About the Execution of Marcie+red for Sudoku-PT-AN15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9627.491 3600000.00 3648008.00 7943.10 FFFTTTFFTTFFTTTT 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.r490-tall-167912708400278.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 marciexred
Input is Sudoku-PT-AN15, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708400278
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 68M
-rw-r--r-- 1 mcc users 1.8M Feb 26 10:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 8.2M Feb 26 10:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3M Feb 26 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 11M Feb 26 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 434K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.4M Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 5.0M Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.3M Feb 26 10:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.7M Feb 26 10:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1M Feb 26 10:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23M Feb 26 10:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 25K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 64K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.9M 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

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

=== Now, execution of the tool begins

BK_START 1679229557242

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN15
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 12:39:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 12:39:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 12:39:18] [INFO ] Load time of PNML (sax parser for PT used): 260 ms
[2023-03-19 12:39:18] [INFO ] Transformed 4050 places.
[2023-03-19 12:39:19] [INFO ] Transformed 3375 transitions.
[2023-03-19 12:39:19] [INFO ] Parsed PT model containing 4050 places and 3375 transitions and 13500 arcs in 344 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 758 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 50 resets, run finished after 5911 ms. (steps per millisecond=1 ) properties (out of 16) seen :4
FORMULA Sudoku-PT-AN15-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN15-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN15-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN15-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4138 ms. (steps per millisecond=2 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1640 ms. (steps per millisecond=6 ) properties (out of 12) seen :0
Interrupted Best-First random walk after 9755 steps, including 2 resets, run timeout after 5545 ms. (steps per millisecond=1 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 3375 rows 4050 cols
[2023-03-19 12:39:38] [INFO ] Computed 675 place invariants in 57 ms
[2023-03-19 12:39:45] [INFO ] [Real]Absence check using 675 positive place invariants in 219 ms returned sat
[2023-03-19 12:39:48] [INFO ] After 4794ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:9
[2023-03-19 12:39:49] [INFO ] [Nat]Absence check using 675 positive place invariants in 196 ms returned sat
[2023-03-19 12:40:03] [INFO ] After 9768ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :7
[2023-03-19 12:40:13] [INFO ] After 19492ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :6
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-19 12:40:13] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :6
FORMULA Sudoku-PT-AN15-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN15-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN15-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN15-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN15-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 6 different solutions.
FORMULA Sudoku-PT-AN15-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-PT-AN15-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-PT-AN15-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-PT-AN15-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-PT-AN15-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-PT-AN15-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 156 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=22 )
FORMULA Sudoku-PT-AN15-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 7 properties in 202 ms.
All properties solved without resorting to model-checking.
Total runtime 54882 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Sudoku_PT_AN15
(NrP: 4050 NrTr: 3375 NrArc: 13500)

parse formulas
formulas created successfully
place and transition orderings generation:0m 1.441sec

net check time: 0m 0.002sec

init dd package: 0m 2.787sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6448220 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16028572 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.012sec

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="Sudoku-PT-AN15"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is Sudoku-PT-AN15, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r490-tall-167912708400278"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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