About the Execution of GreatSPN+red for Sudoku-PT-AN03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
250.575 | 3545.00 | 8574.00 | 28.00 | TFFTFTTFTTTFTTTT | 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.r399-tall-171690530700590.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 Sudoku-PT-AN03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530700590
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 27K Apr 12 10:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 10:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 44K Apr 12 10:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 243K Apr 12 10:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 14K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 59K Apr 12 10:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 382K Apr 12 10:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 87K Apr 12 10:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 463K Apr 12 10:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 21K 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 Sudoku-PT-AN03-ReachabilityCardinality-2024-00
FORMULA_NAME Sudoku-PT-AN03-ReachabilityCardinality-2024-01
FORMULA_NAME Sudoku-PT-AN03-ReachabilityCardinality-2024-02
FORMULA_NAME Sudoku-PT-AN03-ReachabilityCardinality-2024-03
FORMULA_NAME Sudoku-PT-AN03-ReachabilityCardinality-2024-04
FORMULA_NAME Sudoku-PT-AN03-ReachabilityCardinality-2024-05
FORMULA_NAME Sudoku-PT-AN03-ReachabilityCardinality-2024-06
FORMULA_NAME Sudoku-PT-AN03-ReachabilityCardinality-2024-07
FORMULA_NAME Sudoku-PT-AN03-ReachabilityCardinality-2024-08
FORMULA_NAME Sudoku-PT-AN03-ReachabilityCardinality-2024-09
FORMULA_NAME Sudoku-PT-AN03-ReachabilityCardinality-2024-10
FORMULA_NAME Sudoku-PT-AN03-ReachabilityCardinality-2024-11
FORMULA_NAME Sudoku-PT-AN03-ReachabilityCardinality-2024-12
FORMULA_NAME Sudoku-PT-AN03-ReachabilityCardinality-2024-13
FORMULA_NAME Sudoku-PT-AN03-ReachabilityCardinality-2024-14
FORMULA_NAME Sudoku-PT-AN03-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717056572111
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 08:09:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 08:09:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 08:09:33] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2024-05-30 08:09:33] [INFO ] Transformed 54 places.
[2024-05-30 08:09:33] [INFO ] Transformed 27 transitions.
[2024-05-30 08:09:33] [INFO ] Found NUPN structural information;
[2024-05-30 08:09:33] [INFO ] Parsed PT model containing 54 places and 27 transitions and 108 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-AN03-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (4692 resets) in 1703 ms. (23 steps per ms) remains 5/11 properties
FORMULA Sudoku-PT-AN03-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN03-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN03-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN03-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN03-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN03-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (436 resets) in 713 ms. (56 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (439 resets) in 671 ms. (59 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (436 resets) in 1112 ms. (35 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (445 resets) in 234 ms. (170 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (433 resets) in 113 ms. (350 steps per ms) remains 5/5 properties
// Phase 1: matrix 27 rows 54 cols
[2024-05-30 08:09:35] [INFO ] Computed 27 invariants in 9 ms
Problem Sudoku-PT-AN03-ReachabilityCardinality-2024-02 is UNSAT
FORMULA Sudoku-PT-AN03-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem Sudoku-PT-AN03-ReachabilityCardinality-2024-04 is UNSAT
FORMULA Sudoku-PT-AN03-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem Sudoku-PT-AN03-ReachabilityCardinality-2024-06 is UNSAT
FORMULA Sudoku-PT-AN03-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 27/81 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/81 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 27/81 variables, 54/135 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/135 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/81 variables, 0/135 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 135 constraints, problems are : Problem set: 3 solved, 2 unsolved in 335 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 37/37 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 6/43 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/43 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Problem Sudoku-PT-AN03-ReachabilityCardinality-2024-09 is UNSAT
FORMULA Sudoku-PT-AN03-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem Sudoku-PT-AN03-ReachabilityCardinality-2024-10 is UNSAT
FORMULA Sudoku-PT-AN03-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 54/81 variables, and 64 constraints, problems are : Problem set: 5 solved, 0 unsolved in 90 ms.
Refiners :[Domain max(s): 37/54 constraints, Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/54 constraints, PredecessorRefiner: 0/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 532ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 2260 ms.
ITS solved all properties within timeout
BK_STOP 1717056575656
--------------------
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="Sudoku-PT-AN03"
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 Sudoku-PT-AN03, 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 r399-tall-171690530700590"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN03.tgz
mv Sudoku-PT-AN03 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 '
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 ;