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

About the Execution of Smart+red for Sudoku-PT-AN12

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
332.352 72746.00 80475.00 457.30 144 144 144 144 144 144 144 144 1 1 1 1 1 1 1 1 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.r491-tall-167912710200253.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 Sudoku-PT-AN12, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r491-tall-167912710200253
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 35M
-rw-r--r-- 1 mcc users 1.1M Feb 26 09:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 4.8M Feb 26 09:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9M Feb 26 08:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 8.9M Feb 26 08:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 453K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.6M Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 754K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.6M Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.2M Feb 26 10:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.1M Feb 26 10:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 984K Feb 26 09:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.3M Feb 26 09:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 84K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 207K Feb 25 17:16 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 963K 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-PT-AN12-UpperBounds-00
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-01
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-02
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-03
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-04
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-05
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-06
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-07
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-08
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-09
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-10
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-11
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-12
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-13
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-14
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679234747440

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=Sudoku-PT-AN12
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-19 14:05:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-19 14:05:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 14:05:49] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2023-03-19 14:05:49] [INFO ] Transformed 2160 places.
[2023-03-19 14:05:49] [INFO ] Transformed 1728 transitions.
[2023-03-19 14:05:49] [INFO ] Parsed PT model containing 2160 places and 1728 transitions and 6912 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 44 ms.
// Phase 1: matrix 1728 rows 2160 cols
[2023-03-19 14:05:49] [INFO ] Computed 432 place invariants in 43 ms
FORMULA Sudoku-PT-AN12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-UpperBounds-07 144 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-UpperBounds-06 144 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-UpperBounds-05 144 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-UpperBounds-04 144 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-UpperBounds-01 144 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 79 resets, run finished after 2116 ms. (steps per millisecond=4 ) properties (out of 6) seen :393
FORMULA Sudoku-PT-AN12-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN12-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 3) seen :6
[2023-03-19 14:05:53] [INFO ] Invariant cache hit.
[2023-03-19 14:05:54] [INFO ] [Real]Absence check using 432 positive place invariants in 539 ms returned sat
[2023-03-19 14:05:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 14:05:55] [INFO ] [Real]Absence check using state equation in 1133 ms returned sat
[2023-03-19 14:05:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 14:05:55] [INFO ] [Nat]Absence check using 432 positive place invariants in 281 ms returned sat
[2023-03-19 14:05:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 14:05:56] [INFO ] [Nat]Absence check using state equation in 901 ms returned sat
[2023-03-19 14:05:57] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 98 ms.
[2023-03-19 14:05:57] [INFO ] Added : 0 causal constraints over 0 iterations in 299 ms. Result :sat
Minimization took 565 ms.
[2023-03-19 14:05:58] [INFO ] [Real]Absence check using 432 positive place invariants in 524 ms returned sat
[2023-03-19 14:05:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 14:05:59] [INFO ] [Real]Absence check using state equation in 1075 ms returned sat
[2023-03-19 14:05:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 14:06:00] [INFO ] [Nat]Absence check using 432 positive place invariants in 266 ms returned sat
[2023-03-19 14:06:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 14:06:01] [INFO ] [Nat]Absence check using state equation in 945 ms returned sat
[2023-03-19 14:06:01] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 83 ms.
[2023-03-19 14:06:01] [INFO ] Added : 0 causal constraints over 0 iterations in 229 ms. Result :sat
Minimization took 580 ms.
[2023-03-19 14:06:03] [INFO ] [Real]Absence check using 432 positive place invariants in 522 ms returned sat
[2023-03-19 14:06:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 14:06:04] [INFO ] [Real]Absence check using state equation in 1079 ms returned sat
[2023-03-19 14:06:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 14:06:04] [INFO ] [Nat]Absence check using 432 positive place invariants in 272 ms returned sat
[2023-03-19 14:06:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 14:06:05] [INFO ] [Nat]Absence check using state equation in 982 ms returned sat
[2023-03-19 14:06:05] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 89 ms.
[2023-03-19 14:06:05] [INFO ] Added : 0 causal constraints over 0 iterations in 230 ms. Result :sat
Minimization took 568 ms.
Current structural bounds on expressions (after SMT) : [1728, 1728, 1728] Max seen :[130, 130, 130]
Support contains 1728 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 141 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 2160/2160 places, 1728/1728 transitions.
[2023-03-19 14:06:12] [INFO ] Invariant cache hit.
Finished random walk after 144207 steps, including 1144 resets, run visited all 3 properties in 30001 ms. (steps per millisecond=4 )
Finished Best-First random walk after 129425 steps, including 1 resets, run visited all 3 properties in 5004 ms. (steps per millisecond=25 )
Finished Best-First random walk after 126205 steps, including 1 resets, run visited all 3 properties in 5005 ms. (steps per millisecond=25 )
Finished Best-First random walk after 123673 steps, including 1 resets, run visited all 3 properties in 5002 ms. (steps per millisecond=24 )
[2023-03-19 14:06:57] [INFO ] Invariant cache hit.
[2023-03-19 14:06:58] [INFO ] [Real]Absence check using 432 positive place invariants in 431 ms returned unsat
[2023-03-19 14:06:58] [INFO ] [Real]Absence check using 432 positive place invariants in 414 ms returned unsat
[2023-03-19 14:06:59] [INFO ] [Real]Absence check using 432 positive place invariants in 421 ms returned unsat
Current structural bounds on expressions (after SMT) : [144, 144, 144] Max seen :[144, 144, 144]
FORMULA Sudoku-PT-AN12-UpperBounds-03 144 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Sudoku-PT-AN12-UpperBounds-02 144 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Sudoku-PT-AN12-UpperBounds-00 144 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 70114 ms.
ITS solved all properties within timeout

BK_STOP 1679234820186

--------------------
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-PT-AN12"
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 Sudoku-PT-AN12, 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 r491-tall-167912710200253"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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