fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of Marcie+red for Sudoku-COL-AN08

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
248.840 7422.00 11593.00 285.60 64 64 64 64 64 64 64 64 64 64 64 64 64 64 64 64 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-167912708100061.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-COL-AN08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708100061
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 6.4K Feb 26 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 08:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 08:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 09:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 09:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 08:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 08:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K 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 Sudoku-COL-AN08-UpperBounds-00
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-01
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-02
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-03
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-04
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-05
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-06
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-07
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-08
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-09
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-10
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-11
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-12
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-13
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-14
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679177339176

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=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN08
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 22:09:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-18 22:09:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 22:09:00] [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-18 22:09:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 22:09:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 617 ms
[2023-03-18 22:09:01] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 704 PT places and 512.0 transition bindings in 10 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-18 22:09:01] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 3 ms.
[2023-03-18 22:09:01] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 1 rows 4 cols
[2023-03-18 22:09:01] [INFO ] Computed 3 place invariants in 5 ms
FORMULA Sudoku-COL-AN08-UpperBounds-15 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN08-UpperBounds-14 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN08-UpperBounds-13 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN08-UpperBounds-11 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN08-UpperBounds-10 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN08-UpperBounds-08 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN08-UpperBounds-07 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN08-UpperBounds-06 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN08-UpperBounds-05 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN08-UpperBounds-03 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN08-UpperBounds-02 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN08-UpperBounds-01 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN08-UpperBounds-00 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-18 22:09:01] [INFO ] Invariant cache hit.
[2023-03-18 22:09:01] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-18 22:09:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:09:01] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-18 22:09:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:09:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 22:09:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:09:01] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-18 22:09:01] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 22:09:01] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2023-03-18 22:09:01] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 22:09:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:09:01] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-18 22:09:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:09:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 22:09:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:09:01] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-18 22:09:01] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-18 22:09:01] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2023-03-18 22:09:01] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 22:09:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:09:01] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-18 22:09:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:09:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 22:09:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:09:01] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-18 22:09:01] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 22:09:01] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : [64, 64, 64]
Domain [N(8), N(8)] of place Rows breaks symmetries in sort N
[2023-03-18 22:09:01] [INFO ] Unfolded HLPN to a Petri net with 704 places and 512 transitions 2048 arcs in 27 ms.
[2023-03-18 22:09:01] [INFO ] Unfolded 3 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 179 resets, run finished after 539 ms. (steps per millisecond=18 ) properties (out of 3) seen :177
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 3) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 3) seen :24
// Phase 1: matrix 512 rows 704 cols
[2023-03-18 22:09:02] [INFO ] Computed 192 place invariants in 19 ms
[2023-03-18 22:09:02] [INFO ] [Real]Absence check using 192 positive place invariants in 81 ms returned sat
[2023-03-18 22:09:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:09:03] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2023-03-18 22:09:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:09:03] [INFO ] [Nat]Absence check using 192 positive place invariants in 67 ms returned sat
[2023-03-18 22:09:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:09:03] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2023-03-18 22:09:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-18 22:09:03] [INFO ] Added : 0 causal constraints over 0 iterations in 74 ms. Result :sat
Minimization took 55 ms.
[2023-03-18 22:09:03] [INFO ] [Real]Absence check using 192 positive place invariants in 72 ms returned sat
[2023-03-18 22:09:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:09:03] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2023-03-18 22:09:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:09:04] [INFO ] [Nat]Absence check using 192 positive place invariants in 69 ms returned sat
[2023-03-18 22:09:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:09:04] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2023-03-18 22:09:04] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-18 22:09:04] [INFO ] Added : 0 causal constraints over 0 iterations in 76 ms. Result :sat
Minimization took 52 ms.
[2023-03-18 22:09:04] [INFO ] [Real]Absence check using 192 positive place invariants in 83 ms returned sat
[2023-03-18 22:09:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:09:04] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2023-03-18 22:09:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:09:05] [INFO ] [Nat]Absence check using 192 positive place invariants in 67 ms returned sat
[2023-03-18 22:09:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:09:05] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2023-03-18 22:09:05] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 24 ms.
[2023-03-18 22:09:05] [INFO ] Added : 0 causal constraints over 0 iterations in 70 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [64, 64, 64] Max seen :[59, 59, 59]
FORMULA Sudoku-COL-AN08-UpperBounds-12 64 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN08-UpperBounds-09 64 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN08-UpperBounds-04 64 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 5058 ms.
ITS solved all properties within timeout

BK_STOP 1679177346598

--------------------
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="Sudoku-COL-AN08"
export BK_EXAMINATION="UpperBounds"
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-COL-AN08, 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 r490-tall-167912708100061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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