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.r179-tall-171640601600462.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 GPPP-PT-C1000N0000001000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601600462
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 08:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 12 08:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 12 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 122K Apr 12 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 17 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1 May 18 16:42 large_marking
-rw-r--r-- 1 mcc users 21K May 18 16:42 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 GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-00
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-01
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-02
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-03
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-04
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-05
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-06
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-07
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-08
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-09
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-10
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-11
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-12
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-13
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-14
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716472980146

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C1000N0000001000
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 14:03:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 14:03:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 14:03:01] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2024-05-23 14:03:01] [INFO ] Transformed 33 places.
[2024-05-23 14:03:01] [INFO ] Transformed 22 transitions.
[2024-05-23 14:03:01] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 126 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 48033 steps (8 resets) in 245 ms. (195 steps per ms) remains 14/15 properties
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 631 ms. (63 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1187 ms. (33 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 506 ms. (78 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 315 ms. (126 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 178 ms. (223 steps per ms) remains 13/14 properties
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 107 ms. (370 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 97 ms. (408 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 65 ms. (606 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 13/13 properties
// Phase 1: matrix 22 rows 33 cols
[2024-05-23 14:03:02] [INFO ] Invariants computation overflowed in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-01 is UNSAT
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-02 is UNSAT
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-04 is UNSAT
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-06 is UNSAT
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-07 is UNSAT
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-08 is UNSAT
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-09 is UNSAT
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-10 is UNSAT
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-13 is UNSAT
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 22/54 variables, 32/32 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/32 constraints. Problems are: Problem set: 9 solved, 4 unsolved
Problem GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-00 is UNSAT
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-03 is UNSAT
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-05 is UNSAT
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 1/55 variables, 1/33 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/33 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/55 variables, 0/33 constraints. Problems are: Problem set: 12 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 33 constraints, problems are : Problem set: 12 solved, 1 unsolved in 427 ms.
Refiners :[State Equation: 33/33 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/17 variables, 5/7 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 1/8 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/39 variables, 15/23 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/23 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 13/52 variables, 9/32 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/32 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/55 variables, 2/34 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/55 variables, 0/34 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/55 variables, 0/34 constraints. Problems are: Problem set: 12 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 34 constraints, problems are : Problem set: 12 solved, 1 unsolved in 83 ms.
Refiners :[State Equation: 33/33 constraints, PredecessorRefiner: 1/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 571ms problems are : Problem set: 12 solved, 1 unsolved
Finished Parikh walk after 9010 steps, including 0 resets, run visited all 1 properties in 19 ms. (steps per millisecond=474 )
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-2024-11 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 27 ms.
All properties solved without resorting to model-checking.
Total runtime 2000 ms.
ITS solved all properties within timeout

BK_STOP 1716472983283

--------------------
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="GPPP-PT-C1000N0000001000"
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 GPPP-PT-C1000N0000001000, 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 r179-tall-171640601600462"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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