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.r245-tall-171654350200566.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 NoC3x3-PT-1B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654350200566
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 07:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 12 07:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 07:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 07:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 362K 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 NoC3x3-PT-1B-ReachabilityCardinality-2024-00
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-2024-01
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-2024-02
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-2024-03
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-2024-04
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-2024-05
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-2024-06
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-2024-07
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-2024-08
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-2024-09
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-2024-10
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-2024-11
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-2024-12
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-2024-13
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-2024-14
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716682045044

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-1B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 00:07:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-26 00:07:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 00:07:26] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2024-05-26 00:07:26] [INFO ] Transformed 1416 places.
[2024-05-26 00:07:26] [INFO ] Transformed 1640 transitions.
[2024-05-26 00:07:26] [INFO ] Found NUPN structural information;
[2024-05-26 00:07:26] [INFO ] Parsed PT model containing 1416 places and 1640 transitions and 3639 arcs in 245 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (30 resets) in 1482 ms. (26 steps per ms) remains 5/13 properties
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 369 ms. (108 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 4/5 properties
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 4/4 properties
// Phase 1: matrix 1640 rows 1416 cols
[2024-05-26 00:07:27] [INFO ] Computed 40 invariants in 34 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1198/1249 variables, 26/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1249 variables, 1198/1275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1249 variables, 0/1275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 167/1416 variables, 14/1289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1416 variables, 167/1456 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1416 variables, 0/1456 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1640/3056 variables, 1416/2872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3056 variables, 0/2872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/3056 variables, 0/2872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3056/3056 variables, and 2872 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1461 ms.
Refiners :[Domain max(s): 1416/1416 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 1416/1416 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1198/1249 variables, 26/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1249 variables, 1198/1275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 00:07:29] [INFO ] Deduced a trap composed of 102 places in 105 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1249 variables, 1/1276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1249 variables, 0/1276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 167/1416 variables, 14/1290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1416 variables, 167/1457 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 00:07:29] [INFO ] Deduced a trap composed of 85 places in 75 ms of which 2 ms to minimize.
[2024-05-26 00:07:30] [INFO ] Deduced a trap composed of 85 places in 55 ms of which 1 ms to minimize.
[2024-05-26 00:07:30] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1416 variables, 3/1460 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1416 variables, 0/1460 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1640/3056 variables, 1416/2876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3056 variables, 4/2880 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 00:07:31] [INFO ] Deduced a trap composed of 97 places in 83 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/3056 variables, 1/2881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3056 variables, 0/2881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/3056 variables, 0/2881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3056/3056 variables, and 2881 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3663 ms.
Refiners :[Domain max(s): 1416/1416 constraints, Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 1416/1416 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints]
After SMT, in 5244ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 38517 steps, including 81 resets, run visited all 4 properties in 129 ms. (steps per millisecond=298 )
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES PARIKH_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-2024-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-2024-02 TRUE 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 4 properties in 135 ms.
All properties solved without resorting to model-checking.
Total runtime 6492 ms.
ITS solved all properties within timeout

BK_STOP 1716682052829

--------------------
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="NoC3x3-PT-1B"
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 NoC3x3-PT-1B, 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 r245-tall-171654350200566"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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