fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r421-smll-171690573300422
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for TwoPhaseLocking-PT-nC05000vD

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
274.584 4790.00 12628.00 104.70 FFTTTTFFTTFFTFFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r421-smll-171690573300422.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is TwoPhaseLocking-PT-nC05000vD, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-smll-171690573300422
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 13 07:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 13 07:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 13 07:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 13 07:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 08:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.6K May 18 16:43 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 TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-00
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-01
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-02
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-03
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-04
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-05
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-06
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-07
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-08
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-09
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-10
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-11
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-12
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-13
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-14
FORMULA_NAME TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717118075318

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TwoPhaseLocking-PT-nC05000vD
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-31 01:14:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 01:14:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 01:14:37] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2024-05-31 01:14:37] [INFO ] Transformed 8 places.
[2024-05-31 01:14:37] [INFO ] Transformed 6 transitions.
[2024-05-31 01:14:37] [INFO ] Parsed PT model containing 8 places and 6 transitions and 18 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40024 steps (8 resets) in 202 ms. (197 steps per ms) remains 10/16 properties
FORMULA TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 857 ms. (46 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 534 ms. (74 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 774 ms. (51 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1103 ms. (36 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 142 ms. (279 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 187 ms. (212 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 10/10 properties
// Phase 1: matrix 6 rows 8 cols
[2024-05-31 01:14:38] [INFO ] Computed 3 invariants in 7 ms
Problem TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-13 is UNSAT
FORMULA TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-02 is UNSAT
FORMULA TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-06 is UNSAT
FORMULA TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-09 is UNSAT
FORMULA TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-10 is UNSAT
FORMULA TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-12 is UNSAT
FORMULA TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-14 is UNSAT
FORMULA TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 7 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 7 solved, 3 unsolved in 404 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 3/14 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/14 constraints. Problems are: Problem set: 7 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 14 constraints, problems are : Problem set: 7 solved, 3 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 3/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 632ms problems are : Problem set: 7 solved, 3 unsolved
FORMULA TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-00 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 6412 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=458 )
FORMULA TwoPhaseLocking-PT-nC05000vD-ReachabilityCardinality-2024-01 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 576 ms.
All properties solved without resorting to model-checking.
Total runtime 3034 ms.
ITS solved all properties within timeout

BK_STOP 1717118080108

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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="TwoPhaseLocking-PT-nC05000vD"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is TwoPhaseLocking-PT-nC05000vD, 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 r421-smll-171690573300422"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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